Buch, Englisch, 323 Seiten, Format (B × H): 155 mm x 235 mm
33rd International Symposium, SPIRE 2026, Hamilton, ON, Canada, October 13–15, 2026, Proceedings
Buch, Englisch, 323 Seiten, Format (B × H): 155 mm x 235 mm
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-42865-3
Verlag: Springer
This book constitutes the refereed proceedings of the 33rd International Symposium on String Processing and Information Retrieval, SPIRE 2026, held in Hamilton, ON, Canada, during October 2026.
The 19 full papers and 4 short papers included in this book were carefully reviewed and selected from 47 submissions. SPIRE continues the long and well-established tradition of encouraging high-quality research at the broad nexus of string processing, information retrieval, and computational biology.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Technische Informatik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
Weitere Infos & Material
.- Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries.
.- $k^2$-octopus: An adaptive data structure for binary matrices.
.- Faster Iterative $\phi$ Queries on the Positional BWT.
.- Solving Square-Submatrix Equation Systems.
.- Contour-Based Motif Discovery via the Cartesian Tree BWT Index.
.- Sketching Burst Hamming Distance.
.- Inverse String Folding with Minimum Crease Complexity.
.- Binary search and set operations on compacted k-mer lists.
.- Computing Smallest Sufficient Arrays in Sublinear Time.
.- Computing Maximal Repeating Subsequences in a String.
.- Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance.
.- The parameterized periodicity lemma.
.- Linear-Time Reverse Engineering of Linear-Size Suffix Tries.
.- Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars.
.- Tighter Bounds for Wheeler Determinization.
.- Optimal-Time Contextual Pattern Matching in Compressed Spac.
.- Practical Linear-Time Computation of Smallest Sufficient Sets.
.- Fast computation of specific words and matching statistics in CDAWG space.
.- Online computation of maximal closed substrings.
.- Generating Minimum-Density Minimizers.
.- Parameterized Complexity of k-Pseudoperiodicity.
.- Longest Common Substring After k Edits in Compact Space (Short Paper).
.- Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings.
