Jump to content

Hunt–Szymanski algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by The Anome (talk | contribs) at 09:58, 25 June 2009 (* Levenshtein distance). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

See also


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=298532196"