Reconstructing Phylogenies from Noisy Quartets
Author Information
Author(s): Wu Gang, Kao Ming-Yang, Lin Guohui, You Jia-Huai
Primary Institution: University of Alberta
Hypothesis
Can we reconstruct the 'true' phylogeny from quartet topologies with errors efficiently?
Conclusion
The proposed algorithms can reconstruct the 'true' phylogeny with high success probability, even in the presence of errors.
Supporting Evidence
- The first algorithm reconstructs phylogenies in O(n^2) time without errors.
- The second algorithm can handle errors with a high success probability.
- The third algorithm outperforms existing methods in speed and accuracy.
Takeaway
This study shows how to figure out the family tree of living things using small groups of four at a time, even when some of the information is wrong.
Methodology
The study presents three algorithms for reconstructing phylogenies based on quartet topologies, analyzing their performance under different error probabilities.
Limitations
The algorithms may not perform well if the quartet error probability is too high.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website