10 search results - page 1 / 2 » Rooted Maximum Agreement Supertrees |
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
CPM
2007
Springer
13 years 11 months ago
2007
Springer
JDA
2007
13 years 5 months ago
2007
WEA
2010
Springer
14 years 7 days ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...