메뉴 건너뛰기




Volumn 28, Issue 11, 2012, Pages 1536-1537

Ape 3.0: New tools for distance-based phylogenetics and evolutionary analysis in R

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; EVOLUTION; METHODOLOGY; PHYLOGENY;

EID: 84861739093     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts184     Document Type: Article
Times cited : (235)

References (18)
  • 1
    • 0008011966 scopus 로고    scopus 로고
    • A polynomial time algorithm for constructing the refined Buneman tree
    • Bryant, D. and Moulton, V. (1999) A polynomial time algorithm for constructing the refined Buneman tree. Appl. Math. Lett., 12, 51-56.
    • (1999) Appl. Math. Lett. , vol.12 , pp. 51-56
    • Bryant, D.1    Moulton, V.2
  • 2
    • 0042121237 scopus 로고    scopus 로고
    • Multiple sequence alignmentwith theClustal series of programs
    • Chenna, R. et al. (2003) Multiple sequence alignmentwith theClustal series of programs. Nucleic Acids Res., 31, 3497-3500.
    • (2003) Nucleic Acids Res. , vol.31 , pp. 3497-3500
    • Chenna, R.1
  • 3
    • 42549115175 scopus 로고    scopus 로고
    • Fast NJ-like algorithms to deal with incomplete distance matrices
    • Criscuolo, A. and Gascuel, O. (2008) Fast NJ-like algorithms to deal with incomplete distance matrices. BMC Bioinformatics, 9, 166.
    • (2008) BMC Bioinformatics , vol.9 , pp. 166
    • Criscuolo, A.1    Gascuel, O.2
  • 4
    • 34447341925 scopus 로고    scopus 로고
    • SDM: a fast distance-based approach for (super)tree building in phylogenomics
    • Criscuolo, A. et al. (2006) SDM: a fast distance-based approach for (super)tree building in phylogenomics. Syst. Biol., 55, 740-755.
    • (2006) Syst. Biol. , vol.55 , pp. 740-755
    • Criscuolo, A.1
  • 5
    • 0031880429 scopus 로고    scopus 로고
    • Reconstructing ancestral character states: a critical reappraisal
    • Cunningham, C. W. et al. (1998) Reconstructing ancestral character states: a critical reappraisal. Trends Ecol. Evol., 13, 361-366.
    • (1998) Trends Ecol. Evol. , vol.13 , pp. 361-366
    • Cunningham, C.W.1
  • 6
    • 0036943052 scopus 로고    scopus 로고
    • Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle
    • Desper, R. and Gascuel, O. (2002) Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J. Comput. Biol., 9, 687-705.
    • (2002) J. Comput. Biol. , vol.9 , pp. 687-705
    • Desper, R.1    Gascuel, O.2
  • 7
    • 3042666256 scopus 로고    scopus 로고
    • MUSCLE: multiple sequence alignment with high accuracy and high throughput
    • Edgar, R. C. (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
    • (2004) Nucleic Acids Res. , vol.32 , pp. 1792-1797
    • Edgar, R.C.1
  • 8
    • 0030807655 scopus 로고    scopus 로고
    • BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
    • Gascuel, O. (1997) BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol., 14, 685-695.
    • (1997) Mol. Biol. Evol. , vol.14 , pp. 685-695
    • Gascuel, O.1
  • 9
    • 0034360426 scopus 로고    scopus 로고
    • Data model and classification by trees: the minimum variance reduction (MVR) method
    • Gascuel, O. (2000) Data model and classification by trees: the minimum variance reduction (MVR) method. J. Classification, 17, 67-99.
    • (2000) J. Classification , vol.17 , pp. 67-99
    • Gascuel, O.1
  • 10
    • 0035314674 scopus 로고    scopus 로고
    • The triangles method to build X-trees from incomplete distance matrices
    • Guénoche, A. and Leclerc, B. (2001) The triangles method to build X-trees from incomplete distance matrices. RAIRO Oper. Res., 35, 283-300.
    • (2001) RAIRO Oper. Res. , vol.35 , pp. 283-300
    • Guénoche, A.1    Leclerc, B.2
  • 11
    • 4544263561 scopus 로고    scopus 로고
    • A weighted least-squares approach for inferring phylogenies from incomplete distance matrices
    • Makarenkov, V. and Lapointe, F.-J. (2004) A weighted least-squares approach for inferring phylogenies from incomplete distance matrices. Bioinformatics, 20, 2113-2121.
    • (2004) Bioinformatics , vol.20 , pp. 2113-2121
    • Makarenkov, V.1    Lapointe, F.-J.2
  • 12
    • 0008192343 scopus 로고
    • A manual method for character compatibility analysis
    • Meacham, C.A. (1981) A manual method for character compatibility analysis. Taxon, 30, 591-600.
    • (1981) Taxon , vol.30 , pp. 591-600
    • Meacham, C.A.1
  • 13
    • 0034623005 scopus 로고    scopus 로고
    • T-Coffee: a novel method for multiple sequence alignments
    • Notredame, C. et al. (2000) T-Coffee: a novel method for multiple sequence alignments. J. Mol. Biol., 302, 205-217.
    • (2000) J. Mol. Biol. , vol.302 , pp. 205-217
    • Notredame, C.1
  • 15
    • 1042304216 scopus 로고    scopus 로고
    • APE: analyses of phylogenetics and evolution in R language
    • Paradis, E. et al. (2004) APE: analyses of phylogenetics and evolution in R language. Bioinformatics, 20, 289-290.
    • (2004) Bioinformatics , vol.20 , pp. 289-290
    • Paradis, E.1
  • 16
    • 79961135005 scopus 로고    scopus 로고
    • R Development Core Team R Foundation for Statistical Computing, Vienna, Austria
    • R Development Core Team. (2011) R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria.
    • (2011) R: A Language and Environment for Statistical Computing
  • 17
    • 0023375195 scopus 로고
    • The neighbor-joining method: a new method for reconstructing phylogenetic trees
    • Saitou, N. and Nei, M. (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol.Evol., 4, 406-425.
    • (1987) Mol. Biol.Evol. , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 18


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