A theory of parameterized pattern matching: Algorithms and applications (Extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 71-80

  Baker, Brenda S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTATION THEORY; DATA STRUCTURES; FORESTRY; PARAMETERIZATION; PATTERN MATCHING; TREES (MATHEMATICS); ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; PARAMETER ESTIMATION; PATTERN RECOGNITION; PROGRAM DEBUGGING;

APPLICATION PROBLEMS; C CODES; EXTENDED ABSTRACTS; LARGE SOFTWARE SYSTEMS; PARAMETERIZED; PARAMETERIZED SUFFIX TREE; TWO SECTION;

PARAMETER ESTIMATION; AUTOMATA THEORY;

DUPLICATION; PARAMETERIZED PATTERN MATCHING; PARAMETERIZED STRINGS; PARAMETERIZED SUFFIX TREE; SOFTWARE MAINTENANCE;

EID: 0027227137     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167115     Document Type: Conference Paper

References (31)

1. [Aho] A.V. Aho, Algorithms for finding patterns in strings, Handbook of Theoretical Computer Science (1990), ed. Van Leeuwen, Elsevier Science Publishers B.V., Amsterdam, pp. 255-300.
2. [AHU] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, Massachusetts.
3. [AP] A. Apostolico and F. Preparata, Optimal off-line detection of repetitions in a string, Theoretical Corn- put. Sci. 22 (83), pp. 297-315.
4. [Bakl] Brenda S. Baker, A program for identifying duplicated code, Computing Science and Statistics: Proceedings of the 24th Symposium on the Interface (March, 1992).
5. [Bak2] Brenda S. Baker, On finding duplication in strings and software, submitted for publication.
6. [Bak3] Brenda S. Baker, Parameterized duplication in strings: Algorithms and an application to software maintenance, submitted for publication.
7. [CL] W. I. Chang and E. L. Lawler, Approximate string matching in sublinear expected time, Proc. of 31st Symposium on Foundations of Computer Science (1990), 116-124.
8. [CH] Kenneth W. Church and Jonathan I. Helfman, Dotplot: A program for exploring self-similarity in millions of lines of text and code, Computing Science and Statistics: Proceedings of the 24th Symposium on the Interface (March, 1992).
9. [Cr87] Maxime Crochemore, The Longest Common factor of two words, Proc. of International Joint Conference on Theory and Practice of Software Development (TAP- SOFT), Vol. I, Lecture Notes in Computer Science 249 (1987), ed. G. Goos and J. Hartmanis, Springer- Verlag, Berlin, pp. 26-36.
10. [Cr86] Maxime Crochemore, Transducers and Repetitions, Theoretical Computer Science 45 (1986), pp. 63-86.
11. [GG] Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity 4 (1988), pp. 33-72.
12. [GeN] Michael R. Genesereth and Nils J. Nilsson, Logical Foundations of Artificial Intelligence (1987), Morgan Kaufman Publishers, Los Altos, California.
13. [Gi] R. Giancarlo, The suffix tree of a square matrix, with applications, Proc. of 4th Annual ACM-SIAM Conference on Discrete Algorithms (SODA) (Jan. 1993), pp. 402-411.
14. [Ho] Susan Horwitz, Identifying the semaetntic and textual differences bween two versions of a program, Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1990), pp. 234-245.
15. [HT] D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. on Computing 13 (1984), pp. 338-355.
16. [Hu92] Andrew G. Hume, personal communication (November 1992).
17. [HS] J.W. Hunt and T.G. Szymanski, A fast algorithm for computing longest common subsequences, Comm. ACM 20 5 (1977), pp. 350-353.
18. [Ja] H.T. Jankowitz, Detecting plagiarism in student PAS CAL programs, Computer Journal 31, 1 (1988), pp. 18.
19. [Jo] Ralph Johnson, personal communication (October, 1991).
20. [Ker] Brian W. Kernighan, personal communication (August, 1991).
21. [KP] Brian W. Kernighan and Rob Pike, The UNIX Programming Environment (1984), Prentice-Hall, Engle- wood Cliffs, New Jersey.
22. [McC] E.M. McCreight, A space-economical suffix-Tree construction algorithm, J. ACM 23, 2 (1976), pp. 262-272.
23. [ML] M.G. Main, and R.J. Lorentz, An O(nlogn) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984), 422-432.
24. [MM] Eugene W. Myers and Webb Miller, Approximate matching of regular expressions, Bulletin of Mathematical Biology 51 (1989), pp. 5-37.
25. [Ra] M.O. Rabin, Discovering repetitions in strings, Combinatorial Algorithms on Words (1984), ed. A. Apostolico and Z. Galil, Springer-Verlag, Berlin, pp. 257270.
26. [RPE] M. Rodeh, V. R. Pratt, and S. Even, Linear algorithms for data compression via string matching, J. ACM 28, 1 (1981), pp. 16-24.
27. [SchG] R.W. Scheifler and J. Gettys, The X window system, ACM Transactions on Graphics 5, 2 (1986), pp. 79109.
28. [SV] Baruch Schieber and Uzi Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. on Computing 17 (1988), pp. 1253-1262.
29. [ST] Daniel D. Sleator and Robert E. Tarjan, A data structure for dynamic trees J. Comput. Sys. Sci. 26 (1983), pp. 362-391.
30. [WM] Sun Wu and Udi Manber, Fast text searching allowing errors, Comm. ACM 35, 10 (Oct 1992), pp. 83-91.
31. [ZL] J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory IT-23 (1977), pp. 337-343.