Parameterized duplication in strings: Algorithms and an application to software maintenance

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1343-1362

  Baker, Brenda S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Duplication; Pattern matching; String matching

Indexed keywords

EID: 0013238532     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793246707     Document Type: Article

References (21)

1. A. V. AHO, Algorithms for finding patterns in strings, Handbook of Theoretical Computer Science, J. Van Leeuwen, ed., Elsevier Science Publishers, Amsterdam, 1990, pp. 255-300.
2. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. B. S. BAKER, A program for identifying duplicated code, Comput. Sci. Stat., 24 (1992), pp. 49-57.
4. B. S. BAKER, On finding duplication in strings and software, Algorithmica, to appear.
5. B. S. BAKER, Parameterized pattern matching: Algorithms and applications, in Proc. of 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 71-80.
6. W. I. CHANG AND E. L. LAWLER, Sublinear approximate string matching and biological applications, Algorithmica, 12 (1995), pp. 327-344.
7. K. W. CHURCH AND J. I. HELFMAN, Dotplot: A program for exploring self-similarity in millions of lines of text and code, J. Comput. Graph. Statist., 2 (1993), pp. 153-174.
8. Z. GALIL AND R. GIANCARLO, Data structures and algorithms for approximate string matching, J. Complexity, 4 (1988), pp. 33-72.
9. M. R. GENESERETH AND N. J. NILSSON, Logical Foundations of Artificial Intelligence, Morgan Kaufman, Los Altos, CA, 1987.
10. R. GIANCARLO, The suffix tree of a square matrix, with applications, in Proc. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, SIAM, Philadelphia, pp. 402-411.
11. S. HORWITZ, Identifying the semantic and textual differences between two versions of a program, Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1990, ACM, New York, pp. 234-245.
12. A. G. HUME, personal communication, November 1992.
13. H. T. JANKOWITZ, Detecting plagiarism in student PASCAL programs, Comput. J., 31 (1988), pp. 1-8.
14. R. JOHNSON, personal communication, October, 1991.
15. B. W. KERNIGAN AND R. PIKE, The UNIX Programming Environment, Prentice-Hall, Englewood Cliffs, NJ, 1984.
16. E. M. MCCREIGHT, A space-economical suffix-tree construction algorithm, J. ACM, 23 (1976), pp. 262-272.
17. E. W. MYERS AND W. MILLER, Approximate matching of regular expressions, Bull. Math. Biol., 51 (1989), pp. 5-37.
18. E. R. TUFTE, The Visual Display of Quantitative Information, Graphics Press, Cheshire, CT, 1983.
19. E. UKKONEN, On-line construction of suffix trees, Algorithmica, 14 (1995), pp. 249-260.
20. P. WEINER, Linear pattern matching algorithms, in Proc. 14th Annual IEEE Symp. on Switching and Automata Theory, 1973, IEEE, Piscataway, NJ, pp. 1-11.
21. W. WU AND U. MAMBER, Fast text searching allowing errors, Comm. ACM, 35 (1992), pp. 83-91.