A polynomial time algorithm for the minimum quartet inconsistency problem with O (n) quartet errors

Information Processing Letters

Volumn 100, Issue 4, 2006, Pages 167-171

  Wu, Gang ^a   You, Jia Huai ^a   Lin, Guohui ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Algorithms; Phylogeny construction; Quartet

Indexed keywords

ERROR ANALYSIS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

MINIMUM QUARTET INCONSISTENCY (MQI); PHYLOGENY CONSTRUCTION; POLYNOMIAL TIME; QUARTET;

ALGORITHMS;

EID: 33747362016     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.05.013     Document Type: Article

References (23)

1. Bandelt H., and Dress A. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics 7 (1986) 309-343
2. A. Ben-Dor, B. Chor, D. Graur, R. Ophir, D. Pelleg, From four-taxon trees to phylogenies: the case of mammalian evolution, in: Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology (RECOMB), 1998, pp. 9-19
3. V. Berry, D. Bryant, T. Jiang, P. Kearney, M. Li, T. Wareham, H. Zhang, A practical algorithm for recovering the best supported edges of an evolutionary tree, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 287-296
4. V. Berry, O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, in: Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON), 1997, pp. 111-123
5. Berry V., and Gascuel O. Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science 240 (2000) 271-298
6. V. Berry, T. Jiang, P.E. Kearney, M. Li, H.T. Wareham, Quartet cleaning: Improved algorithms and simulations, in: Proceedings of the 7th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 1643, 1999, pp. 313-324
7. D. Bryant, M.A. Steel, Fast algorithms for constructing optimal trees from quartets, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 147-155
8. Bryant D., and Steel M.A. Constructing optimal trees from quartets. Journal of Algorithms 38 (2001) 237-259
9. Colonius H., and Schultze H.H. Tree structure for proximity data. British Journal of Mathematical and Statistical Psychology 34 (1981) 167-180
10. G. Della Vedova, T. Jiang, J. Li, J.J. Wen, Approximating minimum quartet inconsistency (abstract), in: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 894-895
11. Della Vedova G., and Wareham H.T. Optimal algorithms for local vertex quartet cleaning. Bioinformatics 18 (2002) 1297-1304
12. P.L. Erdös, K. Rice, M.A. Steel, L.A. Székely, T. Warnow, Constructing big trees from short sequences, in: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP), 1997, pp. 827-837
13. Erdös P.L., Steel M.A., Székely L.A., and Warnow T. A few logs suffice to build (almost) all trees (i). Random Structures and Algorithms 14 (1999) 153-184
14. Gramm J., and Niedermeier R. A fixed-parameter algorithm for minimum quartet inconsistency. Journal of Computer and System Sciences 67 (2003) 723-741
15. T. Jiang, P.E. Kearney, M. Li, Orchestrating quartets: approximation and data correction, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), 1998, pp. 416-425
16. Jiang T., Kearney P.E., and Li M. Some open problems in computational molecular biology. Journal of Algorithms 34 (2000) 194-201
17. Jiang T., Kearney P.E., and Li M. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM Journal on Computing 30 (2001) 1942-1961
18. J.C. Obenauer, J. Denson, P.K. Mehta, X. Su, S. Mukatira, D.B. Finkelstein, X. Xu, J. Wang, J. Ma, Y. Fan, K.M. Rakestraw, R.G. Webster, E. Hoffmann, S. Krauss, J. Zheng, Z. Zhang, C.W. Naeve, Large-scale sequence analysis of avian influenza isolates, in: Science Express, 26 January 2006, pp. 1-8
19. Steel M.A. The complexity of reconstructing trees from qualitative characters and subtrees. Journal on Classification 9 (1992) 91-116
20. Strimmer K., and von Haeseler A. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution 13 (1996) 964-969
21. G. Wu, G.-H. Lin, J.-H. You, Quartet based phylogeny reconstruction with answer set programming, in: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 2004, pp. 612-619
22. G. Wu, J.-H. You, G.-H. Lin, A lookahead branch-and-bound algorithm for the maximum quartet consistency problem, in: Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI), Lecture Notes in Computer Science/Lecture Notes in Bioinformatics, vol. 3692, 2005, pp. 65-76
23. Zhang H., and Gu X. Maximum likelihood for genome phylogeny on gene content. Statistical Applications in Genetics and Molecular Biology 3 1 (2004) Article 31