Skip to main content
SpringerLink
Log in

Parameterized Pattern Matching

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  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–942

    Google Scholar 

  2. Amir A, Farach M, Muthukrishnan S (1994) Alphabet dependence in parameterized matching. Inf Process Lett 49:111–115

    Article  MATH  Google Scholar 

  3. Apostolico A, Erdös P, Lewenstein M (2007) Parameterized matching with mismatches. J Discret Algorithms 5(1):135–140

    Article  MathSciNet  MATH  Google Scholar 

  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–80

    Google Scholar 

  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–550

    Google Scholar 

  6. Baker BS (1996) Parameterized pattern matching: algorithms and applications. J Comput Syst Sci 52(1):28–42

    Article  MathSciNet  MATH  Google Scholar 

  7. Baker BS (1997) Parameterized duplication in strings: algorithms and an application to software maintenance. SIAM J Comput 26(5):1343–1362

    Article  MathSciNet  MATH  Google Scholar 

  8. Baker BS (1999) Parameterized diff. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms (SODA), Baltimore, pp 854–855

    Google Scholar 

  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–415

    Google Scholar 

  10. Fredriksson K, Mozgovoy M (2006) Efficient parameterized string matching. Inf Process Lett 100(3):91–96

    Article  MathSciNet  MATH  Google Scholar 

  11. Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestor. J Comput Syst Sci 13:338–355

    MathSciNet  MATH  Google Scholar 

  12. Hazay C, Lewenstein M, Sokol D (2007) Approximate parameterized matching. ACM Trans Algorithms 3(3):29

    Article  MathSciNet  MATH  Google Scholar 

  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–279

    Google Scholar 

  14. Idury RM, Schäffer AA (1996) Multiple matching of parameterized patterns. Theor Comput Sci 154(2):203–224

    Article  MathSciNet  MATH  Google Scholar 

  15. Keller O, Kopelowitz T, Lewenstein M. Parameterized LCS and edit distance are NP-complete. Manuscript

    Google Scholar 

  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–637

    Google Scholar 

  17. Landau GM, Vishkin U (1988) Fast string matching with k differences. J Comput Syst Sci 37(1):63–78

    Article  MathSciNet  MATH  Google Scholar 

  18. McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23:262–272

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

    Moshe Lewenstein

Authors
  1. Moshe Lewenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moshe Lewenstein .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Lewenstein, M. (2016). Parameterized Pattern Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_282

Download citation

Publish with us

Policies and ethics

Search

Navigation