Abstract is missing.
- Enhanced Byte Codes with Restricted Prefix PropertiesJ. Shane Culpepper, Alistair Moffat. 1-12 [doi]
- Experimental Analysis of a Fast Intersection Algorithm for Sorted SequencesRicardo A. Baeza-Yates, Alejandro Salinger. 13-24 [doi]
- Compressed Perfect Embedded Skip Lists for Quick Inverted-Index LookupsPaolo Boldi, Sebastiano Vigna. 25-28 [doi]
- XML Retrieval with a Natural Language InterfaceXavier Tannier, Shlomo Geva. 29-40 [doi]
- Recommending Better Queries from Click-Through DataGeorges Dupret, Marcelo Mendoza. 41-44 [doi]
- A Bilingual Linking Service for the WebAlessandra A. Macedo, José Antonio Camacho Guerrero, Maria da Graça Campos Pimentel. 45-48 [doi]
- Evaluating Hierarchical Clustering of Search ResultsJuan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo. 49-54 [doi]
- Counting Suffix Arrays and StringsKlaus-Bernd Schürmann, Jens Stoye. 55-66 [doi]
- Towards Real-Time Suffix Tree ConstructionAmihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein. 67-78 [doi]
- Rank-Sensitive Data StructuresIwona Bialynicka-Birula, Roberto Grossi. 79-90 [doi]
- Cache-Conscious Collision Resolution in String Hash TablesNikolas Askitis, Justin Zobel. 91-102 [doi]
- Measuring the Difficulty of Distance-Based IndexingMatthew Skala. 103-114 [doi]
- ::::N::::-Gram Similarity and DistanceGrzegorz Kondrak. 115-126 [doi]
- Using the ::::k::::-Nearest Neighbor Graph for Proximity Searching in Metric SpacesRodrigo Paredes, Edgar Chávez. 127-138 [doi]
- Classifying Sentences Using Induced StructureMenno van Zaanen, Luiz Augusto Sangoi Pizzato, Diego Mollá. 139-150 [doi]
- Counting Lumps in Word Space: Density as a Measure of Corpus HomogeneityMagnus Sahlgren, Jussi Karlgren. 151-154 [doi]
- Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-SimilarityYi Feng, Zhaohui Wu, Zhongmei Zhou. 155-160 [doi]
- Lydia: A System for Large-Scale News AnalysisLevon Lloyd, Dimitrios Kechagias, Steven Skiena. 161-166 [doi]
- Composite Pattern Discovery for PCR ApplicationStanislav Angelov, Shunsuke Inenaga. 167-178 [doi]
- Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor ArrayPierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Marie-France Sagot. 179-190 [doi]
- Linear Time Algorithm for the Generalised Longest Common Repeat ProblemInbok Lee, Yoan José Pinzón Ardila. 191-201 [doi]
- Application of Clustering Technique in Multiple Sequence AlignmentPatrícia Peres, Edleno Silva de Moura. 202-205 [doi]
- Stemming Arabic Conjunctions and PrepositionsAbdusalam F. A. Nwesri, Seyed M. M. Tahaghoghi, Falk Scholer. 206-217 [doi]
- XML Multimedia RetrievalZhigang Kong, Mounia Lalmas. 218-223 [doi]
- Retrieval Status Values in Information Retrieval EvaluationAmélie Imafouo, Xavier Tannier. 224-227 [doi]
- A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error CountingRicardo Madariaga, José Castillo, José Ramón Hilera. 228-233 [doi]
- Necklace Swap Problem for Rhythmic Similarity MeasuresYoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed. 234-245 [doi]
- Faster Generation of Super Condensed Neighbourhoods Using Finite AutomataLuís M. S. Russo, Arlindo L. Oliveira. 246-255 [doi]
- Restricted Transposition Invariant Approximate String Matching Under Edit DistanceHeikki Hyyrö. 256-266 [doi]
- Fast Plagiarism Detection SystemMaxim Mozgovoy, Kimmo Fredriksson, Daniel R. White, Mike Joy, Erkki Sutinen. 267-270 [doi]
- A Model for Information Retrieval Based on Possibilistic NetworksAsma Brini, Mohand Boughanem, Didier Dubois. 271-282 [doi]
- Comparison of Representations of Multiple Evidence Using a Functional Framework for IRIlmério Silva, João Nunes Souza, Luciene Oliveira. 283-294 [doi]
- Deriving TF-IDF as a Fisher KernelCharles Elkan. 295-300 [doi]
- Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence ProblemLasse Bergroth. 301-314 [doi]
- Computing Similarity of Run-Length Encoded Strings with Affine Gap PenaltyJin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. 315-326 [doi]
- L::1:: Pattern Matching Lower BoundOhad Lipsky, Ely Porat. 327-330 [doi]
- Approximate Matching in the L::infinity:: MetricOhad Lipsky, Ely Porat. 331-334 [doi]
- An Edit Distance Between RNA Stem-LoopsValentin Guignon, Cedric Chauve, Sylvie Hamel. 335-347 [doi]
- A Multiple Graph Layers Model with Application to RNA Secondary Structures ComparisonJulien Allali, Marie-France Sagot. 348-359 [doi]
- Normalized Similarity of RNA SequencesRolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann. 360-369 [doi]
- A Fast Algorithmic Technique for Comparing Large Phylogenetic TreesGabriel Valiente. 370-375 [doi]
- Practical and Optimal String MatchingKimmo Fredriksson, Szymon Grabowski. 376-387 [doi]
- A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC sHisashi Tsuji, Akira Ishino, Masayuki Takeda. 388-398 [doi]
- A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings MatchingPing Liu, Yanbing Liu, Jianlong Tan. 399-404 [doi]