Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability

Algorithms for Molecular Biology

Volumn 3, Issue 1, 2008, Pages

  Wu, Gang ^a   Kao, Ming Yang ^b   Lin, Guohui ^a   You, Jia Huai ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40649125833     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-3-1     Document Type: Article

References (23)

1. Csurös M Kao MY Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets SIAM Journal on Computing 2001, 31:306-322.
2. Saitou N Nei M The neighbor-joining method: A new method for reconstructing phylogenetic trees Molecular Biology and Evolution 1987, 4:406-425.
3. Moret BME Wang LS Warnow T Toward new software for computational phylogenetics IEEE Computer 2002, 35(7):55-64.
4. Pelleg D Algorithms for constructing phylogenies from quartets Master's thesis Israel Institute of Technology 1998.
5. Ben-Dor A Chor B Graur D Ophir R Pelleg D From four-taxon trees to phylogenies (preliminary report): The Case of Mammalian Evolution Proceedings of the 2nd Annual International Conference on Computational Molecular Biology 1998:9-19.
6. Fitch WM Margoliash E Construction of phylogenetic trees Science 1967, 155:279-284. 5334057
7. Kearney PE The ordinal quartet method Proceedings of the 2nd Annual International Conference on Computational Molecular Biology 1998:125-134.
8. Erdos PL Steel M Székély L Warnow T Constructing big trees from short sequences Lecture Notes in Computer Science 1256: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming New York, NY: Springer-Verlag Goos G, Hartmanis J, van Leeuwen J 1997:827-837.
9. Erdos PL Steel MA Székely LA Warnow T A few logs suffice to build (almost) all trees I Random Structures and Algorithms 1997, 14:153-184.
10. Strimmer K von Haeseler A Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies Molecular Biology and Evolution 1996, 13(7):964-969.
11. Davison AC Hinkley DV: Bootstrap Methods and Their Applications Cambridge, U.K.: Cambridge University Press 1997.
12. Swofford DL Olsen GJ Waddell PJ Hillis DM Phylogenetic Inference Molecular Systematics Sunderland, MA: Sinauer Associates Hillis DM, Moritz C, Mable BK 2 1996:407-514.
13. Jiang T Kearney P Li M Some open problems in computational molecular biology Journal of Algorithms 2000, 34:194-201.
14. Gramm J Niedermeier R A fixed-parameter algorithm for minimum quartet inconsistency Journal of Computer and System Sciences 2003, 67:723-741.
15. Wu G Lin G You J Quartet based phylogeny reconstruction with answer set programming Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence 2004:612-619.
16. Jiang T Kearney P Li M A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application SIAM Journal on Computing 2000, 30:1942-1961.
17. Vedova GD Jiang T Li J Wen J Approximating minimum quartet inconsistency (abstract) Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms 2002:894-895.
18. Berry V Bryant D Jiang T Kearney P Li M Wareham T Zhang H A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms 2000:287-296.
19. Jordan C Sur les assemblages de lignes Journal für die Reine und Angewandte Mathematik 1869, 70:185-190.
20. Kannan SK Lawler EL Warnow T Determining the evolutionary tree using experiments Journal of Algorithms 1996, 21:26-50
21. Kao MY Lingas A Östlin A Balanced randomized tree splitting with applications to evolutionary tree constructions Lecture Notes in Computer Science 1563: Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science New York, NY: Springer-Verlag Meinel C, Tison S 1999:184-196.
22. Brodal GS Fagerberg R Pedersen CNS Östlin A The complexity of constructing evolutionary trees using experiments Lecture Notes in Computer Science 2076: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming New York, NY: Springer-Verlag Orejas F, Spirakis PG, van Leeuwen J 2001:140-151.
23. Jukes TH Cantor CR Evolution of protein molecules Mammalian Protein Metabolism New York, NY: Academic Press Munro HN 1969:21-132.