메뉴 건너뛰기




Volumn 18, Issue , 2004, Pages 3269-3274

Parallel implementation of maximum likelihood methods for phylogenetic analysis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOMEDICAL ENGINEERING; DATA REDUCTION; DNA SEQUENCES; GENETIC ENGINEERING; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING; SUPERCOMPUTERS;

EID: 12444317586     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (15)
  • 1
    • 12444306300 scopus 로고    scopus 로고
    • last accessed August 2003
    • Australian National Genomic Information Service, http://www.angis.org.au/ AboutANGIS/, last accessed August 2003.
  • 2
    • 0032099099 scopus 로고    scopus 로고
    • Parallel implementation of DNAml program on message-passing architectures
    • C. Ceron, J. Dopazo, E. L. Zapata, J. M. Carazo and O. Trelles, Parallel implementation of DNAml program on message-passing architectures, Parallel Computing, 24, 1998, pp.701-716.
    • (1998) Parallel Computing , vol.24 , pp. 701-716
    • Ceron, C.1    Dopazo, J.2    Zapata, E.L.3    Carazo, J.M.4    Trelles, O.5
  • 4
    • 0019797407 scopus 로고
    • Evolutionary trees from DNA sequences: A maximum likelihood approach
    • J. Felsenstein, Evolutionary trees from DNA sequences: A maximum likelihood approach, j. Mol. Evol., 17, 1981, pp. 368-376.
    • (1981) J. Mol. Evol. , vol.17 , pp. 368-376
    • Felsenstein, J.1
  • 8
    • 0027957393 scopus 로고
    • FastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood
    • G. J. Olsen, H. Matsuda, R. Hagstrom and R. Overbeek, fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood, Comput. Appl. Biosci., 10, 1994, pp. 41-48.
    • (1994) Comput. Appl. Biosci. , vol.10 , pp. 41-48
    • Olsen, G.J.1    Matsuda, H.2    Hagstrom, R.3    Overbeek, R.4
  • 9
    • 0026495826 scopus 로고    scopus 로고
    • Progress with methods for construction evolutionary trees
    • D. Penny, M. D. Hendy and M. A. Steel, Progress with methods for construction evolutionary trees, Trends Ecol. Evol., 7, pp. 73-79.
    • Trends Ecol. Evol. , vol.7 , pp. 73-79
    • Penny, D.1    Hendy, M.D.2    Steel, M.A.3
  • 10
    • 0020668888 scopus 로고
    • Numbering binary trees with labelled terminal vertices
    • F. J. Rohlf, Numbering binary trees with labelled terminal vertices, Bul. Math. Biol., 45(10), 1983, pp. 33-40.
    • (1983) Bul. Math. Biol. , vol.45 , Issue.10 , pp. 33-40
    • Rohlf, F.J.1
  • 12
    • 84991725584 scopus 로고    scopus 로고
    • Accelerating parallel maximum likelihood-based phylogenetic tree computations using subtree equality vectors
    • November
    • A. P. Stamatakis, T. Ludwig, H. Meier and M. J. Wolf, Accelerating parallel maximum likelihood-based phylogenetic tree computations using subtree equality vectors, Proceedings of SC2002, November 2002.
    • (2002) Proceedings of SC2002
    • Stamatakis, A.P.1    Ludwig, T.2    Meier, H.3    Wolf, M.J.4
  • 14
    • 12444273593 scopus 로고    scopus 로고
    • last accessed August 2003
    • Tree-PUZZLE home page, http://www.tree-puzzle.de/, last accessed August 2003.
    • Tree-PUZZLE Home Page
  • 15
    • 0034123820 scopus 로고    scopus 로고
    • TrExML: A maximum-likelihood approach for extensive tree-space exploration
    • J. M. J. Wolf, S. Easteal, M. Kahn, B. D. McKay and L. S. Jermiin, TrExML: a maximum-likelihood approach for extensive tree-space exploration, Bioinformatics, 16(4), 2000, pp. 383-394.
    • (2000) Bioinformatics , vol.16 , Issue.4 , pp. 383-394
    • Wolf, J.M.J.1    Easteal, S.2    Kahn, M.3    McKay, B.D.4    Jermiin, L.S.5


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