Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hunt–McIlroy_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Hunt–McIlroy_algorithm abstract "In computer science, the Hunt–McIlroy algorithm is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff. To this day, variations of this algorithm are found in incremental version control systems, wiki engines, and molecular phylogenetics research software.The research accompanying the final version of Unix diff, written by Douglas McIlroy, was published in the 1976 paper "An Algorithm for Differential File Comparison", co-written with James W. Hunt, who developed an initial prototype of diff.".
- Hunt–McIlroy_algorithm wikiPageID "22288560".
- Hunt–McIlroy_algorithm wikiPageRevisionID "594346051".
- Hunt–McIlroy_algorithm subject Category:Algorithms_on_strings.
- Hunt–McIlroy_algorithm subject Category:Combinatorics.
- Hunt–McIlroy_algorithm subject Category:Dynamic_programming.
- Hunt–McIlroy_algorithm comment "In computer science, the Hunt–McIlroy algorithm is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff.".
- Hunt–McIlroy_algorithm label "Hunt–McIlroy algorithm".
- Hunt–McIlroy_algorithm sameAs Hunt%E2%80%93McIlroy_algorithm.
- Hunt–McIlroy_algorithm sameAs Q17028025.
- Hunt–McIlroy_algorithm sameAs Q17028025.
- Hunt–McIlroy_algorithm wasDerivedFrom Hunt–McIlroy_algorithm?oldid=594346051.