2 search results - page 1 / 1 » Computing a Smallest Multi-labeled Phylogenetic Tree from Ro... |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...