Sciweavers

Share
DAM
2010

New results on optimizing rooted triplets consistency

9 years 5 months ago
New results on optimizing rooted triplets consistency
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 approximability of two related optimization problems called the maximum rooted triplets consistency problem (MaxRTC) and the minimum rooted triplets inconsistency problem (MinRTI) in which the input is a set R of rooted triplets, and where the objectives are to find a largest cardinality subset of R which is consistent and a smallest cardinality subset of R whose removal from R results in a consistent set, respectively. We first show that a simple modification to Wu's Best-Pair-Merge-First heuristic [25] results in a bottom-up-based 3-approximation for MaxRTC. We then demonstrate how any approximation algorithm for MinRTI could be used to approximate MaxRTC, and thus obtain the first polynomial-time approximation algorithm for MaxRTC with approximation ratio smaller than 3. Next, we prove that for a set o...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DAM
Authors Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
Comments (0)
books