Abstract is missing.
- PalFM-Index: FM-Index for Palindrome Pattern MatchingShinya Nagashita, Tomohiro I. [doi]
- From Bit-Parallelism to Quantum String Matching for Labelled GraphsMassimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen. [doi]
- Parameterized Algorithms for String Matching to DAGs: Funnels and BeyondManuel Cáceres. [doi]
- Linear-Time Computation of Cyclic Roots and Cyclic Covers of a StringCostas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
- String Factorization via Prefix Free FamiliesMatan Kraus, Moshe Lewenstein, Alexandru Popa 0001, Ely Porat, Yonathan Sadia. [doi]
- Approximation Algorithms for the Longest Run Subsequence ProblemYuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka. [doi]
- Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and ApplicationsEstéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba. [doi]
- On Distances Between Words with ParametersPierre Bourhis, Aaron Boussidan, Philippe Gambette. [doi]
- Trie-Compressed Adaptive Set IntersectionDiego Arroyuelo, Juan Pablo Castillo. [doi]
- Optimal LZ-End Parsing Is HardHideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno. [doi]
- Suffix-Prefix Queries on a DictionaryGrigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba. [doi]
- Optimal Near-Linear Space Heaviest Induced AncestorsPanagiotis Charalampopoulos, Bartlomiej Dudek 0001, Pawel Gawrychowski, Karol Pokorski. [doi]
- Merging Sorted Lists of Similar StringsGene Myers. [doi]
- Encoding Hard String Problems with Answer Set ProgrammingDominik Köppl. [doi]
- L-Systems for Measuring RepetitivenessGonzalo Navarro, Cristian Urbina. [doi]
- On the Complexity of Parameterized Local Search for the Maximum Parsimony ProblemChristian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag. [doi]
- On the Impact of Morphisms on BWT-RunsGabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina. [doi]
- Improving the Sensitivity of MinHash Through Hash-Value AnalysisGregory Kucherov, Steven Skiena. [doi]
- Sliding Window String Indexing in StreamsPhilip Bille, Johannes Fischer 0001, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen. [doi]
- Order-Preserving Squares in StringsPawel Gawrychowski, Samah Ghazawi, Gad M. Landau. [doi]
- MONI Can Find k-MEMsIgor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Faster Algorithms for Computing the Hairpin Completion Distance and Minimum AncestorItai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa 0001. [doi]
- Faster Prefix-Sorting Algorithms for Deterministic Finite AutomataSung-Hwan Kim, Francisco Olivares, Nicola Prezza. [doi]
- Compressed Indexing for Consecutive OccurrencesPawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner. [doi]
- MUL-Tree Pruning for Consistency and CompatibilityChristopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson 0001, Zara Lim, Wing-Kin Sung. [doi]
- Computing MEMs on Repetitive Text CollectionsGonzalo Navarro. [doi]