Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Parameterized Pattern Matching

  • Moshe  Lewenstein
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_282-2

Years and Authors of Summarized Work

1996; Baker1995; Kosaraju1994; Amir, Farach, Muthukrishnan

Problem Definition

Parameterized strings, or p-strings, are strings that contain both ordinary symbols from an alphabet \(\Sigma \)


Pattern Match Edit Distance Parameterized Text String Match Suffix Tree 
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.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Amir A, Aumann Y, Cole R, Lewenstein M, Porat E (2003) Function matching: algorithms, applications and a lower bound. In: Proceedings of the 30th international colloquium on automata, languages and programming (ICALP), Eindhoven, pp 929–942Google Scholar
  2. 2.
    Amir A, Farach M, Muthukrishnan S (1994) Alphabet dependence in parameterized matching. Inf Process Lett 49:111–115CrossRefzbMATHGoogle Scholar
  3. 3.
    Apostolico A, Erdös P, Lewenstein M (2007) Parameterized matching with mismatches. J Discret Algorithms 5(1):135–140CrossRefzbMATHGoogle Scholar
  4. 4.
    Baker BS (1993) A theory of parameterized pattern matching: algorithms and applications. In: Proceedings of the 25th annual ACM symposium on the theory of computation (STOC), San Diego, pp 71–80Google Scholar
  5. 5.
    Baker BS (1995) Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco, pp 541–550Google Scholar
  6. 6.
    Baker BS (1996) Parameterized pattern matching: algorithms and applications. J Comput Syst Sci 52(1):28–42CrossRefzbMATHGoogle Scholar
  7. 7.
    Baker BS (1997) Parameterized duplication in strings: algorithms and an application to software maintenance. SIAM J Comput 26(5):1343–1362CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Baker BS (1999) Parameterized diff. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms (SODA), Baltimore, pp 854–855Google Scholar
  9. 9.
    Cole R, Hariharan R (2000) Faster suffix tree construction with missing suffix links. In: Proceedings of the 32nd ACM symposium on theory of computing (STOC), Portland, pp 407–415Google Scholar
  10. 10.
    Fredriksson K, Mozgovoy M (2006) Efficient parameterized string matching. Inf Process Lett 100(3):91–96CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestor. J Comput Syst Sci 13:338–355zbMATHMathSciNetGoogle Scholar
  12. 12.
    Hazay C, Lewenstein M, Sokol D (2007) Approximate parameterized matching. ACM Trans Algorithms 3(3):29CrossRefMathSciNetGoogle Scholar
  13. 13.
    Hazay C, Lewenstein M, Tsur D (2005) Two dimensional parameterized matching. In: Proceedings of the 16th symposium on combinatorial pattern matching (CPM), Jeju Island, pp 266–279Google Scholar
  14. 14.
    Idury RM, Schäffer AA (1996) Multiple matching of parameterized patterns. Theor Comput Sci 154(2):203–224CrossRefzbMATHGoogle Scholar
  15. 15.
    Keller O, Kopelowitz T, Lewenstein M. Parameterized LCS and edit distance are NP-complete. ManuscriptGoogle Scholar
  16. 16.
    Kosaraju SR (1995) Faster algorithms for the construction of parameterized suffix trees. In: Proceedings of the 36th annual symposium on foundations of computer science (FOCS), Milwaukee, pp 631–637Google Scholar
  17. 17.
    Landau GM, Vishkin U (1988) Fast string matching with k differences. J Comput Syst Sci 37(1):63–78CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23:262–272CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceBar-Ilan UniversityRamat-GanIsrael