Skip to search formSkip to main contentSkip to account menu

Hunt–McIlroy algorithm

Known as: Hunt-McIlroy algorithm 
In computer science, the Hunt–McIlroy algorithm is a solution to the longest common subsequence problem. It was one of the first non-heuristic… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Computer scienceDiff utilityLevenshtein distanceLongest common subsequence problem

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2008
Review
2008
The Internet: Social and demographic impacts in Aotearoa New Zealand
The World Internet Project focuses on the social impact of the Internet. This paper presents a summary of findings of the first… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)