论文信息 - A file comparison program

A file comparison program

This paper presents a simple method for computing a shortest sequence of insertion and deletion commands that converts one given file to another. The method is particularly efficient when the difference between the two files is small compared to the files' lengths. In experiments performed on typical files, the program often ran four times faster than the UNIX diff command.

Eugene W. Myers | Webb Miller | E. Myers | W. Miller

[1] F TichyWalter. The string-to-string correction problem with block moves , 1984 .

[2] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.

[3] Patrick A. V. Hall,et al. Approximate String Matching , 1994, Encyclopedia of Algorithms.

[4] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[5] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[6] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[7] Walter F. Tichy,et al. The string-to-string correction problem with block moves , 1984, TOCS.

[8] James Gosling. A redisplay algorithm , 1981 .

[9] Alfred V. Aho,et al. Optimal Code Generation for Expression Trees , 1976, J. ACM.

[10] James Gosling. A redisplay algorithm , 1981 .

[11] Walter F. Tichy,et al. Rcs — a system for version control , 1985, Softw. Pract. Exp..

[12] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[13] Marc J. Rochkind,et al. The source code control system , 1975, IEEE Transactions on Software Engineering.