|
|
|
|
| LEADER |
03193nmm a2200361 u 4500 |
| 001 |
EB002002531 |
| 003 |
EBX01000000000000001165432 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
211011 ||| eng |
| 020 |
|
|
|a 9783030866921
|
| 100 |
1 |
|
|a Lecroq, Thierry
|e [editor]
|
| 245 |
0 |
0 |
|a String Processing and Information Retrieval
|h Elektronische Ressource
|b 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings
|c edited by Thierry Lecroq, Hélène Touzet
|
| 250 |
|
|
|a 1st ed. 2021
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2021, 2021
|
| 300 |
|
|
|a X, 255 p. 47 illus., 29 illus. in color
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Information Storage and Retrieval
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Information storage and retrieval systems
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 700 |
1 |
|
|a Touzet, Hélène
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-030-86692-1
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-030-86692-1?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 025.04
|
| 520 |
|
|
|a 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
|