Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 15,355

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

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

Open access
Sievers, Fabian, Wilm, Andreas, Dineen, David, Gibson, Toby J, Karplus, Kevin, Li, Weizhong, Lopez, Rodrigo, McWilliam, Hamish, Remmert, Michael, Söding, Johannes, Thompson, Julie D, Higgins, Desmond G·2011·Molecular Systems Biology
DOI 10.1038/msb.2011.75
Open this paper in CoChat — free account

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/msb.2011.75

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 23

  1. Aniba MR, Poch O, Thompson JD (2010) Issues in bioinformatics benchmarking: the case study of multiple sequence alignment. Nucleic Acids Res 38: 7353–7363 · DOI · Paper page
  2. Blackshields G, Sievers F, Shi W, Wilm A, Higgins DG (2010) Sequence emBedding for fast construction of guide trees for multiple sequence alignment. Algorithms Mol Biol 5: 21 · DOI
  3. Bradley RK, Roberts A, Smoot M, Juvekar S, Do J, Dewey C, Holmes I, Pachter L (2009) Fast statistical alignment. PLoS Comput Biol 5: e1000392 · DOI
  4. Clamp M, Cuff J, Searle SM, Barton GJ (2004) The Jalview Java alignment editor. Bioinformatics 20: 426–427 · DOI · Paper page
  5. Do CB, Mahabhashyam MSP, Brudno M, Batzoglou S (2005) ProbCons: probabilistic consistency‐based multiple sequence alignment. Genome Res 15: 330–340 · DOI · Paper page
  6. Eddy SR (1998) Profile hidden Markov models. Bioinformatics 14: 755–763 · DOI · Paper page
  7. Edgar RC (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 32: 1792–1797 · DOI · Paper page
  8. Edgar RC (2010) Quality measures for protein alignment benchmarks. Nucleic Acids Res 38: 2145–2153 · DOI
  9. Gouy M, Guindon S, Gascuel O (2010) SeaView version 4: a multiplatform graphical user interface for sequence alignment and phylogenetic tree building. Mol Biol Evol 27: 221–224 · DOI
  10. Hogeweg P, Hesper B (1984) The alignment of sets of sequences and the construction of phyletic trees: an integrated method. J Mol Evol 20: 175–186 · DOI
  11. Katoh K, Misawa K, Kuma K, Miyata T (2002) MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res 30: 3059–3066 · DOI · Paper page
  12. Katoh K, Toh H (2007) PartTree: an algorithm to build an approximate tree from a large number of unaligned sequences. Bioinformatics 23: 372–374 · DOI
  13. Larkin MA, Blackshields G, Brown NP, Chenna R, McGettigan PA, McWilliam H, Valentin F, Wallace IM, Wilm A, Lopez R, Thompson JD, Gibson TJ, Higgins DG (2007) Clustal W and Clustal X version 2.0. Bioinformatics 23: 2947–2948 · DOI · Paper page
  14. Lassmann T, Sonnhammer ELL (2005) Kalign—an accurate and fast multiple sequence alignment algorithm. BMC Bioinformatics 6: 298 · DOI · Paper page
  15. Liu Y, Schmidt B, Maskell DL (2010) MSAProbs: multiple sequence alignment based on pair hidden Markov models and partition function posterior probabilities. Bioinformatics 26: 1958–1964 · DOI · Paper page
  16. Löytynoja A, Goldman N (2008) Phylogeny‐aware gap placement prevents errors in sequence alignment and evolutionary analysis. Science 320: 1632–1635 · DOI · Paper page
  17. Mizuguchi K, Deane CM, Blundell TL, Overington JP (1998) HOMSTRAD: a database of protein structure alignments for homologous families. Protein Sci 7: 2469–2471 · DOI · Paper page
  18. Morgenstern B, Frech K, Dress A, Werner T (1998) DIALIGN: finding local similarities by multiple sequence alignment. Bioinformatics 14: 290–294 · DOI · Paper page
  19. Notredame C, Higgins DG, Heringa J (2000) T‐coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302: 205–217 · DOI
  20. Pirovano W, Feenstra KA, Heringa J (2008) PRALINETM: a strategy for improved multiple alignment of transmembrane proteins. Bioinformatics 24: 492–497 · DOI
  21. Söding J (2005) Protein homology detection by HMM–HMM comparison. Bioinformatics 21: 951–960 · DOI
  22. Thompson JD, Koehl P, Ripp R, Poch O (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61: 127–136 · DOI
  23. Wilm A, Higgins DG, Notredame C (2008) R‐Coffee: a method for multiple alignment of non‐coding RNA. Nucleic Acids Res 36: e52 · DOI

Cited by

See all 15,355

Metadata

Authors
Sievers, F., Wilm, A., Dineen, D., Gibson, T. J., Karplus, K., Li, W., Lopez, R., McWilliam, H., Remmert, M., Söding, J., Thompson, J. D., & Higgins, D. G.
Venue
Molecular Systems Biology
Publisher
Springer Science and Business Media LLC
Published
2011-01
Volume
7
Issue
1
Pages
539-539
ISSN
1744-4292 (ISSN-L)
DOI
10.1038/msb.2011.75
OpenAlex
W2127322768
Cited by
15,355
References
2
FWCI
120.85
Type
journal article
Language
en
Open access
gold
Licence

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.