Jump to content

Hunt–Szymanski algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 194.248.8.194 (talk) at 07:51, 31 October 2011 (Changed it to reference a PDF version of the original PS article.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Hunt–McIlroy algorithm is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in 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

References

  1. ^ James W. Hunt and M. Douglas McIlroy (1976). "An Algorithm for Differential File Comparison" (PDF). Computing Science Technical Report, Bell Laboratories. 41. {{cite journal}}: Unknown parameter |month= ignored (help)


Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hunt–Szymanski_algorithm&oldid=458261888"