10 search results - page 1 / 2 » Rooted Maximum Agreement Supertrees |
92
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
106
Voted
CORR
2008
Springer
15 years 22 days 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 ...
68
Voted
CPM
2007
Springer
15 years 6 months ago
2007
Springer
JDA
2007
15 years 16 days ago
2007
126
Voted
WEA
2010
Springer
15 years 7 months 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...