FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2018
024619862018

Related topics

Related topics

9 relations
Computer scienceDiff utilityLevenshtein distanceLongest common subsequence problem
(More)

Broader (1)

Dynamic programming

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Hunt–McIlroy algorithm
Computer science
Dynamic programming
Unix
Diff utility
Molecular phylogenetics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Object Knowledge and the Emergence of Language1
Infants' spontaneous play with objects was examined for evidence of developments in object knowledge in relation to the emergence… (More)
  • figure 1
  • figure 2
  • figure 2
  • figure 3
  • figure 3
Is this relevant?
2011
2011
What does it take to resolve relationships and to identify species with molecular markers? An example from the epiphytic Rhipsalideae (Cactaceae).
UNLABELLED PREMISE OF THE STUDY The Cactaceae are a major New World plant family and popular in horticulture. Still, taxonomic… (More)
  • table 2
  • figure 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Situational and Transituational Determinants of Adolescent Self-Feelings
Employing a new self-report technique (paging devices), the self-feelings of 35 adolescents were assessed in various naturalistic… (More)
Is this relevant?
2008
2008
Adaptive memory: Is survival processing special?
Do the operating characteristics of memory continue to bear the imprints of ancestral selection pressures? Previous work in our… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2008
2008
Just Forget It - The Semantics and Enforcement of Information Erasure
There are many settings in which sensitive information is made available to a system or organisation for a specific purpose, on… (More)
Is this relevant?
2007
2007
Geometric Barycentres Of Invariant Measures For Circle Maps
For a continuous circle map T, deene the barycentre of any T-invariant probability measure to be b() = R S 1 z dd(z). The set of… (More)
Is this relevant?
2006
2006
Transition from Middle School to High School
  • 2006
Why Is It Important to Examine the Transition from Middle School to High School? The transition from middle school to high school… (More)
Is this relevant?
2002
2002
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Evolutionary importance of parental care performance, food resources, and direct and indirect genetic effects in a burying beetle
In many animal taxa, parental care is a critical environmental influence on offspring growth and development (Clutton-Brock, 1991… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
Generalization of adaptive neuro-fuzzy inference systems
The paper aims at several objectives. The adaptive network-based fuzzy inference systems (ANFIS) of Jang is extended to the… (More)
Is this relevant?