Reconstructing reticulate evolution in species: theory and practice
暂无分享,去创建一个
Tandy J. Warnow | Luay Nakhleh | C. Randal Linder | T. Warnow | C. R. Linder | L. Nakhleh | Katherine St. John | C. Linder | Luay K. Nakhleh
[1] M. P. Cummings,et al. PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .
[2] Derrick J. Zwickl,et al. Increased taxon sampling greatly reduces phylogenetic error. , 2002, Systematic biology.
[3] Dan Gusfield,et al. Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination , 2004, J. Bioinform. Comput. Biol..
[4] W. Maddison. Gene Trees in Species Trees , 1997 .
[5] TarjanRobert Endre,et al. Fast algorithms for finding nearest common ancestors , 1984 .
[6] Dan Gusfield,et al. Efficient algorithms for inferring evolutionary trees , 1991, Networks.
[7] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[8] Vineet Bafna,et al. The number of recombination events in a sample history: conflict graph and lower bounds , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[9] D. Ord,et al. PAUP:Phylogenetic analysis using parsi-mony , 1993 .
[10] R. Page,et al. Trees within trees: phylogeny and historical associations. , 1998, Trends in ecology & evolution.
[11] S. Gabriel,et al. The Structure of Haplotype Blocks in the Human Genome , 2002, Science.
[12] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.
[13] Hidetoshi Shimodaira,et al. Multiple Comparisons of Log-Likelihoods with Applications to Phylogenetic Inference , 1999, Molecular Biology and Evolution.
[14] Tandy J. Warnow,et al. Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods , 2002, Pacific Symposium on Biocomputing.
[15] Michael P. Cummings,et al. PAUP* [Phylogenetic Analysis Using Parsimony (and Other Methods)] , 2004 .
[16] Kun Zhang,et al. HaploBlockFinder: Haplotype Block Analyses , 2003, Bioinform..
[17] Carsten Wiuf,et al. Simulating haplotype blocks in the human genome , 2003, Bioinform..
[18] W. H. Day. Optimal algorithms for comparing trees with labeled leaves , 1985 .
[19] M. Nei,et al. The neighbor-joining method , 1987 .
[20] Dan Gusfield,et al. Efficient reconstruction of phylogenetic networks with constrained recombination , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.
[21] Howard Ochman,et al. Reconciling the many faces of lateral gene transfer. , 2002, Trends in microbiology.
[22] Vincent Moulton,et al. NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks , 2002, WABI.
[23] A. Dress,et al. Split decomposition: a new and useful approach to phylogenetic analysis of distance data. , 1992, Molecular phylogenetics and evolution.
[24] M. Steel,et al. Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .
[25] Tandy J. Warnow,et al. Phylogenetic networks: modeling, reconstructibility, and accuracy , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[26] Tandy J. Warnow,et al. Tree compatibility and inferring evolutionary history , 1994, SODA '93.
[27] Kaizhong Zhang,et al. Perfect Phylogenetic Networks with Recombination , 2001, J. Comput. Biol..