Skip to content

Combinatorial Pattern Matching

CPM

B

CORE rank

CORE rank (raw)

B

Fields of research

Computer Vision and Multimedia Computation

Papers indexed

1,016

1992–2026

Papers per year

199239 peak2026

CPM papers

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

YearTitleAuthors
2015On the Readability of Overlap Digraphs.Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova
2015Fast String Dictionary Lookup with One Error.Timothy M. Chan, Moshe Lewenstein
2015On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem.Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria
2015Parameterized Complexity of Superstring Problems.Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015Ranked Document Retrieval with Forbidden Pattern.Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
2015Longest Common Extensions in Sublinear Space.Philip Bille, Inge Li Grtz, Mathias Bk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhj
2015Longest Common Extensions in Trees.Philip Bille, Pawel Gawrychowski, Inge Li Grtz, Gad M. Landau, Oren Weimann
2015Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis.Timo Beller, Enno Ohlebusch
2015Composite Repetition-Aware Data Structures.Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2015A Framework for Space-Efficient String Kernels.Djamal Belazzougui, Fabio Cunial
2015On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling.Amihood Amir, Benny Porat
2015Lempel Ziv Computation in Small Space (LZ-CISS).Johannes Fischer, Tomohiro I, Dominik Kppl
2015Alphabet-Dependent String Searching with Wexponential Search Trees.Johannes Fischer, Pawel Gawrychowski
2014On the DCJ Median Problem.Mingfu Shao, Bernard M. E. Moret
2014Encodings for Range Majority Queries.Gonzalo Navarro, Sharma V. Thankachan
2014Most Recent Match Queries in On-Line Suffix Trees.N. Jesper Larsson
2014On Hardness of Several String Indexing Problems.Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2014Approximate String Matching Using a Bidirectional Index.Gregory Kucherov, Kamil Salikhov, Dekel Tsur
2014Searching of Gapped Repeats and Subrepetitions in a Word.Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
2014Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence.Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2014Efficient Algorithms for Shortest Partial Seeds in Words.Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014String Range Matching.Juha Krkkinen, Dominik Kempa, Simon J. Puglisi
2014A really Simple Approximation of Smallest Grammar.Artur Jez
2014Computing Palindromic Factorizations and Palindromic Covers On-line.Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014Shortest Unique Substring Query Revisited.Atalay Mert Ileri, M. Oguzhan Klekci, Bojian Xu
351375 of 1,016← PreviousNext →

Comparable venues

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