Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17028025> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q17028025 subject Q7020692.
- Q17028025 subject Q7216313.
- Q17028025 subject Q8235223.
- Q17028025 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.".
- Q17028025 wikiPageWikiLink Q11368.
- Q17028025 wikiPageWikiLink Q141001.
- Q17028025 wikiPageWikiLink Q189439.
- Q17028025 wikiPageWikiLink Q2007033.
- Q17028025 wikiPageWikiLink Q21198.
- Q17028025 wikiPageWikiLink Q269878.
- Q17028025 wikiPageWikiLink Q2835818.
- Q17028025 wikiPageWikiLink Q300901.
- Q17028025 wikiPageWikiLink Q496939.
- Q17028025 wikiPageWikiLink Q6686945.
- Q17028025 wikiPageWikiLink Q7020692.
- Q17028025 wikiPageWikiLink Q7216313.
- Q17028025 wikiPageWikiLink Q8235223.
- Q17028025 wikiPageWikiLink Q92881.
- Q17028025 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.".
- Q17028025 label "Hunt–McIlroy algorithm".