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

Mohamed Abouelhoda (auth.), Nivio Ziviani, Ricardo Baeza-Yates (eds.)3540755292, 9783540755296

This book constitutes the refereed proceedings of the 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007, held in Santiago, Chile, October 29-31, 2007.

The 27 revised full papers presented were carefully reviewed and selected from 77 submissions. The papers topics span dictionary algorithms, text searching, pattern matching, text compression, text mining, natural language processing, automata based string processing, IR modelling, indexing, ranking and filtering, interface design, visualization, cross-lingual IR systems, multimedia IR, digital libraries, collaborative retrieval, Web related applications, DNA sequencing and applications in molecular biology, evolution and phylogenetics, recognition of genes and regulatory elements, sequence driven protein structure prediction, XML, SGML, information retrieval from semi-structured data, text mining and generation of structured data from text.

---

Table of contents :
Front Matter….Pages –
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences….Pages 1-13
Edge-Guided Natural Language Text Compression….Pages 14-25
Local Transpositions in Alignment of Polyphonic Musical Sequences….Pages 26-38
Efficient Computations of ℓ 1 and ℓ  ∞  Rearrangement Distances….Pages 39-49
Generalized LCS….Pages 50-61
Exploiting Genre in Focused Crawling….Pages 62-73
Admission Policies for Caches of Search Engine Results….Pages 74-85
A Pocket Guide to Web History….Pages 86-97
Jump-Matching with Errors….Pages 98-106
Estimating Number of Citations Using Author Reputation….Pages 107-117
A Fast and Compact Web Graph Representation….Pages 118-129
A Filtering Algorithm for k -Mismatch with Don’t Cares….Pages 130-136
Compact Set Representation for Information Retrieval….Pages 137-148
Approximate Swap and Mismatch Edit Distance….Pages 149-163
Approximating Constrained LCS….Pages 164-172
Tuning Approximate Boyer-Moore for Gene Sequences….Pages 173-183
Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage….Pages 184-194
Indexing a Dictionary for Subset Matching Queries….Pages 195-204
Extending Weighting Models with a Term Quality Measure….Pages 205-216
Highly Frequent Terms and Sentence Retrieval….Pages 217-228
Implicit Compression Boosting with Applications to Self-indexing….Pages 229-241
A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees….Pages 242-253
Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata….Pages 254-263
Approximate String Matching with Lempel-Ziv Compressed Indexes….Pages 264-275
Algorithms for Weighted Matching….Pages 276-286
Efficient Text Proximity Search….Pages 287-299
Prefix-Shuffled Geometric Suffix Tree….Pages 300-309
Back Matter….Pages –