Abstract is missing.
- A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic SequencesMohamed Ibrahim Abouelhoda. 1-13 [doi]
- Edge-Guided Natural Language Text CompressionJoaquín Adiego, Miguel A. Martínez-Prieto, Pablo de la Fuente. 14-25 [doi]
- Local Transpositions in Alignment of Polyphonic Musical SequencesJulien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos. 26-38 [doi]
- Efficient Computations of ::::l::::::1:: and ::::l::::::infinity:: Rearrangement DistancesAmihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat. 39-49 [doi]
- Generalized LCSAmihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur. 50-61 [doi]
- Exploiting Genre in Focused CrawlingGuilherme T. de Assis, Alberto H. F. Laender, Marcos André Gonçalves, Altigran Soares da Silva. 62-73 [doi]
- Admission Policies for Caches of Search Engine ResultsRicardo A. Baeza-Yates, Flavio Junqueira, Vassilis Plachouras, Hans Friedrich Witschel. 74-85 [doi]
- A Pocket Guide to Web HistoryKlaus Berberich, Srikanta J. Bedathur, Gerhard Weikum. 86-97 [doi]
- Jump-Matching with ErrorsAyelet Butman, Noa Lewenstein, Benny Porat, Ely Porat. 98-106 [doi]
- Estimating Number of Citations Using Author ReputationCarlos Castillo, Debora Donato, Aristides Gionis. 107-117 [doi]
- A Fast and Compact Web Graph RepresentationFrancisco Claude, Gonzalo Navarro. 118-129 [doi]
- A Filtering Algorithm for ::::k:::: -Mismatch with Don t CaresRaphaël Clifford, Ely Porat. 130-136 [doi]
- Compact Set Representation for Information RetrievalJ. Shane Culpepper, Alistair Moffat. 137-148 [doi]
- Approximate Swap and Mismatch Edit DistanceYair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur. 149-163 [doi]
- Approximating Constrained LCSZvi Gotthilf, Moshe Lewenstein. 164-172 [doi]
- Tuning Approximate Boyer-Moore for Gene SequencesPetri Kalsi, Leena Salmela, Jorma Tarhio. 173-183 [doi]
- Optimal Self-adjusting Trees for Dynamic String Data in Secondary StoragePang Ko, Srinivas Aluru. 184-194 [doi]
- Indexing a Dictionary for Subset Matching QueriesGad M. Landau, Dekel Tsur, Oren Weimann. 195-204 [doi]
- Extending Weighting Models with a Term Quality MeasureChristina Lioma, Iadh Ounis. 205-216 [doi]
- Highly Frequent Terms and Sentence RetrievalDavid E. Losada, Ronald T. Fernández. 217-228 [doi]
- Implicit Compression Boosting with Applications to Self-indexingVeli Mäkinen, Gonzalo Navarro. 229-241 [doi]
- A Web-Page Usage Prediction Scheme Using Weighted Suffix TreesChristos Makris, Yannis Panagis, Evangelos Theodoridis, Athanasios K. Tsakalidis. 242-253 [doi]
- Enhancing Educational-Material Retrieval Using Authored-Lesson MetadataOlivier Motelet, Benjamin Piwowarski, Georges Dupret, José A. Pino, Nelson Baloian. 254-263 [doi]
- Approximate String Matching with Lempel-Ziv Compressed IndexesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. 264-275 [doi]
- Algorithms for Weighted MatchingLeena Salmela, Jorma Tarhio. 276-286 [doi]
- Efficient Text Proximity SearchRalf Schenkel, Andreas Broschart, Seung-won Hwang, Martin Theobald, Gerhard Weikum. 287-299 [doi]
- Prefix-Shuffled Geometric Suffix TreeTetsuo Shibuya. 300-309 [doi]