String Processing and Information Retrieval

14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings

AvNivio Ziviani,Ricardo Baeza-Yates

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

565 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2007-10-22
Mått:155 x 235 x 18 mm
Vikt:499 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:311
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540755296

Utforska kategorier

Databaser inom Data och IT

Innehållsförteckning

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.