Hunt–Szymanski algorithm
id:
hunt-szymanski-algorithm-266-13367603
title:
Hunt–Szymanski algorithm
text:
In computer science, the Hunt–Szymanski algorithm, also known as Hunt–McIlroy algorithm, is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff which compares a pair of files each represented as a sequence of lines. To this day, variations of this algorithm are found in incremental version control systems, wiki engines, and molecular phylogenetics research software. The worst-case complexity for this algorithm is O(n2 log n), but in
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hunt%E2%80%93Szymanski_algorithm
date created:
date modified:
2024-01-04T18:05:17Z
main entity:
{"identifier":"Q17028025","url":"https://www.wikidata.org/entity/Q17028025"}
image:
fields total:
13
integrity:
13