5 search results - page 1 / 1 » Inferring a Level-1 Phylogenetic Network from a Dense Set of... |
COCOON
2004
Springer
13 years 11 months ago
2004
Springer
CPM
2009
Springer
14 years 6 days ago
2009
Springer
ISAAC
2009
Springer
14 years 5 days 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 5 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...
WABI
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...