Jump to content

Hunt–Szymanski algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Digwuren (talk | contribs) at 13:04, 5 April 2009 (Created page with '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 versi…'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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