메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 197-201

A fast program for maximum likelihood-based inference of large phylogenetic trees

Author keywords

Maximum Likelihood; Parallel Distributed Computing; Phylogenetic Inference

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; GENETIC ENGINEERING; MAXIMUM LIKELIHOOD ESTIMATION; PARALLEL PROCESSING SYSTEMS;

EID: 2442484847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.967940     Document Type: Conference Paper
Times cited : (11)

References (21)
  • 1
    • 0036790011 scopus 로고    scopus 로고
    • Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference
    • M.J. Brauer et al. Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. In Molecular Biology and Evolution 19:1717-1726, 2002.
    • (2002) Molecular Biology and Evolution , vol.19 , pp. 1717-1726
    • Brauer, M.J.1
  • 2
    • 0028963294 scopus 로고
    • The relationship between parsimony and maximum likelihood analyses: Tree scores and confidence estimates
    • R.W. DeBry, L. G. Abele. The relationship between parsimony and maximum likelihood analyses: tree scores and confidence estimates. In Mol. Biol. Evol. 12:291-297, 1995.
    • (1995) Mol. Biol. Evol. , vol.12 , pp. 291-297
    • DeBry, R.W.1    Abele, L.G.2
  • 3
    • 0019797407 scopus 로고
    • Evolutionary trees from DNA sequences: A maximum likelihood approach
    • J. Felsenstein. Evolutionary trees from DNA sequences: A maximum likelihood approach. In J. Mol Evol. 17:368-376, 1981.
    • (1981) J. Mol Evol. , vol.17 , pp. 368-376
    • Felsenstein, J.1
  • 4
    • 0033499153 scopus 로고    scopus 로고
    • Analyzing large data sets in reasonable times: Solutions for composite optima
    • P.A. Goloboff. Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima. In Cladistics 15:415-428, 1999.
    • (1999) Cladistics , vol.15 , pp. 415-428
    • Goloboff, P.A.1
  • 6
    • 0034849408 scopus 로고    scopus 로고
    • MRBAYES: Bayesian inference of phylogenetic trees
    • J.P. Huelsenbeck, F. Ronquist. MRBAYES: Bayesian inference of phylogenetic trees. In Bioinformatics 17(8):754-5, 2001.
    • (2001) Bioinformatics , vol.17 , Issue.8 , pp. 754-755
    • Huelsenbeck, J.P.1    Ronquist, F.2
  • 7
    • 0030732143 scopus 로고    scopus 로고
    • Majority-rule consensus of phylogenetic trees obtained by maximum-likelihood analysis
    • L.S. Jermiin et al. Majority-rule consensus of phylogenetic trees obtained by maximum-likelihood analysis. Mol. Biol. Evol. 14:1297-1302, 1997.
    • (1997) Mol. Biol. Evol. , vol.14 , pp. 1297-1302
    • Jermiin, L.S.1
  • 8
    • 0037791845 scopus 로고    scopus 로고
    • ARE: A software environment for sequence data
    • in press
    • W. Ludwig et al. ARE: a software environment for sequence data. In Nucl. Acids Res., in press, 2003.
    • (2003) Nucl. Acids Res.
    • Ludwig, W.1
  • 9
    • 0027957393 scopus 로고
    • fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood
    • G.J. Olsen et al. fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. In Comput. Appl. Biosci. 10:41-48, 1994.
    • (1994) Comput. Appl. Biosci. , vol.10 , pp. 41-48
    • Olsen, G.J.1
  • 10
    • 2442443740 scopus 로고    scopus 로고
    • Download site including additional information results and test data
    • parallel fastDNAml www.indiana.edu/~rac/hpc/fastDNAml. Download site including additional information results and test data.
    • Parallel FastDNAml
  • 15
    • 84991725584 scopus 로고    scopus 로고
    • Accelerating parallel maximum likelihood-based phylogenetic tree computations using subtree equality vectors
    • Baltimore, Maryland, November
    • A.P.Stamatakis et al. Accelerating Parallel Maximum Likelihood-based Phylogenetic Tree Computations using Subtree Equality Vectors. In Proceedings of Supercomputing Conference (SC2002), Baltimore, Maryland, November 2002.
    • (2002) Proceedings of Supercomputing Conference (SC2002)
    • Stamatakis, A.P.1
  • 17
    • 2442574511 scopus 로고    scopus 로고
    • Parallel implementation and performance of fastDNAml - A program for maximum likelihood phylogenetic inference
    • Denver, Colorado, November
    • C. A. Stewart et al. Parallel implementation and performance of fastDNAml - a program for maximum likelihood phylogenetic inference. In proceedings of SC2001, Denver, Colorado, November 2001.
    • (2001) Proceedings of SC2001
    • Stewart, C.A.1
  • 18
    • 0029836454 scopus 로고    scopus 로고
    • Quartet puzzling: A maximum-likelihood method for reconstructing tree topologies
    • K. Strimmer, A.v. Haeseler, Quartet Puzzling: A Maximum-Likelihood Method for Reconstructing Tree Topologies. In Mol. Biol. Evol 13:964-969, 1996.
    • (1996) Mol. Biol. Evol , vol.13 , pp. 964-969
    • Strimmer, K.1    Haeseler, A.V.2
  • 19
    • 0031149251 scopus 로고    scopus 로고
    • Links between maximum likelihood and maximum parsimony under a simple model of site substitution
    • C. Tuffley, M. Steel. Links between maximum likelihood and maximum parsimony under a simple model of site substitution. In Bull Math Biol 59(3):581-607, 1997.
    • (1997) Bull Math Biol , vol.59 , Issue.3 , pp. 581-607
    • Tuffley, C.1    Steel, M.2
  • 21
    • 0034123820 scopus 로고    scopus 로고
    • TrExML: A maximum likelihood program for extensive tree-space exploration
    • M.J. Wolf et al. TrExML: A maximum likelihood program for extensive tree-space exploration. In Bioinformatics 16:383-394, 2000.
    • (2000) Bioinformatics , vol.16 , pp. 383-394
    • Wolf, M.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.