LIPIcs, Volume 259, CPM 2023

• Laurent Bulteau and Zsuzsanna Lipták LIPIcs, Volume 259, CPM 2023, Complete Volume 10.4230/LIPIcs.CPM.2023
• Laurent Bulteau and Zsuzsanna Lipták Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CPM.2023.0
• Diego Arroyuelo and Juan Pablo Castillo Trie-Compressed Adaptive Set Intersection 10.4230/LIPIcs.CPM.2023.1
• Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, and Shunichi Tanaka Approximation Algorithms for the Longest Run Subsequence Problem 10.4230/LIPIcs.CPM.2023.2
• Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, and Takeaki Uno Optimal LZ-End Parsing Is Hard 10.4230/LIPIcs.CPM.2023.3
• Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, and Tord Joakim Stordalen Sliding Window String Indexing in Streams 10.4230/LIPIcs.CPM.2023.4
• Itai Boneh, Dvir Fried, Adrian Miclăuş, and Alexandru Popa Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor 10.4230/LIPIcs.CPM.2023.5
• Pierre Bourhis, Aaron Boussidan, and Philippe Gambette On Distances Between Words with Parameters 10.4230/LIPIcs.CPM.2023.6
• Manuel Cáceres Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond 10.4230/LIPIcs.CPM.2023.7
• Panagiotis Charalampopoulos, Bartłomiej Dudek, Paweł Gawrychowski, and Karol Pokorski Optimal Near-Linear Space Heaviest Induced Ancestors 10.4230/LIPIcs.CPM.2023.8
• Massimo Equi, Arianne Meijer-van de Griend, and Veli Mäkinen From Bit-Parallelism to Quantum String Matching for Labelled Graphs 10.4230/LIPIcs.CPM.2023.9
• Gabriele Fici, Giuseppe Romana, Marinella Sciortino, and Cristian Urbina On the Impact of Morphisms on BWT-Runs 10.4230/LIPIcs.CPM.2023.10
• Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, and Wiktor Zuba Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications 10.4230/LIPIcs.CPM.2023.11
• Paweł Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, and Teresa Anna Steiner Compressed Indexing for Consecutive Occurrences 10.4230/LIPIcs.CPM.2023.12
• Paweł Gawrychowski, Samah Ghazawi, and Gad M. Landau Order-Preserving Squares in Strings 10.4230/LIPIcs.CPM.2023.13
• Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, and Wing-Kin Sung MUL-Tree Pruning for Consistency and Compatibility 10.4230/LIPIcs.CPM.2023.14
• Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String 10.4230/LIPIcs.CPM.2023.15
• Sung-Hwan Kim, Francisco Olivares, and Nicola Prezza Faster Prefix-Sorting Algorithms for Deterministic Finite Automata 10.4230/LIPIcs.CPM.2023.16
• Dominik Köppl Encoding Hard String Problems with Answer Set Programming 10.4230/LIPIcs.CPM.2023.17
• Christian Komusiewicz, Simone Linz, Nils Morawietz, and Jannik Schestag On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem 10.4230/LIPIcs.CPM.2023.18
• Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, and Yonathan Sadia String Factorization via Prefix Free Families 10.4230/LIPIcs.CPM.2023.19
• Gregory Kucherov and Steven Skiena Improving the Sensitivity of MinHash Through Hash-Value Analysis 10.4230/LIPIcs.CPM.2023.20
• Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, and Wiktor Zuba Suffix-Prefix Queries on a Dictionary 10.4230/LIPIcs.CPM.2023.21
• Gene Myers Merging Sorted Lists of Similar Strings 10.4230/LIPIcs.CPM.2023.22
• Shinya Nagashita and Tomohiro I PalFM-Index: FM-Index for Palindrome Pattern Matching 10.4230/LIPIcs.CPM.2023.23
• Gonzalo Navarro Computing MEMs on Repetitive Text Collections 10.4230/LIPIcs.CPM.2023.24
• Gonzalo Navarro and Cristian Urbina L-Systems for Measuring Repetitiveness 10.4230/LIPIcs.CPM.2023.25
• Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, and Travis Gagie MONI Can Find k-MEMs 10.4230/LIPIcs.CPM.2023.26