Optimal evolutionary tree comparison by sparse dynamic programming (1994) [16 citations — 1 self]
Download:
|
|
by Martin Farach, Mikkel Thorup
Proc. of the 35th FOCS
ftp://ftp.cs.rutgers.edu/pub/farach/RMAST.ps.Z
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Farach94optimalevolutionary,author = {Martin Farach and Mikkel Thorup},
title = {Optimal evolutionary tree comparison by sparse dynamic programming},
booktitle = {Proc. of the 35th FOCS},
year = {1994},
pages = {770--779}
}
Years of Citing Articles
Abstract:
In computational biology one is often interested in finding the concensus between different evolutionary trees for the same set of species. A popular formalizations is the Maximum Agreement Subtree Problem (MAST) defined as follows: given a set A and two rooted trees T 0 and T 1 leaf-labeled by the elements of A, find a maximum cardinality subset B of A such that the restrictions of T 0 and T 1 to B are topologically isomorphic. Polynomial time solutions exist, but they rely on a dynamic program with 2(n 2
