Cantitate/Preț
Produs

String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings: Lecture Notes in Computer Science, cartea 4726

Editat de Nivio Ziviani, Ricardo Baeza-Yates
en Limba Engleză Paperback – 22 oct 2007

Din seria Lecture Notes in Computer Science

Preț: 32813 lei

Preț vechi: 41015 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6280 6523$ 5216£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540755296
ISBN-10: 3540755292
Pagini: 328
Ilustrații: XII, 311 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.49 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.