String processing and information retrieval : 10th international symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003 : proceedings / Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira (eds.).
By: (10th : SPIRE (Symposium) (10th : 2003 : Manaus, Brazil)
Contributor(s): Nascimento, Mario A | Moura, Edleno S. de | Oliveira, Arlindo L | LINK (Online service)Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 2857.Publisher: Berlin ; Hong Kong : Springer-Verlag, ©2003Description: 1 online resource (xi, 377 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540399841; 3540399844Other title: SPIRE 2003Subject(s): Text processing (Computer science) -- Congresses | Information storage and retrieval systems -- Congresses | Information storage and retrieval systems | Text processing (Computer science)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: String processing and information retrieval.DDC classification: 005.74 LOC classification: QA76.9.T48Other classification: 06.64 | 54.60 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Print version record.
This book constitutes the refereed proceedings of the 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, held in Manaus, Brazil, in October 2003. The 21 revised full papers and 6 revised short papers presented together with 2 invited papers were carefully reviewed and selected from 54 submissions. The papers are organized in topical sections on Web algorithms, bit-parallel algorithms, compression, categorization and ranking, music retrieval, multilingual information retrieval, subsequences and distributed algorithms, and algorithms on strings and trees.
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 (?,?)-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.