About: Hunt–Szymanski algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Hunt–Szymanski algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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 practice O(n log n) is rather expected.

Attributes	Values
rdfs:label	Hunt–Szymanski algorithm (en)
rdfs:comment	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 practice O(n log n) is rather expected. (en)
dbp:wikiPageUsesTemplate	dbt:Math dbt:Reflist
Subject	Algorithms on strings Combinatorics Dynamic programming
thumbnail	wiki-commons:Special:FilePath/Longest_Common_Subsequence_Recursion.png?width=300
foaf:depiction
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Hunt–Szymanski_algorithm?oldid=1065653592&ns=0
Wikipage page ID	22288560 (xsd:integer)
page length (characters) of wiki page	7635 (xsd:nonNegativeInteger)
Wikipage revision ID	1065653592 (xsd:integer)
Link from a Wikipage to another Wikipage	Version control Big O notation Wiki software Algorithms on strings Combinatorics Dynamic programming James W. Hunt Diff Douglas McIlroy Computer science Wagner–Fischer algorithm Molecular phylogenetics Longest common subsequence problem Levenshtein distance
has abstract	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 practice O(n log n) is rather expected. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Hunt–Szymanski_algorithm
is Wikipage redirect of	Hunt-McIlroy algorithm Hunt–McIlroy algorithm Hunt-Szymanski algorithm
is Link from a Wikipage to another Wikipage of	James W. Hunt Diff Deaths in March 2021 Hunt-McIlroy algorithm Hunt–McIlroy algorithm Longest common subsequence problem Levenshtein distance Hunt-Szymanski algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Hunt–Szymanski_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software