Please use this identifier to cite or link to this item:
|Title:||Inferring phylogenetic relationships avoiding forbidding rooted triplets|
Phylogenetic network construction
|Source:||He, Y.-J.,Huynh, T.N.D.,Jansson, J.,Sung, W.-K. (2006). Inferring phylogenetic relationships avoiding forbidding rooted triplets. Journal of Bioinformatics and Computational Biology 4 (1) : 59-74. ScholarBank@NUS Repository. https://doi.org/10.1142/S0219720006001709|
|Abstract:||To construct a phylogenetic tree or phylogenetic network for describing the evolutionary history of a set of species is a well-studied problem in computational biology. One previously proposed method to infer a phylogenetic tree/network for a large set of species is by merging a collection of known smaller phylogenetic trees on overlapping sets of species so that no (or as little as possible) branching information is lost. However, little work has been done so far on inferring a phylogenetic tree/network from a specified set of trees when in addition, certain evolutionary relationships among the species are known to be highly unlikely. In this paper, we consider the problem of constructing a phylogenetic tree/network which is consistent with all of the rooted triplets in a given set C and none of the rooted triplets in another given set F. Although NP-hard in the general case, we provide some efficient exact and approximation algorithms for a number of biologically meaningful variants of the problem. © Imperial College Press.|
|Source Title:||Journal of Bioinformatics and Computational Biology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 12, 2017
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.