QuickTree: building huge Neighbour-Joining trees of protein sequences

被引：216

作者：

Howe, K ^{[1
]}

Bateman, A ^{[1
]}

Durbin, R ^{[1
]}

机构：

[1] Wellcome Trust Sanger Inst, Hinxton CB10 1SA, England

来源：

BIOINFORMATICS | 2002年 / 18卷 / 11期

关键词：

D O I：

10.1093/bioinformatics/18.11.1546

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the reconstruction of phylogenies for very large protein families (including the largest Pfam alignment containing 27000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods.

引用

页码：1546 / 1547

页数：2

共 10 条

[1] The SWISS-PROT protein sequence data bank and its supplement TrEMBL in 1999
Bairoch, A
Apweiler, R
[J]. NUCLEIC ACIDS RESEARCH, 1999, 27 (01) : 49 - 54
[2] Bateman A, 2004, NUCLEIC ACIDS RES, V32, pD138, DOI [10.1093/nar/gkp985, 10.1093/nar/gkh121, 10.1093/nar/gkr1065]
[3] DOWD K, 1998, HIGH PERFORMANCE COM
[4] Durbin R., 1998, BIOL SEQUENCE ANAL P
[5] BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data
Gascuel, O
[J]. MOLECULAR BIOLOGY AND EVOLUTION, 1997, 14 (07) : 685 - 695
[6] EMBOSS: The European molecular biology open software suite
Rice, P
Longden, I
Bleasby, A
[J]. TRENDS IN GENETICS, 2000, 16 (06) : 276 - 277
[7] THE NEIGHBOR-JOINING METHOD - A NEW METHOD FOR RECONSTRUCTING PHYLOGENETIC TREES
SAITOU, N
NEI, M
[J]. MOLECULAR BIOLOGY AND EVOLUTION, 1987, 4 (04) : 406 - 425
[8] Sokal R.R., 1958, University of Kansas science Bulletin, V38, P1409
[9] STUDIER JA, 1988, MOL BIOL EVOL, V5, P729
[10] CLUSTAL-W - IMPROVING THE SENSITIVITY OF PROGRESSIVE MULTIPLE SEQUENCE ALIGNMENT THROUGH SEQUENCE WEIGHTING, POSITION-SPECIFIC GAP PENALTIES AND WEIGHT MATRIX CHOICE
THOMPSON, JD
HIGGINS, DG
GIBSON, TJ
[J]. NUCLEIC ACIDS RESEARCH, 1994, 22 (22) : 4673 - 4680

← 1 →