Vai al contenuto principale della pagina
| Titolo: |
String Processing and Information Retrieval [[electronic resource] ] : 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings / / edited by Thierry Lecroq, Hélène Touzet
|
| Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Edizione: | 1st ed. 2021. |
| Descrizione fisica: | 1 online resource (257 pages) |
| Disciplina: | 005.746 |
| Soggetto topico: | Information storage and retrieval systems |
| Artificial intelligence | |
| Application software | |
| Computer science - Mathematics | |
| Information Storage and Retrieval | |
| Artificial Intelligence | |
| Computer and Information Systems Applications | |
| Mathematics of Computing | |
| Persona (resp. second.): | LecroqThierry |
| TouzetHélène | |
| Nota di contenuto: | Invited papers -- r-indexing the eBWT -- Unicode at Gigabytes per Second -- Combinatorics -- Longest Common Rollercoasters -- Minimal unique palindromic substrings after single-character substitution -- Permutation-constrained Common String Partitions with Applications -- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent -- String Covers of a Tree -- Compression -- Grammar Index By Induced Suffix Sorting -- An LMS-based Grammar Self-index with Local Consistency Properties -- On the approximation ratio of LZ-End to LZ77 -- Data Structures -- Computing the original eBWT faster, simpler, and with less memory -- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree -- findere: fast and precise approximate membership query -- Repeats -- Improved Topic Modeling in Twitter through Community Pooling -- Lower Bounds for the Number of Repetitions in 2D Strings -- On Stricter Reachable Repetitiveness Measures -- Information Retrieval -- Improved Topic modeling in Twitter through Community Pooling -- TSXor: A Simple Time Series Compression Algorithm -- Pattern Matching -- Exploiting Pseudo-Locality of Interchange Distance -- Position Heaps for Cartesian-tree Matching on Strings and Tries. |
| Sommario/riassunto: | This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually. |
| Titolo autorizzato: | String Processing and Information Retrieval ![]() |
| ISBN: | 3-030-86692-0 |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996464391903316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |