Amihood Amir, Martin Farach, S. Muthukrishnan  Home/Search
Context Related
| rutgers.edu/~farac...trizedMatching.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~farach/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set #. A recently introduced model is that of parameterized pattern matching; the main motivation for this scheme lies in software maintenance where programs are considered "identical" even if variables names are di#erent. (Update)
Context of citations to this paper: More
...only noninjective naming functions. The injective case has been studied extensively in the context of parameterized string matching, see [1, 4 6]. a e c d a b a a d b d d a b a a c a c c b a a b b d b a c d b a . a . d . equal equal interpretation of the pattern xayzdyx...
...match. The di#erent applications define the matching relation. Examples are string matching with don t cares [12] parameterized matching [8, 4], less than matching [3] and swapped matching [21, 2, 9] Lower bound results on generalized matching can be found in [22] Even...
Cited by: More
Pattern and Approximate-Pattern Matching for Program Compaction - Johnson, Mycroft (Correct)
Separable Attributes: a Technique for Solving the Sub.. - Amir, Church, Dar (Correct)
Overlap Matching - Amir, Cole, Hariharan, Lewenstein.. (2001) (Correct)
Similar documents (at the sentence level):
54.0%: Alphabet Dependence in Parameterized Matching - Amihood Amir Martin (1994) (Correct)
Active bibliography (related documents): More All
0.3: Time-Space Tradeoffs in Algebraic Complexity - Aldaz, Matera, Montaña, .. (Correct)
0.3: Determinism versus Non-Determinism for Linear Time RAMs with.. - Ajtai (1998) (Correct)
0.2: Efficient 2-dimensional Approximate Matching of.. - Amir, Farach (1991) (Correct)
Similar documents based on text: More All
0.3: Two Dimensional Dictionary Matching - Amir, Farach (1992) (Correct)
0.3: Optimal Logarithmic Time Randomized Suffix Tree Construction - Farach, Muthukrishnan (1996) (Correct)
0.3: Optimal Parallel Dictionary Matching and Compression.. - Farach, Muthukrishnan (1995) (Correct)
Related documents from co-citation: More All
6: A theory of parameterized pattern matching: Algorithms and applications - Baker - 1993
5: Pattern matching with swaps - Amir, Aumann et al. - 1997
5: Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
BibTeX entry: (Update)
Amihood Amir, Martin Farach, and S. Muthukrishnan. Alphabet dependence in parameterized matching. Info. Proc. Letters, 49:111--115, 1994. http://citeseer.ist.psu.edu/amir93alphabet.html More
@article{ amir94alphabet,
author = "Amihood Amir and Martin Farach and S. Muthukrishnan",
title = "Alphabet Dependence in Parameterized Matching",
journal = "Information Processing Letters",
volume = "49",
number = "3",
pages = "111-115",
year = "1994",
url = "citeseer.ist.psu.edu/amir93alphabet.html" }
Citations (may not include all citations):347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
214 A fast string searching algorithm (context) - Boyer, Moore - 1977
40 Time-space-optimal string matching (context) - Galil, Seiferas - 1983
24 A theory of parameterized pattern matching: algorithms and a.. - Baker - 1993
6 multiple matching of parameterized patterns (context) - Idury, Scha - 1993
4 cient string matching (context) - Aho, Corasick - 1975
3 A time-space tradeo# for element distinctness (context) - Borodin, Fich et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rutgers.edu/~farach/papers.html): More
Two Dimensional Dictionary Matching - Amir, Farach (1992) (Correct)
Efficient Algorithms for Inverting Evolution - Farach, Kannan (1999) (Correct)
COFE: A Scalable Method for Feature Extraction from.. - Hristescu, Farach-Colton (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC