CPM 2023

34th Annual Symposium on Combinatorial Pattern Matching

Marne-la-Vallée, France, June 26–28, 2023

Accepted papers

These papers were accepted to CPM 2023 conference:

  • 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
  • Estéban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon Pissis, Jakub Radoszewski, Michelle Sweering and Wiktor Zuba: Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications
  • Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya and Teresa Anna Steiner: Compressed Indexing for Consecutive Occurrences
  • Gonzalo Navarro: Computing MEMs on Repetitive Text Collections
  • Dominik Köppl: Encoding Hard String Problems with Answer Set Programming
  • Itai Boneh, Dvir Fried, Adrian Miclăuș and Alexandru Popa: Faster algorithms for computing the hairpin completion distance and minimum ancestor
  • Sung-Hwan Kim, Francisco Olivares and Nicola Prezza: Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
  • Massimo Equi, Arianne Meijer van de Griend and Veli Mäkinen: From Bit-Parallelism to Quantum String Matching for Labelled Graphs
  • Gregory Kucherov and Steven Skiena: Improving the Sensitivity of MinHash Through Hash-Value Analysis
  • Gonzalo Navarro and Cristian Urbina: L-systems for measuring repetitiveness
  • Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń and Wiktor Zuba: Linear Time Computation of Cyclic Roots and Cyclic Covers of a String
  • Eugene Myers: Merging Sorted Lists of Similar Strings
  • Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli and Travis Gagie: MONI can find k-MEMs
  • Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim and Wing-Kin Sung: MUL-Tree Pruning for Consistency and Compatibility
  • Pierre Bourhis, Aaron Boussidan and Philippe Gambette: On Distances between Words with Parameters
  • Christian Komusiewicz, Simone Linz, Nils Morawietz and Jannik Schestag: On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
  • Gabriele Fici, Giuseppe Romana, Marinella Sciortino and Cristian Urbina: On the impact of morphisms on BWT-runs
  • Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski and Karol Pokorski: Optimal Heaviest Induced Ancestors
  • Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto and Takeaki Uno: Optimal LZ-End Parsing is Hard
  • Pawel Gawrychowski, Samah Ghazawi and Gad M. Landau: Order-Preserving Squares in Strings
  • Shinya Nagashita and Tomohiro I: PalFM-index: FM-index for Palindrome Pattern Matching
  • Manuel Cáceres: Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond (Best paper)
  • Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen and Tord Joakim Stordalen: Sliding Window String Indexing in Streams (Best student paper)
  • Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat and Yonathan Sadia: String Factorization via Prefix Free Families
  • Grigorios Loukides, Solon Pissis, Sharma V. Thankachan and Wiktor Zuba: Suffix-Prefix Queries on a Dictionary
  • Diego Arroyuelo and Juan Pablo Castillo: Trie-Compressed Adaptive Set Intersection