String Processing and Information Retrieval 14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings /
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2007.
|
| Σειρά: | Lecture Notes in Computer Science,
4726 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
