The Hunt-McIlroy algorithm is one of the first non-heuristic algorithms of diff. To this day, variations of this algorithm are found in incremental version control systems, wiki engines, and molecular phylogenetics research software.
The research accompanying the final version of Unix diff, written by Douglas McIlroy, was published in the 1976 paper An "Algorithm for Differential File Comparison," co-written with James W. Hunt who developed an initial prototype of diff.[1]
See also
- Levenshtein distance
- Longest common subsequence problem
- Wagner-Fischer algorithm
References
- ^ James W. Hunt and M. Douglas McIlroy (June 1976). "An Algorithm for Differential File Comparison". Computing Science Technical Report, Bell Laboratories 41.
External links
- An OCR generated copy of "An Algorithm for Differential File Comparison" from Douglas McIlroy's home page.
 |
This computer programming-related article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
