String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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).

Author(s): Krishna Bharat (auth.), Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira (eds.)
Series: Lecture Notes in Computer Science 2857
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003

Language: English
Pages: 384
Tags: Information Storage and Retrieval; Data Structures; Files; Algorithm Analysis and Problem Complexity; Database Management; Artificial Intelligence (incl. Robotics)

Front Matter....Pages -
Patterns on the Web....Pages 1-15
Current Challenges in Bioinformatics....Pages 16-27
What’s Changed? Measuring Document Change in Web Crawling for Search Engines....Pages 28-42
Link Information as a Similarity Measure in Web Classification....Pages 43-55
A Three Level Search Engine Index Based in Query Log Distribution....Pages 56-65
Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm....Pages 66-79
Alternative Algorithms for Bit-Parallel String Matching....Pages 80-93
Bit-Parallel Approximate String Matching Algorithms with Transposition....Pages 95-107
Processing of Huffman Compressed Texts with a Super-Alphabet....Pages 108-121
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases....Pages 122-136
Linear-Time Off-Line Text Compression by Longest-First Substitution....Pages 137-152
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases....Pages 153-167
Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model....Pages 168-182
An Empirical Comparison of Text Categorization Methods....Pages 183-196
Improving Text Retrieval in Medical Collections Through Automatic Categorization....Pages 197-210
A Bit-Parallel Suffix Automaton Approach for ( δ , γ )-Matching in Music Retrieval....Pages 211-223
Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval....Pages 224-237
FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm....Pages 238-251
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants....Pages 252-265
The Implementation and Evaluation of a Lexicon-Based Stemmer....Pages 266-276
French Noun Phrase Indexing and Mining for an Information Retrieval System....Pages 277-286
New Refinement Techniques for Longest Common Subsequence Algorithms....Pages 287-303
The Size of Subsequence Automaton....Pages 304-310
Distributed Query Processing Using Suffix Arrays....Pages 311-325
BFT: Bit Filtration Technique for Approximate String Join in Biological Databases....Pages 326-340
A Practical Index for Genome Searching....Pages 341-349
Using WordNet for Word Sense Disambiguation to Support Concept Map Construction....Pages 350-359
Memory-Adaptative Dynamic Spatial Approximation Trees....Pages 360-368
Large Edit Distance with Multiple Block Operations....Pages 369-377
Back Matter....Pages -