Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hunt–McIlroy_algorithm> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples 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 wikiPageLength "4560".
- Hunt–McIlroy_algorithm wikiPageOutDegree "19".
- Hunt–McIlroy_algorithm wikiPageRevisionID "622930643".
- Hunt–McIlroy_algorithm wikiPageWikiLink Big_O_notation.
- Hunt–McIlroy_algorithm wikiPageWikiLink Category:Algorithms_on_strings.
- Hunt–McIlroy_algorithm wikiPageWikiLink Category:Combinatorics.
- Hunt–McIlroy_algorithm wikiPageWikiLink Category:Dynamic_programming.
- Hunt–McIlroy_algorithm wikiPageWikiLink Computer_science.
- Hunt–McIlroy_algorithm wikiPageWikiLink Diff.
- Hunt–McIlroy_algorithm wikiPageWikiLink Diff_utility.
- Hunt–McIlroy_algorithm wikiPageWikiLink Douglas_McIlroy.
- Hunt–McIlroy_algorithm wikiPageWikiLink James_W._Hunt.
- Hunt–McIlroy_algorithm wikiPageWikiLink Levenshtein_distance.
- Hunt–McIlroy_algorithm wikiPageWikiLink Longest_common_subsequence_problem.
- Hunt–McIlroy_algorithm wikiPageWikiLink Molecular_phylogenetics.
- Hunt–McIlroy_algorithm wikiPageWikiLink Unix.
- Hunt–McIlroy_algorithm wikiPageWikiLink Version_control.
- Hunt–McIlroy_algorithm wikiPageWikiLink Version_control_system.
- Hunt–McIlroy_algorithm wikiPageWikiLink Wagner–Fischer_algorithm.
- Hunt–McIlroy_algorithm wikiPageWikiLink Wiki_software.
- Hunt–McIlroy_algorithm wikiPageWikiLink File:K_Candidate_Diagram.png.
- Hunt–McIlroy_algorithm wikiPageWikiLink File:Longest_Common_Subsequence_Recursion.png.
- Hunt–McIlroy_algorithm wikiPageWikiLinkText "Hunt–McIlroy algorithm".
- Hunt–McIlroy_algorithm hasPhotoCollection Hunt–McIlroy_algorithm.
- Hunt–McIlroy_algorithm wikiPageUsesTemplate Template:Reflist.
- 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 m.05s_b5x.
- Hunt–McIlroy_algorithm sameAs Q17028025.
- Hunt–McIlroy_algorithm sameAs Q17028025.
- Hunt–McIlroy_algorithm wasDerivedFrom Hunt–McIlroy_algorithm?oldid=622930643.
- Hunt–McIlroy_algorithm isPrimaryTopicOf Hunt–McIlroy_algorithm.
