<p>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 Informati
String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings (Lecture Notes in Computer Science, 2857)
β Scribed by Mario A. Nascimento (editor), Edleno S. de Moura (editor), Arlindo L. Oliveira (editor)
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Leaves
- 389
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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).
β¦ Table of Contents
Frontmatter
Invited Papers
Patterns on the Web
Current Challenges in Bioinformatics
Web Algorithms
What's Changed? Measuring Document Change in Web Crawling for Search Engines
Link Information as a Similarity Measure in Web Classification
A Three Level Search Engine Index Based in Query Log Distribution
Bit-Parallel Algorithms
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm
Alternative Algorithms for Bit-Parallel String Matching
Bit-Parallel Approximate String Matching Algorithms with Transposition
Compression
Processing of Huffman Compressed Texts with a Super-Alphabet
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
Linear-Time Off-Line Text Compression by Longest-First Substitution
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases
Categorization and Ranking
Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model
An Empirical Comparison of Text Categorization Methods
Improving Text Retrieval in Medical Collections Through Automatic Categorization
Music Retrieval
A Bit-Parallel Suffix Automaton Approach for ($\delta$,$\gamma$)-Matching in Music Retrieval
Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval
Multilingual Information Retrieval
FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
The Implementation and Evaluation of a Lexicon-Based Stemmer
French Noun Phrase Indexing and Mining for an Information Retrieval System
Subsequences and Distributed Algorithms
New Refinement Techniques for Longest Common Subsequence Algorithms
The Size of Subsequence Automaton
Distributed Query Processing Using Suffix Arrays
Algorithms on Strings and Trees
BFT: Bit Filtration Technique for Approximate String Join in Biological Databases
A Practical Index for Genome Searching
Using WordNet for Word Sense Disambiguation to Support Concept Map Construction
Memory-Adaptative Dynamic Spatial Approximation Trees
Large Edit Distance with Multiple Block Operations
Backmatter
π SIMILAR VOLUMES
<span>The papers contained in this volume were presented at the 11th Conference on String Processing and Information Retrieval (SPIRE), held Oct. 5-8, 2004 at the Department of Information Engineering of the University of Padova, Italy. They wereselected from 123 paperssubmitted in responseto the ca
<p><span>This volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26β28, 2023. </span></p><p><span>The 31 full papers presented were carefully reviewed and selecte
<span>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 9th International Symposium on String Processing and Informa
<span>This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held in ConcepciΓ³n, Chile, in November 2022.<br></span><p><span>The 23 full papers presented in this volume were carefully reviewed and selected from 4
<span>This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original