Advertisement

Sequences pp 45-58 | Cite as

Matching Patterns in Strings Subject to Multi-Linear Transformations

  • Tali Eilam-Tzoreff
  • Uzi Vishkin
Conference paper

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.

Keywords

Minimum Distance Pattern Match String Match Linear Time Algorithm Homogeneous Part 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BM-77]
    R.S. Boyer and J.S. Moore,“A fast string searching algorithm”, Comm. ACM 20 (1977) 762–772.CrossRefMATHGoogle Scholar
  2. [CT-65]
    J.W. Cooley and J.W. Tukey,“An algorithm for the machine calculations of complex Fourier series”, Math. Comput. 19 (1965) 297–301.CrossRefMATHGoogle Scholar
  3. [F-71]
    A. Fridman, Advanced Calculus ( Holt, Rinehart and Winston, 1971 ).Google Scholar
  4. [GS-83]
    Z. Galil and J.I. Seiferas,“Time-space-optimal string matching”, J. Computer and System Sciences 26 (1983) 280–294.MathSciNetCrossRefGoogle Scholar
  5. [H-78]
    D. Heller,“A survey of parallel algorithms in numerical Linear Algebra”, SI AM Review 20 (1978) 740–777.MathSciNetCrossRefMATHGoogle Scholar
  6. [KMP-77]
    D.E. Knuth, J.H. Morris and V.R. Pratt, “Fast pattern matching in strings”, SIAM J. Comp. 6 (1977) 323–350.MathSciNetCrossRefMATHGoogle Scholar
  7. [KR-80]
    R.M. Karp, and M.O. Rabin,“Efficient randomized pattern-matching algorithms”, manuscript, 1980.Google Scholar
  8. [L-68]
    S. Lipschutz, Theory and Problems of Linear Algebra ( McGraw Hill, New York, 1968 ).Google Scholar
  9. 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
  10. [LV-85b]
    G.M. Landau and U. Vishkin,“Efficient string matching with k mismatches”, Theoretical Computer Science 43 (1986) 239–249.MathSciNetCrossRefMATHGoogle Scholar
  11. [LV-85c]
    G.M. Landau and U. Vishkin,“Efficient string matching with k differences”, J. Computer and System Sciences, to appear.Google Scholar
  12. [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
  13. [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
  14. [SS-85]
    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.CrossRefGoogle Scholar
  15. [V-85]
    U. Vishkin,“Optimal parallel pattern matching in strings”, Information and Control 67 (1985) 91–113.MathSciNetCrossRefMATHGoogle Scholar
  16. [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

Copyright information

© Springer-Verlag New York Inc. 1990

Authors and Affiliations

  • Tali Eilam-Tzoreff
    • 1
  • Uzi Vishkin
    • 1
    • 2
  1. 1.Department of Computer Science School of Mathematical Sciences Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael
  2. 2.Department of Computer Science Courant Institute of Mathematical SciencesNew York UniversityUSA

Personalised recommendations