default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd SPIRE 2025: London, UK
- Golnaz Badkobeh
, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates:
String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings. Lecture Notes in Computer Science 16073, Springer 2026, ISBN 978-3-032-05227-8 - Christine Awofeso, Ben Bals, Oded Lachish, Solon P. Pissis:
Testing Quasiperiodicity. 1-9 - Nathaniel K. Brown, Lore Depuydt, Mohsen Zakeri, Anas Alhadi, Nour Allam, Dove Begleiter, Nithin Bharathi Kabilan Karpagavalli, Suchith Sridhar Khajjayam, Hamza Wahed, Travis Gagie, Ben Langmead:
KeBaB: k-mer Based Breaking for Finding Long MEMs. 10-17 - Lorenzo Carfagna, Carlo Tosoni:
Analysing New Entropy Measures for Tries. 18-27 - Gabriel Carmona, Giovanni Manzini:
Depth First Representations of k2-trees. 28-44 - Alessandro De Luca, Gabriele Fici:
Dorst-Smeulders Coding for Arbitrary Binary Words. 45-53 - Diego Díaz-Domínguez, Travis Gagie, Veronica Guerrini, Ben Langmead, Zsuzsanna Lipták, Giovanni Manzini, Francesco Masillo, Vikram Shivakumar:
Prefix-Free Parsing for Merging Big BWTs. 54-63 - Patrick Dinklage, Johannes Fischer, Lukas Nalbach, Jan Zumbrink:
RLZ-r and LZ-End-r: Enhancing Move-r. 64-78 - Anastasia C. Diseth, Keijo Heljanko, Simon J. Puglisi:
Massively Parallel Computation of Matching Statistics. 79-94 - Antonio Fariña, Adrián Gómez-Brandón, Asunción Gómez-Colomer, Gonzalo Navarro:
Cache-Friendly Compressed Boolean Matrices. 95-108 - Yuto Fujie, Hiroki Shibata, Yuto Nakashima, Shunsuke Inenaga:
Tight Additive Sensitivity on LZ-Style Compressors and String Attractors. 109-123 - Hiroto Fujimaru, Takuya Mieno, Shunsuke Inenaga:
On the Number of MUSs Crossing a Position. 124-132 - Estéban Gabory, Laurent Bulteau, Gabriele Fici, Hilde Verbeek:
String Consensus Problems with Swaps and Substitutions. 133-147 - Pawel Gawrychowski, Wojciech Janczewski:
Two-Player Communication Complexity of Pattern Matching. 148-155 - Yohan Hernandez-Courbevoie, Mikaël Salson, Chloé Bessière, Haoliang Xue, Daniel Gautheret, Camille Marchet, Antoine Limasset:
REINDEER2: Practical Abundance Index at Scale. 156-171 - Samkith K. Jain, Neerja Mhaskar:
Efficient Computation of Closed Substrings. 172-187 - Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Nyldon Factorization of Thue-Morse Words and Fibonacci Words. 188-201 - Bruno Monteiro, Vinícius Fernandes dos Santos:
String Matching with a Dynamic Pattern. 202-216 - Gonzalo Navarro, Giuseppe Romana, Cristian Urbina:
Smallest Suffixient Sets as a Repetitiveness Measure. 217-232 - Shoma Sekizaki, Takuya Mieno:
Longest Unbordered Factors on Run-Length Encoded Strings. 233-247 - B. Riva Shalom, Eitan Kondratovsky, Ely Porat:
Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings. 248-264 - Saumya Talera, Parth Bansal, Shabnam Khan, Shahbaz Khan:
Practical Algorithms for Hierarchical Overlap Graphs. 265-280 - Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Counting Distinct (Non-)crossing Substrings. 281-290 - Ryosuke Yamano, Tetsuo Shibuya:
Faster Algorithm for Bounded Damerau-Levenshtein Distance. 291-303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
