32nd International Symposium on String Processing and Information Retrieval
September 08 -11, London, UK
September 08 -11, London, UK
Samkith K Jain and Neerja Mhaskar. Efficient Computation of Closed Substrings
B. Riva Shalom, Eitan Kondratovsky and Ely Porat. Longest Common Subsequence in k-length substrings for Run-Length-Encoded strings
Estéban Gabory, Laurent Bulteau, Hilde Verbeek and Gabriele Fici. String Consensus Problems with Swaps and Substitutions
Patrick Dinklage, Johannes Fischer, Lukas Nalbach and Jan Zumbrink. RLZ-r and LZ-End-r: Enhancing Move-r
Ryosuke Yamano and Tetsuo Shibuya. Faster Algorithm for Bounded Damerau–Levenshtein Distance
Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. Counting distinct (non-)crossing substrings
Gonzalo Navarro, Giuseppe Romana and Cristian Urbina. Smallest Suffixient Sets as a Repetitiveness Measure
Yuto Fujie, Hiroki Shibata, Yuto Nakashima and Shunsuke Inenaga. Tight Additive Sensitivity on LZ-style Compressors and String Attractors
Shoma Sekizaki and Takuya Mieno. Longest Unbordered Factors on Run-Length Encoded Strings
Alessandro De Luca and Gabriele Fici. Dorst–Smeulders Coding for Arbitrary Binary Words
Yohan Hernandez Courbevoie, Mikaël Salson, Chloé Bessière, Haoliang Xue, Daniel Gautheret, Camille Marchet and Antoine Limasset. REINDEER2: practical abundance index at scale
Anastasia Diseth, Keijo Heljanko and Simon Puglisi. Massively Parallel Computation of Matching Statistics
Antonio Fariña, Asunción Gómez, Adrián Gómez-Brandón and Gonzalo Navarro. Cache-Friendly Compressed Boolean Matrices
Gabriel Carmona and Giovanni Manzini. Depth first representations of k^2-trees
Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. Nyldon Factorization of Thue-Morse Words and Fibonacci Word
Bruno Monteiro and Vinícius dos Santos. String Matching with a Dynamic Pattern
Saumya Talera, Parth Bansal, Shabnam Khan and Shahbaz Khan. Practical algorithms for Hierarchical overlap graphs
Lorenzo Carfagna and Carlo Tosoni. Analysing New Entropy Measures for Tries
Christine Awofeso, Ben Bals, Oded Lachish and Solon Pissis. Testing Quasiperiodicity
Hiroto Fujimaru, Takuya Mieno and Shunsuke Inenaga. On the number of MUSs crossing a position
Nathaniel Brown, Lore Depuydt, Mohsen Zakeri, Anas Alhadi, Nour Allam, Dove Begleiter, Nithin Bharathi Kabilan Karpagavalli, Suchith Sridhar Khajjayam, Hamza Wahed, Travis Gagie and Benjamin Langmead. KeBaB: k-mer based breaking for finding long MEMs
Pawel Gawrychowski and Wojciech Janczewski. Two-Player Communication Complexity of Pattern Matching
Diego Diaz, Travis Gagie, Veronica Guerrini, Benjamin Langmead, Zsuzsanna Liptak, Giovanni Manzini, Francesco Masillo and Vikram Shivakumar. Prefix-free parsing for merging big BWTs