Symposium on String Processing and Information Retrieval (SPIRE) (2025)

↑ up

String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings

doi dblp
String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
doi dblp
Testing Quasiperiodicity.
Christine Awofeso|Ben Bals|Oded Lachish|Solon P. Pissis
doi dblp
KeBaB: k-mer Based Breaking for Finding Long MEMs.
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
doi dblp
Analysing New Entropy Measures for Tries.
Lorenzo Carfagna|Carlo Tosoni
doi dblp
Depth First Representations of k2-trees.
Gabriel Carmona|Giovanni Manzini
doi dblp
Prefix-Free Parsing for Merging Big BWTs.
Diego Díaz-Domínguez|Travis Gagie|Veronica Guerrini|Ben Langmead|Zsuzsanna Lipták|Giovanni Manzini|Francesco Masillo|Vikram Shivakumar
doi dblp
RLZ-r and LZ-End-r: Enhancing Move-r.
Patrick Dinklage|Johannes Fischer|Lukas Nalbach|Jan Zumbrink
doi dblp
Massively Parallel Computation of Matching Statistics.
Anastasia C. Diseth|Keijo Heljanko|Simon J. Puglisi
doi dblp
Cache-Friendly Compressed Boolean Matrices.
Antonio Fariña|Adrián Gómez-Brandón|Asunción Gómez-Colomer|Gonzalo Navarro
doi dblp
Tight Additive Sensitivity on LZ-Style Compressors and String Attractors.
Yuto Fujie|Hiroki Shibata|Yuto Nakashima|Shunsuke Inenaga
doi dblp
On the Number of MUSs Crossing a Position.
Hiroto Fujimaru|Takuya Mieno|Shunsuke Inenaga
doi dblp
String Consensus Problems with Swaps and Substitutions.
Estéban Gabory|Laurent Bulteau|Gabriele Fici|Hilde Verbeek
doi dblp
Two-Player Communication Complexity of Pattern Matching.
Pawel Gawrychowski|Wojciech Janczewski
doi dblp
REINDEER2: Practical Abundance Index at Scale.
Yohan Hernandez-Courbevoie|Mikaël Salson|Chloé Bessière|Haoliang Xue|Daniel Gautheret|Camille Marchet|Antoine Limasset
doi dblp
Efficient Computation of Closed Substrings.
Samkith K. Jain|Neerja Mhaskar
doi dblp
Nyldon Factorization of Thue-Morse Words and Fibonacci Words.
Kaisei Kishi|Kazuki Kai|Yuto Nakashima|Shunsuke Inenaga|Hideo Bannai
doi dblp
Dorst-Smeulders Coding for Arbitrary Binary Words.
Alessandro De Luca|Gabriele Fici
doi dblp
String Matching with a Dynamic Pattern.
Bruno Monteiro|Vinícius Fernandes dos Santos
doi dblp
Smallest Suffixient Sets as a Repetitiveness Measure.
Gonzalo Navarro|Giuseppe Romana|Cristian Urbina
doi dblp
Longest Unbordered Factors on Run-Length Encoded Strings.
Shoma Sekizaki|Takuya Mieno
doi dblp
Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings.
B. Riva Shalom|Eitan Kondratovsky|Ely Porat
doi dblp
Practical Algorithms for Hierarchical Overlap Graphs.
Saumya Talera|Parth Bansal|Shabnam Khan|Shahbaz Khan
doi dblp
Counting Distinct (Non-)crossing Substrings.
Haruki Umezaki|Hiroki Shibata|Dominik Köppl|Yuto Nakashima|Shunsuke Inenaga|Hideo Bannai
doi dblp
Faster Algorithm for Bounded Damerau-Levenshtein Distance.
Ryosuke Yamano|Tetsuo Shibuya