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
1996Computing Discoveries in Molecular Biology (Abstract).David J. Lipman
1996Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).William E. Hart, Sorin Istrail
1996Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
1996Constructing Computer Virus Phylogenies.Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1996Spliced Alignment: A New Approach to Gene Recognition.Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
1996Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
1996Approximate Pattern Matching in Directed Graphs.James Jianghai Fu
1996Original Synteny.Vincent Ferretti, Joseph H. Nadeau, David Sankoff
1996Perfect Hashing for Strings: Formalization and Algorithms.Martin Farach, S. Muthukrishnan
1996Boyer-Moore Strategy to Efficient Approximate String Matching.Nadia El-Mabrouk, Maxime Crochemore
1996Approximate Dictionary Queries.Gerth Stlting Brodal, Leszek Gasieniec
1996The suffix Tree of a Tree and Minimizing Sequential Transducers.Dany Breslauer
1996Finite-State Computability of Annotations of Strings and Trees.Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
1996Fast Sorting by Reversal.Piotr Berman, Sridhar Hannenhalli
1996A Faster Algorithm for Approximate String Matching.Ricardo A. Baeza-Yates, Gonzalo Navarro
1996Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization.Richard Arratia, Gesine Reinert
1996A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.Chris Armen, Clifford Stein
1996Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
1996Suffix Trees on Words.Arne Andersson, N. Jesper Larsson, Kurt Swanson
1996Alphabet Independent and Dictionary Scaled Matching.Amihood Amir, Gruia Calinescu
1995On the Editing Distance between Undirected Acyclic Graphs and Related Problems.Kaizhong Zhang, Jason Tsong-Li Wang, Dennis E. Shasha
1995Dictionary Loop-Up with Small Errors.Andrew Chi-Chih Yao, F. Frances Yao
1995On a Technique for Parsing a String (Abstract).Uzi Vishkin
1995Multiple Sequence Comparison: A Peptide Matching Approach.Marie-France Sagot, Alain Viari, Henry Soldano
1995Smaller Representations for Finite-State Transducers and Finite-State Automata.Emmanuel Roche
901925 of 1,016← PreviousNext →

Comparable venues

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