Constructing the Maximum Consensus Tree from Rooted Triples
نویسنده
چکیده
We investigated the problem of constructing the maximum consensus tree from rooted triples. We showed the NP-hardness of the problem and developed exact and heuristic algorithms. The exact algorithm is based on the dynamic programming strategy and runs in O((m + n2)3n) time and O(2n) space. The heuristic algorithms run in polynomial time and their performances are tested and shown by comparing with the optimal solutions. In the tests, the worst and average relative error ratios are 1.200 and 1.072 respectively. We also implemented the two heuristic algorithms proposed by Gasieniec et al. The experimental result shows that our heuristic algorithm is better than theirs in most of the tests.
منابع مشابه
Constructing Evolutionary Trees from Rooted Triples
Bang Ye Wu Dept. of Computer Science and Information Engineering, Shu-Te University, YenChau, Kaohsiung, Taiwan 824, R.O.C. E-mail: [email protected] TEL: 07-6151000-4612 FAX: 07-6151000-4699 Abstract In this paper, we propose a new heuristic algorithm for the maximum consensus tree of rooted triples. By the experimental results, we show that the algorithm is better than the three previous...
متن کاملFast and consistent estimation of species trees using supermatrix rooted triples.
Concatenated sequence alignments are often used to infer species-level relationships. Previous studies have shown that analysis of concatenated data using maximum likelihood (ML) can produce misleading results when loci have differing gene tree topologies due to incomplete lineage sorting. Here, we develop a polynomial time method that utilizes the modified mincut supertree algorithm to constru...
متن کاملMinimal Phylogenetic Supertrees and Local Consensus Trees
The problem of constructing a minimally resolved phylogenetic supertree (i.e., having the smallest possible number of internal nodes) that contains all of the rooted triplets from a consistent set R is known to be NP-hard. In this paper, we prove that constructing a phylogenetic tree consistent with R that contains the minimum number of additional rooted triplets is also NP-hard, and develop ex...
متن کاملComputing Rooted and Unrooted Maximum Consistent Supertrees
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted binary trees on three leaves, or quartets, unrooted binary trees on four leaves. We give exact algorithms constructing rooted and unrooted maximum consistent supertrees in time O(2nm log m) for a set of m triplets (qua...
متن کاملFinding a largest subset of rooted triples identifying a tree is an NP - hard task Research
Supertree methods are used to build comprehensive phylogenies from source trees with overlapping sets of leaves. Ranwez et al. (2007) recently proposed a polynomial-time method outputting supertrees that verify attractive mathematical properties to obtain a consensual summary of a collection of source trees. The topological information of the source trees that is considered by the method is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 8 شماره
صفحات -
تاریخ انتشار 2004