Abstract is missing.
- Efficient One Dimensional Real Scaled MatchingAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur. 1-9 [doi]
- Linear Time Algorithm for the Longest Common Repeat ProblemInbok Lee, Costas S. Iliopoulos, Kunsoo Park. 10-17 [doi]
- Automaton-Based Sublinear Keyword Pattern MatchingLoek G. Cleophas, Bruce W. Watson, Gerard Zwaan. 18-29 [doi]
- Techniques for Efficient Query ExpansionBodo Billerbeck, Justin Zobel. 30-42 [doi]
- Inferring Query Performance Using Pre-retrieval Predictors.Ben He, Iadh Ounis. 43-54 [doi]
- A Scalable System for Identifying Co-derivative DocumentsYaniv Bernstein, Justin Zobel. 55-67 [doi]
- Searching for a Set of Correlated PatternsShmuel T. Klein, B. Riva Shalom. 68-69 [doi]
- Linear Nondeterministic Dawg String Matching AlgorithmLongtao He, Binxing Fang. 70-71 [doi]
- Permuted and Scaled String MatchingAyelet Butman, Revital Eres, Gad M. Landau. 72-73 [doi]
- Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCSKjell Lemström, Gonzalo Navarro, Yoan J. Pinzon. 74-75 [doi]
- A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech RecognitionYoonjae Lee, Hanseok Ko. 76-78 [doi]
- Fast Detection of Common Sequence Structure Patterns in RNAsRolf Backofen, Sven Siebert. 79-92 [doi]
- An Efficient Algorithm for the Longest Tandem Scattered Subsequence ProblemAdrian Kosowski. 93-100 [doi]
- Automatic Document Categorization Based on k-NN and Object-Based ThesauriSun Lee Bang, Hyung Jeong Yang, Jae Dong Yang. 101-112 [doi]
- Indexing Text Documents Based on Topic IdentificationManonton Butarbutar, Susan McRoy. 113-124 [doi]
- Cross-Comparison for Two-Dimensional Text CategorizationGiorgio Maria Di Nunzio. 125-126 [doi]
- DDOC: Overlapping Clustering of Words for Document ClassificationGuillaume Cleuziou, Lionel Martin, Viviane Clavier, Christel Vrain. 127-128 [doi]
- Evaluation of Web Page Representations by Content Through ClusteringArantza Casillas, Víctor Fresno, Mayte Teresa González de Lena, Raquel Martínez. 129-130 [doi]
- Evaluating Relevance Feedback and Display Strategies for Searching on Small DisplaysVishwa Vinay, Ingemar J. Cox, Natasa Milic-Frayling, Kenneth R. Wood. 131-133 [doi]
- Information Extraction by Embedding HMM to the Set of Induced Linguistic FeaturesHyun-Chul Lee, Jian Chang Mao. 134-135 [doi]
- Finding Cross-Lingual Spelling VariantsKrister Lindén. 136-137 [doi]
- An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible SizeDong Kyue Kim, Jeong Eun Jeon, Heejin Park. 138-149 [doi]
- An Alphabet-Friendly FM-IndexPaolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro. 150-160 [doi]
- Concurrency Control and I/O-Optimality in Bulk Insertion.Kerttu Pollari-Malmi, Eljas Soisalon-Soininen. 161-170 [doi]
- Processing Conjunctive and Phrase Queries with the Set-Based ModelBruno Pôssas, Nivio Ziviani, Berthier A. Ribeiro-Neto, Wagner Meira Jr.. 171-182 [doi]
- Metric Indexing for the Vector Model in Text RetrievalTomás Skopal, Pavel Moravec, Jaroslav Pokorný, Václav Snásel. 183-195 [doi]
- Negations and Document Length in Logical RetrievalDavid E. Losada, Alvaro Barreiro. 196-207 [doi]
- An Improvement and an Extension on the Hybrid Index for Approximate String MatchingHeikki Hyyrö. 208-209 [doi]
- First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-IndexSzymon Grabowski, Veli Mäkinen, Gonzalo Navarro. 210-211 [doi]
- Metric Indexes for Approximate String Matching in a DictionaryKimmo Fredriksson. 212-213 [doi]
- Simple Implementation of String B-Trees.Joong Chae Na, Kunsoo Park. 214-215 [doi]
- Alphabet Permutation for Differentially Encoding TextGad M. Landau, Ofer Levi, Steven Skiena. 216-217 [doi]
- A Space-Saving Linear-Time Algorithm for Grammar-Based CompressionHiroshi Sakamoto, Takuya Kida, Shinichi Shimozono. 218-229 [doi]
- Simple, Fast, and Efficient Natural Language Adaptive Compression.Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, José R. Paramá. 230-241 [doi]
- Searching XML Documents Using Relevance PropagationKaren Sauvagnat, Mohand Boughanem, Claude Chrisment. 242-254 [doi]
- Dealing with Syntactic Variation Through a Locality-Based ApproachJesús Vilares Ferro, Miguel A. Alonso. 255-266 [doi]
- Efficient Extraction of Structured Motifs Using Box-LinksAlexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot. 267-268 [doi]
- Efficient Computation of Balancedness in Binary Sequence GeneratorsPedro García-Mochales, Amparo Fúster-Sabater. 269-270 [doi]
- On Asymptotic Finite-State Error RepairManuel Vilares Ferro, Juan Otero, Jorge Graña Gil. 271-272 [doi]
- New Algorithms for Finding Monad Patterns in DNA SequencesRavi Vijaya Satya, Amar Mukherjee. 273-285 [doi]
- Motif Extraction from Weighted SequencesCostas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas. 286-297 [doi]
- Longest Motifs with a Functionally Equivalent Central BlockMaxime Crochemore, Raffaele Giancarlo, Marie-France Sagot. 298-209 [doi]
- On the Transformation Distance ProblemBehshad Behzadi, Jean-Marc Steyaert. 310-320 [doi]
- On Classification of StringsEljas Soisalon-Soininen, Tatu Ylönen. 321-330 [doi]