Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega

被引:11080
作者
Sievers, Fabian [1 ]
Wilm, Andreas [2 ]
Dineen, David [1 ]
Gibson, Toby J. [3 ]
Karplus, Kevin [4 ]
Li, Weizhong [5 ]
Lopez, Rodrigo [5 ]
McWilliam, Hamish [5 ]
Remmert, Michael [6 ]
Soeding, Johannes [6 ]
Thompson, Julie D. [7 ]
Higgins, Desmond G. [1 ]
机构
[1] Univ Coll Dublin, UCD Conway Inst Biomol & Biomed Res, Sch Med & Med Sci, Dublin 4, Ireland
[2] Genome Inst Singapore, Singapore, Singapore
[3] European Mol Biol Lab, Struct & Computat Biol Unit, Heidelberg, Germany
[4] Univ Calif Santa Cruz, Dept Biomol Engn, Santa Cruz, CA 95064 USA
[5] European Bioinformat Inst, EMBL Outstn, Cambridge, England
[6] Univ Munich LMU, Gene Ctr Munich, Munich, Germany
[7] Univ Strasbourg, Dept Biol Struct & Genom, IGBMC, CNRS,INSERM, Illkirch Graffenstaden, France
基金
爱尔兰科学基金会;
关键词
bioinformatics; hidden Markov models; multiple sequence alignment; CONSTRUCTION; ALGORITHM; ACCURATE; COFFEE; TREES;
D O I
10.1038/msb.2011.75
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Multiple sequence alignments are fundamental to many sequence analysis methods. Most alignments are computed using the progressive alignment heuristic. These methods are starting to become a bottleneck in some analysis pipelines when faced with data sets of the size of many thousands of sequences. Some methods allow computation of larger data sets while sacrificing quality, and others produce high-quality alignments, but scale badly with the number of sequences. In this paper, we describe a new program called Clustal Omega, which can align virtually any number of protein sequences quickly and that delivers accurate alignments. The accuracy of the package on smaller test cases is similar to that of the high-quality aligners. On larger data sets, Clustal Omega outperforms other packages in terms of execution time and quality. Clustal Omega also has powerful features for adding sequences to and exploiting information in existing alignments, making use of the vast amount of precomputed information in public databases like Pfam. Molecular Systems Biology 7: 539; published online 11 October 2011; doi:10.1038/msb.2011.75
引用
收藏
页数:6
相关论文
共 25 条
[1]   Issues in bioinformatics benchmarking: the case study of multiple sequence alignment [J].
Aniba, Mohamed Radhouene ;
Poch, Olivier ;
Thompson, Julie D. .
NUCLEIC ACIDS RESEARCH, 2010, 38 (21) :7353-7363
[2]  
[Anonymous], 2007, P 18 ANN ACM SIAM S
[3]   Sequence embedding for fast construction of guide trees for multiple sequence alignment [J].
Blackshields, Gordon ;
Sievers, Fabian ;
Shi, Weifeng ;
Wilm, Andreas ;
Higgins, Desmond G. .
ALGORITHMS FOR MOLECULAR BIOLOGY, 2010, 5
[4]   Fast Statistical Alignment [J].
Bradley, Robert K. ;
Roberts, Adam ;
Smoot, Michael ;
Juvekar, Sudeep ;
Do, Jaeyoung ;
Dewey, Colin ;
Holmes, Ian ;
Pachter, Lior .
PLOS COMPUTATIONAL BIOLOGY, 2009, 5 (05)
[5]   The Jalview Java']Java alignment editor [J].
Clamp, M ;
Cuff, J ;
Searle, SM ;
Barton, GJ .
BIOINFORMATICS, 2004, 20 (03) :426-427
[6]   ProbCons: Probabilistic consistency-based multiple sequence alignment [J].
Do, CB ;
Mahabhashyam, MSP ;
Brudno, M ;
Batzoglou, S .
GENOME RESEARCH, 2005, 15 (02) :330-340
[7]   Profile hidden Markov models [J].
Eddy, SR .
BIOINFORMATICS, 1998, 14 (09) :755-763
[8]   MUSCLE: multiple sequence alignment with high accuracy and high throughput [J].
Edgar, RC .
NUCLEIC ACIDS RESEARCH, 2004, 32 (05) :1792-1797
[9]   Quality measures for protein alignment benchmarks [J].
Edgar, Robert C. .
NUCLEIC ACIDS RESEARCH, 2010, 38 (07) :2145-2153
[10]   The Pfam protein families database [J].
Finn, Robert D. ;
Mistry, Jaina ;
Tate, John ;
Coggill, Penny ;
Heger, Andreas ;
Pollington, Joanne E. ;
Gavin, O. Luke ;
Gunasekaran, Prasad ;
Ceric, Goran ;
Forslund, Kristoffer ;
Holm, Liisa ;
Sonnhammer, Erik L. L. ;
Eddy, Sean R. ;
Bateman, Alex .
NUCLEIC ACIDS RESEARCH, 2010, 38 :D211-D222