String Processing and Information Retrieval

1. Front Matter

   PDF

2. Invited Papers

   1. Patterns on the Web

      • Krishna Bharat

      Pages 1-15

   2. Current Challenges in Bioinformatics

      • João Meidanis

      Pages 16-27

3. Web Algorithms

   1. What’s Changed? Measuring Document Change in Web Crawling for Search Engines

      • Halil Ali, Hugh E. Williams

      Pages 28-42

   2. Link Information as a Similarity Measure in Web Classification

      • Marco Cristo, Pável Calado, Edleno Silva de Moura, Nivio Ziviani, Berthier Ribeiro-Neto

      Pages 43-55

   3. A Three Level Search Engine Index Based in Query Log Distribution

      • Ricardo Baeza-Yates, Felipe Saint-Jean

      Pages 56-65

4. Bit-Parallel Algorithms

   1. Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm

      • Kimmo Fredriksson

      Pages 66-79

   2. Alternative Algorithms for Bit-Parallel String Matching

      • Hannu Peltola, Jorma Tarhio

      Pages 80-93

   3. Bit-Parallel Approximate String Matching Algorithms with Transposition

      • Heikki Hyyrö

      Pages 95-107

5. Compression

   1. Processing of Huffman Compressed Texts with a Super-Alphabet

      • Kimmo Fredriksson, Jorma Tarhio

      Pages 108-121

   2. (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases

      • Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, María F. Esteller

      Pages 122-136

   3. Linear-Time Off-Line Text Compression by Longest-First Substitution

      • Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara

      Pages 137-152

   4. SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases

      • Joaquín Adiego, Gonzalo Navarro, Pablo de la Fuente

      Pages 153-167

6. Categorization and Ranking

   1. Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model

      • Fabio Crestani, Luis M. de Campos, Juan M. Fernández-Luna, Juan F. Huete

      Pages 168-182

   2. An Empirical Comparison of Text Categorization Methods

      • Ana Cardoso-Cachopo, Arlindo L. Oliveira

      Pages 183-196

   3. Improving Text Retrieval in Medical Collections Through Automatic Categorization

      • Rodrigo F. Vale, Berthier A. Ribeiro-Neto, Luciano R. S. de Lima, Alberto H. F. Laender, Hermes R. F. Junior

      Pages 197-210

7. Music Retrieval

   1. A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval

      • Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon

      Pages 211-223

   2. Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval

      • Kjell Lemström, Gonzalo Navarro

      Pages 224-237

8. Multilingual Information Retrieval

   1. FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm

      • Hayri Sever, Yıltan Bitirim

      Pages 238-251

   2. Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants

      • Heikki Keskustalo, Ari Pirkola, Kari Visala, Erkka Leppänen, Kalervo Järvelin

      Pages 252-265

This volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, held in Manaus, Brazil. SPIRE 2003 received 54 full submissions from 17 countries, namely: - gentina(2), Australia(2), Brazil(9),Canada(1),Chile (4),Colombia(2),Czech Republic (1), Finland (10), France (1), Japan (2), Korea (5), Malaysia (1), P- tugal (2), Spain (6), Turkey (1), UK (1), USA (4) – the numbers in parentheses indicate the number of submissions from that country. In the nontrivial task of selecting the papers to be published in these proceedings we were fortunate to count on a very international program committee with 43 members, represe- ing all continents but one. These people, in turn, used the help of 40 external referees. During the review processall but a few papers had four reviewsinstead of the usual three, and at the end 21 submissions were accepted to be p- lished as full papers, yielding an acceptance rate of about 38%. An additional set of six short papers was also accepted. The technical program spans over the two well-de?ned scopes of SPIRE (string processing and information retrieval) with a number of papers also focusing on important application domains such as bioinformatics. SPIRE 2003 also features two invited speakers: Krishna Bharat (Google, Inc. ) and Joa ˜o Meidanis (State Univ. of Campinas and Scylla Bioinformatics).

• Alphabet
• Bayesian network
• Huffman
• Web Crawling
• Web data analysis
• Web queries
• XML querying
• algorithms
• bioinformatics
• information retrieval
• proving
• search algorithms
• searching
• string processing
• text mining
• data structures
• algorithm analysis and problem complexity

• Department of Computing Science, University of Alberta, Canada

  Mario A. Nascimento

• Universidade Federal do Amazonas, Manaus, Brasil

  Edleno S. Moura

• INESC-ID/IST, Lisboa, Portugal

  Arlindo L. Oliveira

Policies and ethics