An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
SIAM Journal on Computing
An algorithm for string matching with a sequence of don't cares
Information Processing Letters
Computer security basics
Efficient parallel algorithms to test square-freeness and factorize strings
Information Processing Letters
Optimal superprimitivity testing for strings
Information Processing Letters
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Theoretical Computer Science
An on-line string superprimitivity test
Information Processing Letters
Self-alignments in words and their applications
Journal of Algorithms
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Testing string superprimitivity in parallel
Information Processing Letters
Text algorithms
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The power of amnesia: learning probabilistic automata with variable memory length
Machine Learning - Special issue on COLT '94
Multiple sequence comparison—a peptide matching approach
Theoretical Computer Science
String editing and longest common subsequences
Handbook of formal languages, vol. 2
Pattern matching algorithms
Journal of Algorithms
A new and versatile method for association generation
Information Systems
Information Processing Letters
Modeling protein families using probabilistic suffix trees
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computing the covers of a string in linear time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Let sleeping files lie: pattern matching in Z-compressed files
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Knowledge Discovery in Databases
Knowledge Discovery in Databases
Pattern Discovery in Biosequences
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Data Mining for Regulatory Elements in Yeast Genome
Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
Minimal Forbidden Words and Factor Automata
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Sur les mots sans carré définis par un morphisme
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Fast and Practical Approximate String Matching
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
External Inverse Pattern Matching
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Data Compression Using Long Common Strings
DCC '99 Proceedings of the Conference on Data Compression
Almost Optimal Fully LZW-Compressed Pattern Matching
DCC '99 Proceedings of the Conference on Data Compression
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
A Mathematical Theory of Communication
A Mathematical Theory of Communication
DS '02 Proceedings of the 5th International Conference on Discovery Science
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
Advances in information retrieval: an introduction to the special issue
Information Systems
Segmental Pattern Discovery in Music
INFORMS Journal on Computing
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
| Hi-index | 0.00 |
String Pattern Matching concerns itself with algorithmic and combinatorial issues related to matching and searching on linearly arranged sequences of symbols, arguably the simplest possible discrete structures. As unprecedented volumes of sequence data are amassed, disseminated and shared at an increasing pace, effective access to, and manipulation of such data depend crucially on the efficiency with which strings are structured, compressed, transmitted, stored, searched and retrieved. This paper samples from this perspective, and with the authors' own bias, a rich arsenal of ideas and techniques developed in more than three decades of history.