11. SPIRE 2004: Padova, Italy

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