Algorithms for Molecular Biology
|
Viewing options:Associated material:Related literature:- Articles citing this article
- Other articles by authors
- Related articles/pages
Tools:Post to:
|
ResearchReconstructing phylogenies from noisy quartets in polynomial time with a high success probabilityGang Wu1 , Ming-Yang Kao2 , Guohui Lin1 and Jia-Huai You1  1
Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada 2
Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, USA author email corresponding author email
Algorithms for Molecular Biology 2008,
3:1doi:10.1186/1748-7188-3-1
|
| Published: |
24 January 2008 |
Abstract
Background
In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accuracy of a phylogeny reconstruction method is measured by simulations on synthetic datasets with known "true" phylogenies, while little theoretical analysis has been done. In this paper, we present a new model-based approach to measuring the accuracy of a quartet-based phylogeny reconstruction method. Under this model, we propose three efficient algorithms to reconstruct the "true" phylogeny with a high success probability.
Results
The first algorithm can reconstruct the "true" phylogeny from the input quartet topology set without quartet errors in O(n2) time by querying at most (n - 4) log(n - 1) quartet topologies, where n is the number of the taxa. When the input quartet topology set contains errors, the second algorithm can reconstruct the "true" phylogeny with a probability approximately 1 - p in O(n4 log n) time, where p is the probability for a quartet topology being an error. This probability is improved by the third algorithm to approximately , where , with running time of O(n5), which is at least 0.984 when p < 0.05.
Conclusion
The three proposed algorithms are mathematically guaranteed to reconstruct the "true" phylogeny with a high success probability. The experimental results showed that the third algorithm produced phylogenies with a higher probability than its aforementioned theoretical lower bound and outperformed some existing phylogeny reconstruction methods in both speed and accuracy. |