A file comparison program
Webb Miller, Eugene Wimberly Myers · Software Practice and Experience · 1985
Abstract 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.
Cited by 186 works. doi:10.1002/spe.4380151102
Authors
References
- Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
- The String-to-String Correction Problem
- A linear space algorithm for computing maximal common subsequences
- The source code control system
- AnO(ND) difference algorithm and its variations
- A fast algorithm for computing longest common subsequences
- Rcs — a system for version control
- Approximate String Matching
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Optimal Code Generation for Expression Trees