14. SPIRE 2007: Santiago, Chile

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