PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction
暂无分享,去创建一个
John M. Mellor-Crummey | Luay Nakhleh | Cristian Coarfa | Usman Roshan | Yuri Dotsenko | J. Mellor-Crummey | C. Coarfa | Usman Roshan | L. Nakhleh | Yuri Dotsenko
[1] W. Fitch. Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .
[2] Bernard M. E. Moret,et al. Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees , 2004, Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference, 2004. CSB 2004..
[3] Bernard M. E. Moret,et al. Performance of Supertree Methods on Various Data Set Decompositions , 2004 .
[4] Katherine Yelick,et al. Introduction to UPC and Language Specification , 2000 .
[5] Daniel H. Huson,et al. Solving Large Scale Phylogenetic Problems using DCM2 , 1999, ISMB.
[6] K. Nixon,et al. The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis , 1999, Cladistics : the international journal of the Willi Hennig Society.
[7] Tandy J. Warnow,et al. Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees , 2004, IEEE Computer Society Computational Systems Bioinformatics Conference.
[8] Tandy J. Warnow,et al. Designing fast converging phylogenetic methods , 2001, ISMB.
[9] D. Robinson,et al. Comparison of phylogenetic trees , 1981 .
[10] James R. Cole,et al. The RDP (Ribosomal Database Project) continues , 2000, Nucleic Acids Res..
[11] R. Sokal,et al. A QUANTITATIVE APPROACH TO A PROBLEM IN CLASSIFICATION† , 1957, Evolution; International Journal of Organic Evolution.
[12] John M. Mellor-Crummey,et al. PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction , 2005, ICPADS.
[13] Michael J. Sanderson,et al. The Growth of Phylogenetic Information and the Need for a Phylogenetic Data Base , 1993 .
[14] Yves Van de Peer,et al. The European database on small subunit ribosomal RNA , 2002, Nucleic Acids Res..
[15] Daniel H. Huson,et al. Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction , 1999, J. Comput. Biol..
[16] D. Maddison. The discovery and importance of multiple islands of most , 1991 .
[17] D. Ord,et al. PAUP:Phylogenetic analysis using parsi-mony , 1993 .
[18] Michael P. Cummings,et al. PAUP* [Phylogenetic Analysis Using Parsimony (and Other Methods)] , 2004 .
[19] Robert W. Numrich,et al. Co-array Fortran for parallel programming , 1998, FORF.
[20] Ken Kennedy,et al. Optimizing Compilers for Modern Architectures: A Dependence-based Approach , 2001 .
[21] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .
[22] P. Goloboff. Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima , 1999, Cladistics : the international journal of the Willi Hennig Society.
[23] D. Swofford. PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10 , 2002 .
[24] Tandy J. Warnow,et al. Absolute convergence: true trees from short sequences , 2001, SODA '01.
[25] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.