Absolute convergence: true trees from short sequences
暂无分享,去创建一个
[1] Tandy J. Warnow,et al. A few logs suffice to build (almost) all trees (I) , 1999, Random Struct. Algorithms.
[2] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[3] Daniel H. Huson,et al. Hybrid tree reconstruction methods , 1999, JEAL.
[4] João Meidanis,et al. Introduction to computational molecular biology , 1997 .
[5] Ming-Yang Kao,et al. Recovering evolutionary trees through harmonic greedy triplets , 1999, SODA '99.
[6] P. Erdös,et al. Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule , 1996, Comput. Artif. Intell..
[7] Daniel H. Huson,et al. Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction , 1999, J. Comput. Biol..
[8] P. Erdös,et al. A few logs suffice to build (almost) all trees (l): part I , 1997 .
[9] H. Munro,et al. Mammalian protein metabolism , 1964 .
[10] Tandy J. Warnow,et al. A Few Logs Suffice to Build (almost) All Trees: Part II , 1999, Theor. Comput. Sci..
[11] Tao Jiang,et al. A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) , 2000, SODA '00.
[12] M. Steel. Recovering a tree from the leaf colourations it generates under a Markov model , 1994 .
[13] D. Labie,et al. Molecular Evolution , 1991, Nature.
[14] Kevin Atteson,et al. The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction , 1999, Algorithmica.
[15] K. Strimmer,et al. Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .
[16] M. Steel,et al. Distributions of Tree Comparison Metrics—Some New Results , 1993 .
[17] Paul W. Goldberg,et al. Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model , 2001, SIAM J. Comput..
[18] Tandy J. Warnow,et al. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining , 2001, SODA '01.