The Short Quartet Method
暂无分享,去创建一个
László A. Székely | Péter L. Erdös | Mike Steel | Tandy Warnow | P. Erdös | M. Steel | T. Warnow | L. Székely | K. Rice | Kenneth L. Rice
[1] 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..
[2] T. Szaro,et al. Rate and mode differences between nuclear and mitochondrial small-subunit rRNA genes in mushrooms. , 1992, Molecular biology and evolution.
[3] Wen-Hsiung Li,et al. The molecular clock runs more slowly in man than in apes and monkeys , 1987, Nature.
[4] J. Huelsenbeck,et al. SUCCESS OF PHYLOGENETIC METHODS IN THE FOUR-TAXON CASE , 1993 .
[5] J. Carroll,et al. Spatial, non-spatial and hybrid models for scaling , 1976 .
[6] D. Aldous. PROBABILITY DISTRIBUTIONS ON CLADOGRAMS , 1996 .
[7] J H Gillespie,et al. The molecular clock may be an episodic clock. , 1984, Proceedings of the National Academy of Sciences of the United States of America.
[8] K. Strimmer,et al. Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies , 1996 .
[9] Olivier Gascuel,et al. Inferring evolutionary trees with strong combinatorial evidence , 2000, Theor. Comput. Sci..
[10] K. Strimmer,et al. Accuracy of neighbor joining for n-taxon trees , 1996 .
[11] J. A. Cavender. Taxonomy with confidence , 1978 .
[12] A. Wilson,et al. The recent African genesis of humans. , 1992, Scientific American.
[13] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .
[14] D. Hillis. Inferring complex phylogenies. , 1996, Nature.
[15] P. Forterre,et al. Universal tree of life , 1993, Nature.
[16] J. Huelsenbeck. Performance of Phylogenetic Methods in Simulation , 1995 .
[17] Tandy J. Warnow,et al. Parsimony is Hard to Beat , 1997, COCOON.
[18] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[19] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[20] M. Nei,et al. Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree. , 1988, Molecular biology and evolution.
[21] J. Hartigan. MINIMUM MUTATION FITS TO A GIVEN TREE , 1973 .
[22] J. Huelsenbeck,et al. Application and accuracy of molecular phylogenies. , 1994, Science.
[23] J. Felsenstein. Cases in which Parsimony or Compatibility Methods will be Positively Misleading , 1978 .
[24] J. Felsenstein. Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.
[25] T. Jukes. A Robust Model for Finding Optimal Evolutionary Trees , 1993 .
[26] A. Templeton. Human origins and analysis of mitochondrial DNA sequences. , 1992, Science.
[27] J. Huelsenbeck,et al. Hobgoblin of phylogenetics? , 1994, Nature.
[28] Junhyong Kim,et al. GENERAL INCONSISTENCY CONDITIONS FOR MAXIMUM PARSIMONY: EFFECTS OF BRANCH LENGTHS AND INCREASING NUMBERS OF TAXA , 1996 .
[29] A. Dress,et al. Reconstructing the shape of a tree from observed dissimilarity data , 1986 .
[30] W. Brown,et al. Nuclear and mitochondrial DNA comparisons reveal extreme rate variation in the molecular clock. , 1986, Science.
[31] Jaime Cohen,et al. Numerical taxonomy on data: experimental results , 1997, SODA '97.
[32] Mikkel Thorup,et al. On the approximability of numerical taxonomy (fitting distances by tree metrics) , 1996, SODA '96.
[33] W. A. Beyer,et al. Additive evolutionary trees. , 1977, Journal of theoretical biology.