Name
Abstract | ||
|---|---|---|
Parameterized pattern matching is a string searching variant that was initially defined to detect duplicate code but later proved to support several other applications. In particular, two equal-length strings X andY are a parameterized-match if there exists a bijective function g for which every text symbol in X is equal to g(Y). Baker was the first researcher to have addressed this problem (Baker, 1993) and, since then, many others have followed her work. She did, indeed, open up a wide field of extensive research. Over the years, many variants and extensions that have been pursued include: parameterized matching under edit and Hamming distances, parameterized multi-pattern matching, two dimensional parameterized matching, structural matching, function matching, and the very recent developments in succinct and streaming models. This accelerated research could only be justified by the usefulness of its practical applications such as in software maintenance, image processing and bioinformatics to name some. Even though the problem was posed about 25 years ago, research on parameterized matching is still very active. Its extensive study over the years and its current relevance motivate us to review the most notorious contributions as road map for current and future research. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2018.07.017 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Parameterized matching,String matching,Software maintenance,Function matching | Hamming code,Discrete mathematics,Duplicate code,Parameterized complexity,Bijection,Existential quantification,Image processing,Theoretical computer science,Software maintenance,Pattern matching,Mathematics | Journal |
Volume | ISSN | Citations |
274 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 50 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Mendivelso | 1 | 13 | 2.81 |
| Sharma V. Thankachan | 2 | 289 | 41.02 |
| Yoan J. Pinzon | 3 | 158 | 16.81 |