String Processing and Information Retrieval
Springer International Publishing (Verlag)
978-3-031-20642-9 (ISBN)
The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. information retrieval;
This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held in Concepción, Chile, in November 2022.
The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.
String Algorithms.- Subsequence Covers of Words.- Maximal Closed Substrings.- Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions.- The Complexity of the Co-Occurrence Problem.- Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays.- Computing the Parameterized Burrows-Wheeler Transform Online.- Accessing the Suffx Array via -1 -Forest.- On the Optimisation of the GSACA Suffx Array Construction Algorithm.- String Compression.- Balancing Run-Length Straight-Line Programs.- Substring Complexities on Run-length Compressed Strings.- Information Retrieval.- How Train-Test Leakage Affects Zero-shot Retrieval.- Computational Biology.- Genome Comparison on Succinct Colored de Bruijn Graphs.- Sorting Genomes by Prefix Double-Cut-and-Joins.- KATKA: A KRAKEN-like Tool with k Given at Query Time.- Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads.- Space-Effcient Data Structures.- Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries.- Compressed String Dictionaries via Data-Aware Subtrie Compaction.- On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs.- Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors.- Pattern Matching in Strings, Graphs, and Trees.- Matching Patterns with Variables Under Edit Distance.- On the Hardness of Computing the Edit Distance of Shallow Trees.- Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs.- Pattern Matching under DTW Distance.
| Erscheinungsdatum | 02.11.2022 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XVII, 332 p. 66 illus., 41 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 539 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Adaptive Algorithms • Applications • Artificial Intelligence • Computer Hardware • Computer Science • Computer systems • computer vision • conference proceedings • Correlation Analysis • evolutionary algorithms • Genetic algorithms • graph theory • Image Processing • Informatics • Research • Signal Processing • Swarm intelligence • theoretical computer science |
| ISBN-10 | 3-031-20642-8 / 3031206428 |
| ISBN-13 | 978-3-031-20642-9 / 9783031206429 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
