12. SPIRE 2005: Buenos Aires, Argentina

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