Richard M. Karp
Raymond E. Miller
ABSTRACT
In this paper we look at a number of matching problems and devise general techniques for attacking such problems. In particular, we describe a strategy for constructing efficient algorithms for solving two types of matching problems. We use this strategy to develop explicit algorithms for these two problems applied to strings (where the patterns are substrings) and arrays (where the patterns are subarrays or blocks). We also develop algorithms for these and related problems for trees, where the patterns are subtrees. Certain special cases of these algorithms are also discussed.
Although we do not claim that these algorithms are optimal, we analyze each algorithm to estimate its computational cost. This provides some basis for choosing which algorithm is most desirable in any given situation.
- 1.Morris, James H. and Vaughan Pratt, ";A Linear Pattern Matching Algorithm"; Report #40, Computing Center, University of California at Berkeley, 1970.Google Scholar
Index Terms
- Rapid identification of repeated patterns in strings, trees and arrays
Recommendations
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
We extend earlier works on the relation of prefix arrays of indeterminate strings to undirected graphs and border arrays. If integer array y is the prefix array for indeterminate string w, then we say w satisfies y. We use a graph theoretic approach to ...
Indeterminate strings, prefix arrays & undirected graphs
An integer array y = y 1 . . n is said to be feasible if and only if y 1 = n and, for every i 2 . . n , i i + y i n + 1 . A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a ...
Counting suffix arrays and strings
SPIRE'05: Proceedings of the 12th international conference on String Processing and Information RetrievalSuffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix arrays and their enumeration. For fixed alphabet size and ...
Comments