title: Do triplets have enough information to construct the multi-labeled phylogenetic tree?
abstract: The evolutionary history of certain species such as polyploids are modeled by a generalization of phylogenetic trees called multi-labeled phylogenetic trees, or MUL trees for short. One problem that relates to inferring a MUL tree is how to construct the smallest possible MUL tree that is consistent with a given set of rooted triplets, or SMRT problem for short. This problem is NP-hard. There is one algorithm for the SMRT problem which is exact and runs in O(7n) time, where n is the number of taxa. In this paper, we show that the SMRT does not seem to be an appropriate solution from the biological point of view. Indeed, we present a heuristic algorithm named MTRT for this problem and execute it on some real and simulated datasets. The results of MTRT show that triplets alone cannot provide enough information to infer the true MUL tree. So, it is inappropriate to infer a MUL tree using triplet information alone and considering the minimum number of duplications. Finally, we introduce some new problems which are more suitable from the biological point of view.
authors: Department of Mathematics, Shahid Beheshti University, G.C., Tehran, Iran.
authors: Reza
authors: R
authors: Hassanzadeh
authors: Department of Computer Science, Shahid Beheshti University, G.C., Tehran, Iran.
authors: Changiz
authors: C
authors: Eslahchi
authors: School of Computing, National University of Singapore, Singapore, Singapore; Genome Institute of Singapore, Singapore, Singapore.
authors: Wing-Kin
authors: WK
authors: Sung
mesh_terms: D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D017343:Genes, Plant; D016013:Likelihood Functions; D008957:Models, Genetic; D010802:Phylogeny; D032413:Viola / Q000145:classification / Q000235:genetics