Parameterized pattern matching: Algorithms and applications

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 28-42

  Baker, Brenda S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATION THEORY; COMPUTER SIMULATION; MATHEMATICAL TRANSFORMATIONS; SOFTWARE ENGINEERING;

PARAMETERIZED PATTERN MATCHING; PARAMETERIZED STRINGS; PARAMETERIZED SUFFIX TREES; WORST CASE BOUND;

DATA STRUCTURES;

EID: 0030084599     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0003     Document Type: Article

References (19)

1. A. V. Aho, Algorithms for finding patterns in strings, in "Handbook of Theoretical Computer Science" (Van Leeuwen, Ed.), pp. 255-300, Elsevier, Amsterdam, 1990.
2. A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Comm. ACM 18 (1975), 333-340.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, 1974.
4. A. Amir, M. Farach, and S. Muthukrishnan, Alphabet dependence in parameterized matching, Info. Proc. Letters 49 (1994), 111-115.
5. B. S. Baker, A program for identifying duplicated code, in "Computing Science and Statistics," Vol. 24, pp. 49-57, Interface Foundation of North America, 1992.
6. B. S. Baker, Parameterized duplication in strings: Algorithms and an application to software maintenance, submitted.
7. B. S. Baker, A theory of parameterized pattern matching: Algorithms and applications (extended abstract), in "Proceedings 25th ACM Symposium on Theory of Computing, May 1993," pp. 71-80.
8. B. S. Baker, Parameterized pattern-matching using Boyer-Moore-type algorithms, in "Proceedings of Sixth Annual ACM-SIAM Sympos. on Discrete Algorithms, 1995," pp. 541-550.
9. W. I. Chang and E. L. Lawler, Approximate string matching in sublinear expected time, in "Proceedings 31st Symposium on Foundations of Computer Science, 1990," pp. 116-124.
10. M. Crochemore, The longest common factor of two words, in "Proceedings International Joint Conference on Theory and Practice of Software Development (TAP-SOFT), Vol. I" (G. Goos and J. Hartmanis, Eds.), pp. 26-36, Lecture Notes in Computer Science, Vol. 249, Springer-Verlag, Berlin, 1987.
11. R. Giancarlo, The suffix tree of a square matrix, with applications, in "Proceedings, Fourth Annual ACM-SIAM Symposium on Discrete Algoritms, 1993," pp. 402-411.
12. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, Siam J. Comput. 13 (1984), 338-355.
13. A. G. Hume, Personal communication, November 1992.
14. R. M. Idury and A. A. Schaffer, Dynamic dictionary matching with failure functions, in "Proceedings, Third Sympos. on Combinatorial Pattern Matching," Lecture Notes in Computer Science, Vol. 644, pp. 276-287, Springer-Verlag, New York/Berlin, 1992.
15. R. M. Idury and A. A. Schaffer, Multiple matching of parameterized patterns, in "Proceedings, Fourth Sympos. on Combinatorial Pattern Matching," Lecture Notes in Computer Science, Vol. 807, pp. 226-239, Springer-Verlag, New York/Berlin, 1994.
16. E. M. McCreight, A space-economial suffix-tree construction algorithm, J. Assoc. Comput. Mach. 32, No. 2 (1976), 262-272.
17. R. W. Scheifler and J. Gettys, The X window system, ACM Trans. Graphics 5, No. 2 (1986), 79-109.
18. B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplication and parallelization, SIAM J. Comput. 17 (1988), 1253-1262.
19. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26 (1983), 362-391.