String Processing and Information Retrieval 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings - Prima edizione

EAN (ISBN-13): 9783540890966
ISBN (ISBN-10): 3540890963
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2008
Editore: Springer Berlin Heidelberg
295 Pagine
Peso: 0,466 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-05-25T23:08:57+02:00 (Rome)
Pagina di dettaglio ultima modifica in 2024-02-28T15:33:25+01:00 (Rome)
ISBN/EAN: 9783540890966

ISBN - Stili di scrittura alternativi:
3-540-89096-3, 978-3-540-89096-6
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : turpin, amir, léger, alistair moffat
Titolo del libro: string processing information retrieval, spire, australia beyond, proceedings information, australia strings, australia our, alone across australia, the fifth string, melbourne, ufo symposium, november 1923 1933, november 2008, symposium notes

---

Dati dell'editore

Autore: Amihood Amir; Andrew Turpin; Alistair Moffat
Titolo: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; String Processing and Information Retrieval - 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings
Editore: Springer; Springer Berlin
295 Pagine
Anno di pubblicazione: 2008-10-22
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 295 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Data Mining; Verstehen; DNA analysis; Pattern Matching; algorithms; bioinformatics; bipartite matching; cognition; combinatorial algorithms; computational biology; data analysis; digital libraries; grammar; huffman codes; information retrieval; interchange rearrangement; natural language; data structures; Data Mining and Knowledge Discovery; Programming Techniques; Artificial Intelligence; Database Management; Data Science; Coding and Information Theory; Wissensbasierte Systeme, Expertensysteme; Computerprogrammierung und Softwareentwicklung; Künstliche Intelligenz; Datenbanken; Kodierungstheorie und Verschlüsselung (Kryptologie); Informationstheorie; EA

“Search Is a Solved Problem” and Other Annoying Fallacies.- Approximate Runs - Revisited.- Engineering Radix Sort for Strings.- Faster Text Fingerprinting.- Context-Sensitive Grammar Transform: Compression and Pattern Matching.- Improved Variable-to-Fixed Length Codes.- Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring.- The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships.- Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation.- Speeding Up Pattern Matching by Text Sampling.- Mismatch Sampling.- Sliding CDAWG Perfection.- Self-indexing Natural Language.- New Perspectives on the Prefix Array.- Indexed Hierarchical Approximate String Matching.- An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.- Practical Rank/Select Queries over Arbitrary Sequences.- Clique Analysis of Query Log Graphs.- Out of the Box Phrase Indexing.- Approximated Pattern Matching with the L 1, L 2 and L ??? Metrics.- Interchange Rearrangement: The Element-Cost Model.- ?? – Parameterized Matching.- Pattern Matching with Pair Correlation Distance.- Some Approximations for Shortest Common Nonsubsequences and Supersequences.- On the Structure of Small Motif Recognition Instances.- Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection.