Toward new software for computational phylogenetics
暂无分享,去创建一个
[1] M. Csűrös. Fast recovery of evolutionary trees with thousands of nodes. , 2002, Journal of computational biology : a journal of computational molecular cell biology.
[2] Miklós Csőrős. Fast recovery of evolutionary trees with thousands of nodes , 2001, RECOMB 2001.
[3] Henry D. Shapiro,et al. Algorithms and Experiments: The New (and Old) Methodology , 2001, J. Univers. Comput. Sci..
[4] Daniel H. Huson,et al. Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction , 1999, J. Comput. Biol..
[5] Tandy J. Warnow,et al. The Accuracy of Fast Phylogenetic Methods for Large Datasets , 2001, Pacific Symposium on Biocomputing.
[6] David L. Swofford,et al. THE TOPOLOGY-DEPENDENT PERMUTATION TEST FOR MONOPHYLY DOES NOT TEST FOR MONOPHYLY , 1996 .
[7] P. Holland,et al. Rare genomic changes as a tool for phylogenetics. , 2000, Trends in ecology & evolution.
[8] Bernard M. E. Moret,et al. Absolute phylogeny: true trees from short sequences , 2001, ACM-SIAM Symposium on Discrete Algorithms.
[9] Tandy J. Warnow,et al. Designing fast converging phylogenetic methods , 2001, ISMB.
[10] Tandy J. Warnow,et al. Steps toward accurate reconstructions of phylogenies from gene-order data , 2002, J. Comput. Syst. Sci..
[11] David Sankoff,et al. Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..
[12] Tandy J. Warnow,et al. Absolute convergence: true trees from short sequences , 2001, SODA '01.