메뉴 건너뛰기




Volumn 2002-November, Issue , 2002, Pages

Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DIGITAL ARITHMETIC; HEURISTIC METHODS; MAXIMUM LIKELIHOOD; OPTIMIZATION; PARALLEL PROGRAMMING; TREES (MATHEMATICS);

EID: 84991725584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2002.10016     Document Type: Conference Paper
Times cited : (16)

References (17)
  • 1
    • 0344412409 scopus 로고    scopus 로고
    • The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
    • August
    • Bodlaender, H.L., Fellows, M.R., Hallett, M.T., Wareham, T., and Warnow, T. August 2000. The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comp. Sci. 244: 167-188.
    • (2000) Theor. Comp. Sci. , vol.244 , pp. 167-188
    • Bodlaender, H.L.1    Fellows, M.R.2    Hallett, M.T.3    Wareham, T.4    Warnow, T.5
  • 2
    • 0032099099 scopus 로고    scopus 로고
    • Parallel implemenation of DNAml program on message-passing architectures
    • Ceron, C., Dopazo, J., Zapata, E.L., Carazo, J.M., and Trelles, O. 1998. Parallel implemenation of DNAml program on message-passing architectures. Parallel Computing 24: 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
  • 3
    • 85117171571 scopus 로고    scopus 로고
    • fastDNAml Distribution: http://geta.life.uiuc.edu/~gary/programs/fastDNAml.html
    • FastDNAml Distribution
  • 4
    • 0019797407 scopus 로고
    • Evolutionary trees from DNA sequences: A maximum likelihood approach
    • Felsenstein, J. 1981. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 17: 368-376.
    • (1981) J. Mol. Evol. , vol.17 , pp. 368-376
    • Felsenstein, J.1
  • 6
    • 85117190122 scopus 로고    scopus 로고
    • Höchstleistungsrechner in Bayern (HLRB): The Hitachi SR8000-F1: http://www.lrz-muenchen.de/services/compute/hlrb
    • The Hitachi SR8000-F1
  • 7
    • 0030732143 scopus 로고    scopus 로고
    • Majority-rule consensus of phylogenetic trees obtained by maximum-likelihood analysis
    • Jermiin, L.S., Olsen, G.J., Mengersen, K.L. and Easteal, S. 1997. Majority-rule consensus of phylogenetic trees obtained by maximum-likelihood analysis. Mol. Biol. Evol. 14: 1297-1302.
    • (1997) Mol. Biol. Evol. , vol.14 , pp. 1297-1302
    • Jermiin, L.S.1    Olsen, G.J.2    Mengersen, K.L.3    Easteal, S.4
  • 8
    • 0008827068 scopus 로고    scopus 로고
    • A fast algorithm for the computation and enumeration of perfect phylogenies
    • December
    • Kannan, S., and Warnow, T. December 1997. A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J. Comput. 26(6): 1749-1763.
    • (1997) SIAM J. Comput. , vol.26 , Issue.6 , pp. 1749-1763
    • Kannan, S.1    Warnow, T.2
  • 10
    • 0027957393 scopus 로고
    • FastdNamL: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood
    • Olsen, G.J., Matsuda, H., Hagstrom, R., and Overbeek, R. 1994. fastDNAml: A tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci. 10: 41-48.
    • (1994) Comput. Appl. Biosci. , vol.10 , pp. 41-48
    • Olsen, G.J.1    Matsuda, H.2    Hagstrom, R.3    Overbeek, R.4
  • 11
    • 18244389982 scopus 로고    scopus 로고
    • AXML: A fast program for sequential and parallel phylogenetic tree calculations based on the maximum likelihood method
    • August Stanford University, Palo Alto, California, accepted for publication
    • Stamatakis, A., Ludwig, T., Meier, H. and Wolf, M. J. August 2002. AxML: A Fast Program for Sequential and Parallel Phylogenetic Tree Calculations Based on the Maximum Likelihood Method. Proceedings of the 1st IEEE Computer Society Bioinformatics Conference (CSB 2002), Stanford University, Palo Alto, California, accepted for publication.
    • (2002) Proceedings of the 1st IEEE Computer Society Bioinformatics Conference (CSB 2002)
    • Stamatakis, A.1    Ludwig, T.2    Meier, H.3    Wolf, M.J.4
  • 12
    • 85129670957 scopus 로고    scopus 로고
    • Parallel implementation and performance of fastDNAml - A program for maximum likelihood phylogenetic inference
    • November Denver, CO
    • Stewart, C.A., Hart, D. Berry D.K., Olsen G.J., Wernert, E., and Fischer, W. November 2001. Parallel implementation and performance of fastDNAml - a program for maximum likelihood phylogenetic inference. Proceedings of SC2001, Denver, CO.
    • (2001) Proceedings of SC2001
    • Stewart, C.A.1    Hart, D.2    Berry, D.K.3    Olsen, G.J.4    Wernert, E.5    Fischer, W.6
  • 14
    • 85117185921 scopus 로고    scopus 로고
    • The ARB project: http://www.arb-home.de
  • 16
    • 85117161330 scopus 로고    scopus 로고
    • Top 500 supercomputer sites: http://www.top500.org/list/2002/06
  • 17
    • 0034123820 scopus 로고    scopus 로고
    • TrexML: A maximum likelihood program for extensive tree-space exploration
    • Wolf, M.J., Easteal, S., Kahn, M. McKay, B.D., and Jermiin, L.S. 2000. TrExML: A maximum likelihood program for extensive tree-space exploration. Bioinformatics 16:383-394.
    • (2000) Bioinformatics , vol.16 , pp. 383-394
    • Wolf, M.J.1    Easteal, S.2    Kahn, M.3    McKay, B.D.4    Jermiin, L.S.5


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