Combinatorial Pattern Matching

CPM

CORE rank

CORE rank (raw)

Fields of research

Computer Vision and Multimedia Computation

Papers indexed

1,016

1992–2026

Best Computer Vision conferences

Papers per year

199239 peak2026

Most published authors

CPM papers

1,016 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2020	Unary Words Have the Smallest Levenshtein k-Neighbourhoods.	Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
2020	Dynamic String Alignment.	Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
2020	Counting Distinct Patterns in Internal Dictionary Matching.	Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	Efficient Tree-Structured Categorical Retrieval.	Djamal Belazzougui, Gregory Kucherov
2020	Double String Tandem Repeats.	Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
2020	Finding the Anticover of a String.	Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
2020	FM-Index Reveals the Reverse Suffix Array.	Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Klekci, Sharma V. Thankachan
2020	String Sanitization Under Edit Distance.	Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering
2020	On Two Measures of Distance Between Fully-Labelled Trees.	Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski
2019	Stringology Combats Microbiological Threats (Invited Talk).	Michal Ziv-Ukelson
2019	Front Matter, Table of Contents, Preface, Conference Organization.
2019	On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.	Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	Computing Runs on a Trie.	Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	Approximating Approximate Pattern Matching.	Jan Studen, Przemyslaw Uznanski
2019	Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform.	Nicola Prezza, Giovanna Rosone
2019	Optimal Rank and Select Queries on Dictionary-Compressed Text.	Nicola Prezza
2019	Cartesian Tree Matching and Indexing.	Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
2019	On Maximal Repeats in Compressed Strings.	Julian Pape-Lange
2019	Conversion from RLBWT to LZ77.	Takaaki Nishimoto, Yasuo Tabei
2019	Searching Long Repeats in Streams.	Oleg Merkurev, Arseny M. Shur
2019	Hamming Distance Completeness.	Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf
2019	Compressed Multiple Pattern Matching.	Dmitry Kosolobov, Nikita Sivukhin
2019	Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding.	Niko Kiirala, Leena Salmela, Alexandru I. Tomescu
2019	A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.	Haitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu
2019	Online Algorithms for Constructing Linear-Size Suffix Trie.	Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga

201–225 of 1,016← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.