+612 9045 4394
 
CHECKOUT
String Processing and Information Retrieval : 10th International Symposium, Spire 2003, Manaus, Brazil, October 8-10, 2003, Proceedings - Mario A. Nascimento

String Processing and Information Retrieval

10th International Symposium, Spire 2003, Manaus, Brazil, October 8-10, 2003, Proceedings

Paperback Published: 29th September 2003
ISBN: 9783540201779
Number Of Pages: 384

Share This Book:

Paperback

$135.51
or 4 easy payments of $33.88 with Learn more
Ships in 5 to 9 business days

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

Patterns on the Webp. 1
Current Challenges in Bioinformaticsp. 16
What's Changed? Measuring Document Change in Web Crawling for Search Enginesp. 28
Link Information as a Similarity Measure in Web Classificationp. 43
A Three Level Search Engine Index Based in Query Log Distributionp. 56
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithmp. 66
Alternative Algorithms for Bit-Parallel String Matchingp. 80
Bit-Parallel Approximate String Matching Algorithms with Transpositionp. 95
Processing of Huffman Compressed Texts with a Super-Alphabetp. 108
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databasesp. 122
Linear-Time Off-Line Text Compression by Longest-First Substitutionp. 137
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databasesp. 153
Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Modelp. 168
An Empirical Comparison of Text Categorization Methodsp. 183
Improving Text Retrieval in Medical Collections Through Automatic Categorizationp. 197
A Bit-Parallel Suffix Automaton Approach for ([delta], [gamma])-Matching in Music Retrievalp. 211
Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrievalp. 224
FindStem: Analysis and Evaluation of a Turkish Stemming Algorithmp. 238
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variantsp. 252
The Implementation and Evaluation of a Lexicon-Based Stemmerp. 266
French Noun Phrase Indexing and Mining for an Information Retrieval Systemp. 277
New Refinement Techniques for Longest Common Subsequence Algorithmsp. 287
The Size of Subsequence Automatonp. 304
Distributed Query Processing Using Suffix Arraysp. 311
BFT: Bit Filtration Technique for Approximate String Join in Biological Databasesp. 326
A Practical Index for Genome Searchingp. 341
Using WordNet for Word Sense Disambiguation to Support Concept Map Constructionp. 350
Memory-Adaptative Dynamic Spatial Approximation Treesp. 360
Large Edit Distance with Multiple Block Operationsp. 369
Author Indexp. 379
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540201779
ISBN-10: 3540201777
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 384
Published: 29th September 2003
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.06
Weight (kg): 0.55