CPM

Keyphrases

Publications

2023

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

volume 259, 2023

34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France CPM 259 (2023)

2022

volume 223, 2022

33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. CPM 223 (2022)