Reconstructing approximate phylogenetic trees from quartet samples
暂无分享,去创建一个
[1] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[2] P. Erdös,et al. A few logs suffice to build (almost) all trees (l): part I , 1997 .
[3] M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .
[4] Tandy J. Warnow,et al. A few logs suffice to build (almost) all trees (I) , 1999, Random Struct. Algorithms.
[5] Elchanan Mossel,et al. Optimal phylogenetic reconstruction , 2005, STOC '06.
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] Tao Jiang,et al. A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application , 2000, SIAM J. Comput..
[8] Elchanan Mossel,et al. Maximal Accurate Forests from Distance Matrices , 2006, RECOMB.
[9] Satish Rao,et al. Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm , 2008, J. Comput. Biol..
[10] Satish Rao,et al. Using Max Cut to Enhance Rooted Trees Consistency , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Tao Jiang,et al. Orchestrating quartets: approximation and data correction , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[13] Tandy J. Warnow,et al. A Few Logs Suffice to Build (almost) All Trees: Part II , 1999, Theor. Comput. Sci..
[14] Sagi Snir,et al. Fast and reliable reconstruction of phylogenetic trees with very short edges , 2008, SODA '08.
[15] Tandy J. Warnow,et al. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining , 2001, SODA '01.