Matching Patterns in Strings Subject to Multi-Linear Transformations
Suppose we are given two strings of real numbers. The longer string is called text and the other is called pattern. We consider problems within the following framework. Suppose each symbol of the pattern was modified by any transformation which is a member in some family of transformations. Find all occurrences of the pattern in the text where the pattern may appear subject to any one of these transformations. Problems are introduced and efficient algorithms are given.
KeywordsMacromolecule Convolution Prefix
Unable to display preview. Download preview PDF.
- [F-71]A. Fridman, Advanced Calculus ( Holt, Rinehart and Winston, 1971 ).Google Scholar
- [KR-80]R.M. Karp, and M.O. Rabin,“Efficient randomized pattern-matching algorithms”, manuscript, 1980.Google Scholar
- [L-68]S. Lipschutz, Theory and Problems of Linear Algebra ( McGraw Hill, New York, 1968 ).Google Scholar
- LV-85] G.M. Landau and U. Vishkin,“Efficient string matching in the presence of errors”, Proc. 26th IEEE FOCS (1985) 126–136; this is a preliminary version of [LV-85b] and [LV-85c].Google Scholar
- [LV-85c]G.M. Landau and U. Vishkin,“Efficient string matching with k differences”, J. Computer and System Sciences, to appear.Google Scholar
- [LV-86]G.M. Landau and U. Vishkin,“Introducing efficient parallelism into approximate string matching”, Proc. 18th ACM Symposium on Theory of Computing (1986) 220–230; also: J. Algorithms, to appear.Google Scholar
- [SK-83]D. Sankoff and J.B. Kruskal (editors), Time Warps, String Edits, and Macromolecvles: the Theory and Practice of Sequence Comparison ( Addison-Wesley, Reading, MA, 1983 ).Google Scholar
- [VY]U. Vishkin and M. Yedidia, in preparation; also: M.Yedidia,“On transformed pattern matching problems”, M.Sc. thesis, Department of Computer Science Tel Aviv University, August 1988.Google Scholar