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
2019	A New Class of Searchable and Provably Highly Compressible String Transformations.	Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Marinella Sciortino
2019	Streaming Dictionary Matching with Mismatches.	Pawel Gawrychowski, Tatiana Starikovskaya
2019	Quasi-Periodicity in Streams.	Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya
2019	How to Exploit Periodicity (Invited Talk).	Pawel Gawrychowski
2019	Entropy Lower Bounds for Dictionary Compression.	Michal Ganczorz
2019	Faster Queries for Longest Substring Palindrome After Block Edit.	Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019	Some Variations on Lyndon Words (Invited Talk).	Francesco Dolce, Antonio Restivo, Christophe Reutenauer
2019	Simulating the DNA Overlap Graph in Succinct Space.	Diego Daz-Domnguez, Travis Gagie, Gonzalo Navarro
2019	Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding.	Bastien Cazaux, Eric Rivals
2019	Finding a Small Number of Colourful Components.	Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Danil Paulusma, Stphane Vialette
2019	Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs.	Djamal Belazzougui, Fabio Cunial
2019	Indexing the Bijective BWT.	Hideo Bannai, Juha Krkkinen, Dominik Kppl, Marcin Piatkowski
2019	Sufficient Conditions for Efficient Indexing Under Different Matchings.	Amihood Amir, Eitan Kondratovsky
2019	Quasi-Linear-Time Algorithm for Longest Common Circular Factor.	Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2019	Computing the Antiperiod(s) of a String.	Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi
2019	Dichotomic Selection on Words: A Probabilistic Analysis.	Ali Akhavi, Julien Clment, Dimitri Darthenay, Lock Lhote, Brigitte Valle
2019	A Rearrangement Distance for Fully-Labelled Trees.	Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson
2018	Can a permutation be sorted by best short swaps?.	Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng
2018	Front Matter, Table of Contents, Preface, Conference Organization.
2018	Longest Lyndon Substring After Edit.	Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018	Linear-time algorithms for the subpath kernel.	Kilho Shin, Taichi Ishikawa
2018	Maximal Common Subsequence Algorithms.	Yoshifumi Sakai
2018	Computing longest common square subsequences.	Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyr, Hideo Bannai, Masayuki Takeda
2018	Non-Overlapping Indexing - Cache Obliviously.	Sahar Hooshmand, Paniz Abedin, M. Oguzhan Klekci, Sharma V. Thankachan
2018	Order-Preserving Pattern Matching Indeterminate Strings.	Rui Henriques, Alexandre P. Francisco, Lus M. S. Russo, Hideo Bannai

226–250 of 1,016← Previous Next →

Comparable venues

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