String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings by Nivio ZivianiString Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings by Nivio Ziviani

String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 Santiago…

byNivio ZivianiEditorRicardo Baeza-Yates

Hardcover | October 22, 2007

Pricing and Purchase Info

$120.17 online 
$136.95 list price save 12%
Earn 601 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007. Coverage in the 27 revised full papers includes dictionary algorithms, text searching, pattern matching, text compression, text mining, natural language processing, sequence driven protein structure prediction, XML, SGML, information retrieval from semi-structured data, text mining and generation of structured data from text.

Title:String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 Santiago…Format:HardcoverDimensions:311 pages, 23.5 × 15.5 × 0.07 inPublished:October 22, 2007Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540755292

ISBN - 13:9783540755296

Look for similar items by category:

Reviews

Table of Contents

A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences.- Edge-Guided Natural Language Text Compression.- Local Transpositions in Alignment of Polyphonic Musical Sequences.- Efficient Computations of ?1 and ???? Rearrangement Distances.- Generalized LCS.- Exploiting Genre in Focused Crawling.- Admission Policies for Caches of Search Engine Results.- A Pocket Guide to Web History.- Jump-Matching with Errors.- Estimating Number of Citations Using Author Reputation.- A Fast and Compact Web Graph Representation.- A Filtering Algorithm for k-Mismatch with Don't Cares.- Compact Set Representation for Information Retrieval.- Approximate Swap and Mismatch Edit Distance.- Approximating Constrained LCS.- Tuning Approximate Boyer-Moore for Gene Sequences.- Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage.- Indexing a Dictionary for Subset Matching Queries.- Extending Weighting Models with a Term Quality Measure.- Highly Frequent Terms and Sentence Retrieval.- Implicit Compression Boosting with Applications to Self-indexing.- A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees.- Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata.- Approximate String Matching with Lempel-Ziv Compressed Indexes.- Algorithms for Weighted Matching.- Efficient Text Proximity Search.- Prefix-Shuffled Geometric Suffix Tree.