The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
T-coffee: a novel method for fast and accurate multiple sequence alignment 1 1Edited by J. Thornton
Abstract
We describe a new method (T-Coffee) for multiple sequence alignment that provides a dramatic improvement in accuracy with a modest sacrifice in speed as compared to the most commonly used alternatives. The method is broadly based on the popular progressive approach to multiple alignment but avoids the most serious pitfalls caused by the greedy nature of this algorithm. With T-Coffee we pre-process a data set of all pair-wise alignments between the sequences. This provides us with a library of alignment information that can be used to guide the progressive alignment. Intermediate alignments are then based not only on the sequences to be aligned next but also on how all of the sequences align with each other. This alignment information can be derived from heterogeneous sources such as a mixture of alignment programs and/or structure superposition. Here, we illustrate the power of the approach by using a combination of local and global pair-wise alignments to generate the library. The resulting alignments are significantly more reliable, as determined by comparison with a set of 141 test cases, than any of the popular alternatives that we tried. The improvement, especially clear with the more difficult test cases, is always visible, regardless of the phylogenetic spread of the sequences in the tests.
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.
Integrity signals
Registry
Cites
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.
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
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
Self-citationThe neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
Improved tools for biological sequence comparison.
Pearson, W. R., & Lipman, D. J. (1988) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.85.8.2444 · Cited by 11,227
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
Atlas of protein sequence and structure
Chang, M.-Y., Dayhoff, M. O., Eck, R. V., & Sochard, M. R. (1965) · NASA Technical Reports Server (NASA) · Cited by 4,383
Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
Feng, D.-F., & Doolittle, R. F. (1987) · Journal of Molecular Evolution · doi:10.1007/bf02603120 · Cited by 1,883
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
An improved algorithm for matching biological sequences
Gotoh, O. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90398-9 · Cited by 1,724
Database of homology‐derived protein structures and the structural meaning of sequence alignment
Sander, C., & Schneider, R. (1991) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340090107 · Cited by 1,639
Profile analysis: detection of distantly related proteins.
Gribskov, M., McLachlan, A. D., & Eisenberg, D. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.13.4355 · Cited by 1,325
Meurs, E., Chong, K., Galabru, J., Thomas, N. S. B., Kerr, I. M., Williams, B. R. G., & Hovanessian, A. G. (1990) · Cell · doi:10.1016/0092-8674(90)90374-n · Cited by 1,017
A time-efficient, linear-space local similarity algorithm
Huang, X., & Miller, W. (1991) · Advances in Applied Mathematics · doi:10.1016/0196-8858(91)90017-d · Cited by 1,004
On the Complexity of Multiple Sequence Alignment
WANG, L., & JIANG, T. (1994) · Journal of Computational Biology · doi:10.1089/cmb.1994.1.337 · Cited by 934
A comprehensive comparison of multiple sequence alignment programs
Thompson, J. D., Plewniak, F., & Poch, O. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.13.2682 · Cited by 741
DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.
Morgenstern, B. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.3.211 · Cited by 678
The Multiple Sequence Alignment Problem in Biology
Carrillo-Calvet, H., & Lipman, D. J. (1988) · SIAM Journal on Applied Mathematics · doi:10.1137/0148063 · Cited by 526
SAGA: sequence alignment by genetic algorithm
Notredame, C. (1996) · Nucleic Acids Research · doi:10.1093/nar/24.8.1515 · Cited by 510
Self-citationA tool for multiple sequence alignment.
Lipman, D. J., Altschul, S. F., & Kececioglu, J. D. (1989) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.86.12.4412 · Cited by 506
BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs.
Thompson, J. D., Plewniak, F., & Poch, O. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.1.87 · Cited by 474
Gribskov, M., Lothy, R., & Eisenberg, D. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83011-w · Cited by 472
[36] SSAP: Sequential structure alignment program for protein structure comparison
Orengo, C. A., & Taylor, W. R. (1996) · Methods in Enzymology · doi:10.1016/s0076-6879(96)66038-8 · Cited by 336
Gotoh, O. (1996) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0679 · Cited by 328
A flexible motif search technique based on generalized profiles
Bucher, P., Karplus, K., Moeri, N., & Hofmann, K. (1996) · Computers & Chemistry · doi:10.1016/s0097-8485(96)80003-9 · Cited by 316
The alignment of sets of sequences and the construction of phyletic trees: An integrated method
Hogeweg, P., & Hesper, B. (1984) · Journal of Molecular Evolution · doi:10.1007/bf02257378 · Cited by 263
Extracting protein alignment models from the sequence database
Neuwald, A. F., Liu, J. S., Lipman, D. J., & Lawrence, C. E. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.9.1665 · Cited by 234
COFFEE: an objective function for multiple sequence alignments.
Notredame, C., Holm, L., & Higgins, D. G. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.5.407 · Cited by 231
Self-citationA flexible method to align large numbers of biological sequences
Taylor, W. R. (1988) · Journal of Molecular Evolution · doi:10.1007/bf02143508 · Cited by 218
Kumar, S., & Filipski, A. (2004) · Dictionary of Bioinformatics and Computational Biology · doi:10.1002/0471650129.dob0481 · Cited by 213
Comparative analysis of multiple protein-sequence alignment methods.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040138 · Cited by 160
Heringa, J. (1999) · Computers & Chemistry · doi:10.1016/s0097-8485(99)00012-1 · Cited by 150
Self-citationProtein structure comparison using iterated double dynamic programming
Taylor, W. R. (1999) · Protein Science · doi:10.1110/ps.8.3.654 · Cited by 139
Proceedings of the 27th Hawaii International Conference on Systems Sciences
Bots, P. W. G., Sol, H. G., & Verbraeck, A. (1994) · International Conference on Systems · Cited by 134
The maximum weight trace problem in multiple sequence alignment
Kececioglu, J. D. (2005) · Springer eBooks · doi:10.1007/bfb0029800 · Cited by 109
Multiple sequence alignment with the divide-and-conquer method
Stoye, J. (1998) · Gene · doi:10.1016/s0378-1119(98)00097-3 · Cited by 95
A branch-and-cut algorithm for multiple sequence alignment
Reinert, K., Lenhof, H., Mutzel, P., Mehlhorn, K., & Kececioglu, J. D. (1997) · Research in Computational Molecular Biology · doi:10.1145/267521.267845 · Cited by 70
Combining many multiple alignments in one improved alignment.
Bucka-Lassen, K., Caprani, O., & Hein, J. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.2.122 · Cited by 42
Cited by
MUSCLE: multiple sequence alignment with high accuracy and high throughput
Edgar, R. C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh340 · Cited by 44,662
Clustal W and Clustal X version 2.0
Larkin, M. A., Blackshields, G., Brown, N. P., Chenna, R., McGettigan, P. A., McWilliam, H., Valentin, F., Wallace, I. M., Wilm, A., Lopez, R., et al. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm404 · Cited by 28,358
Self-citationMAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform
Katoh, K. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf436 · Cited by 17,027
Fast, scalable generation of high‐quality protein multiple sequence alignments using Clustal Omega
Sievers, F., Wilm, A., Dineen, D., Gibson, T. J., Karplus, K., Li, W., Lopez, R., McWilliam, H., Remmert, M., Söding, J., et al. (2011) · Molecular Systems Biology · doi:10.1038/msb.2011.75 · Cited by 15,355
Self-citationMUSCLE: a multiple sequence alignment method with reduced time and space complexity
Edgar, R. C. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-113 · Cited by 8,970
Metadata
- Authors
- Notredame, C., Higgins, D. G., & Heringa, J.
- Venue
- Journal of Molecular Biology
- Publisher
- Elsevier BV
- Published
- 2000-09
- Volume
- 302
- Issue
- 1
- Pages
- 205-217
- ISSN
- 0022-2836 (ISSN-L)
- OpenAlex
- W2144362290
- Cited by
- 6,852
- References
- 37
- Type
- book review
- Language
- en
- Open access
- closed
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.