This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8http://dbpedia.org/resource/File:
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
n11http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Hunt–McIlroy_algorithm
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
dbo:wikiPageRedirects
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Deaths_in_March_2021
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Levenshtein_distance
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:James_W._Hunt
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
dbp:notableWorks
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Hunt–Szymanski_algorithm
rdfs:label
Hunt–Szymanski algorithm
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.
foaf:depiction
n11:Longest_Common_Subsequence_Recursion.png n11:K_Candidate_Diagram.png
dcterms:subject
dbc:Combinatorics dbc:Dynamic_programming dbc:Algorithms_on_strings
dbo:wikiPageID
22288560
dbo:wikiPageRevisionID
1123540402
dbo:wikiPageWikiLink
dbr:Computer_science n8:Longest_Common_Subsequence_Recursion.png dbr:Big_O_notation dbr:James_W._Hunt dbc:Dynamic_programming dbr:Diff dbr:Wiki_software dbr:Levenshtein_distance dbc:Algorithms_on_strings dbr:Molecular_phylogenetics dbr:Douglas_McIlroy dbr:Wagner–Fischer_algorithm dbr:Longest_common_subsequence_problem dbr:Version_control_system n8:K_Candidate_Diagram.png dbc:Combinatorics
owl:sameAs
n7:fNE9 wikidata:Q17028025 dbpedia-sr:Hant-MekIlorijev_algoritam
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Math
dbo:thumbnail
n11:Longest_Common_Subsequence_Recursion.png?width=300
dbo: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.
prov:wasDerivedFrom
wikipedia-en:Hunt–Szymanski_algorithm?oldid=1123540402&ns=0
dbo:wikiPageLength
7644
foaf:isPrimaryTopicOf
wikipedia-en:Hunt–Szymanski_algorithm
Subject Item
dbr:Diff
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Longest_common_subsequence_problem
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Hunt-McIlroy_algorithm
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
dbo:wikiPageRedirects
dbr:Hunt–Szymanski_algorithm
Subject Item
dbr:Hunt-Szymanski_algorithm
dbo:wikiPageWikiLink
dbr:Hunt–Szymanski_algorithm
dbo:wikiPageRedirects
dbr:Hunt–Szymanski_algorithm
Subject Item
wikipedia-en:Hunt–Szymanski_algorithm
foaf:primaryTopic
dbr:Hunt–Szymanski_algorithm