5 search results - page 1 / 1 » The Complexity of Inferring a Minimally Resolved Phylogeneti... |
WABI
2010
Springer
13 years 2 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...
RECOMB
2011
Springer
12 years 7 months ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
RECOMB
2008
Springer
14 years 5 months ago
2008
Springer
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
ISAAC
2009
Springer
13 years 11 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...