Abstract
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.
The research of this author was supported by NSF grants NSF-CCR-8615337 and NSF-DCR-8413359, ONR grant N00014-85-K-0046, by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under contract number DE-AC02-76ER03077 and by the Foundation for Research in Electronics, Computers and Communication, Administered by the Israeli Academy of Sciences and Humanities. Present address: The University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, MD 20742, USA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.S. Boyer and J.S. Moore,“A fast string searching algorithm”, Comm. ACM 20 (1977) 762–772.
J.W. Cooley and J.W. Tukey,“An algorithm for the machine calculations of complex Fourier series”, Math. Comput. 19 (1965) 297–301.
A. Fridman, Advanced Calculus ( Holt, Rinehart and Winston, 1971 ).
Z. Galil and J.I. Seiferas,“Time-space-optimal string matching”, J. Computer and System Sciences 26 (1983) 280–294.
D. Heller,“A survey of parallel algorithms in numerical Linear Algebra”, SI AM Review 20 (1978) 740–777.
D.E. Knuth, J.H. Morris and V.R. Pratt, “Fast pattern matching in strings”, SIAM J. Comp. 6 (1977) 323–350.
R.M. Karp, and M.O. Rabin,“Efficient randomized pattern-matching algorithms”, manuscript, 1980.
S. Lipschutz, Theory and Problems of Linear Algebra ( McGraw Hill, New York, 1968 ).
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].
G.M. Landau and U. Vishkin,“Efficient string matching with k mismatches”, Theoretical Computer Science 43 (1986) 239–249.
G.M. Landau and U. Vishkin,“Efficient string matching with k differences”, J. Computer and System Sciences, to appear.
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.
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 ).
J.T. Schwartz and M. Sharir,”Identification of partially obscured objects in two and three dimensions by matching of noisy ‘characteristic curves’ “, The International J. of Robotics Research 6 (summer 1987) 29–44.
U. Vishkin,“Optimal parallel pattern matching in strings”, Information and Control 67 (1985) 91–113.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
Eilam-Tzoreff, T., Vishkin, U. (1990). Matching Patterns in Strings Subject to Multi-Linear Transformations. In: Capocelli, R.M. (eds) Sequences. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3352-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3352-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7977-8
Online ISBN: 978-1-4612-3352-7
eBook Packages: Springer Book Archive