The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
PROMALS: towards accurate multiple sequence alignments of distantly related proteins
Abstract
Motivation: Accurate multiple sequence alignments are essential in protein structure modeling, functional prediction and efficient planning of experiments. Although the alignment problem has attracted considerable attention, preparation of high-quality alignments for distantly related sequences remains a difficult task. Results: We developed PROMALS, a multiple alignment method that shows promising results for protein homologs with sequence identity below 10%, aligning close to half of the amino acid residues correctly on average. This is about three times more accurate than traditional pairwise sequence alignment methods. PROMALS algorithm derives its strength from several sources: (i) sequence database searches to retrieve additional homologs; (ii) accurate secondary structure prediction; (iii) a hidden Markov model that uses a novel combined scoring of amino acids and secondary structures; (iv) probabilistic consistency-based scoring applied to progressive alignment of profiles. Compared to the best alignment methods that do not use secondary structure prediction and database searches (e.g. MUMMALS, ProbCons and MAFFT), PROMALS is up to 30% more accurate, with improvement being most prominent for highly divergent homologs. Compared to SPEM and HHalign, which also employ database searches and secondary structure prediction, PROMALS shows an accuracy improvement of several percent. Availability: The PROMALS web server is available at: http://prodata.swmed.edu/promals/ Contact: jpei@chop.swmed.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
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
T-coffee: a novel method for fast and accurate multiple sequence alignment 1 1Edited by J. Thornton
Notredame, C., Higgins, D. G., & Heringa, J. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.4042 · Cited by 6,852
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
Eddy, S. R. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.9.755 · Cited by 5,515
Jones, D. T. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1999.3091 · Cited by 5,449
MAFFT version 5: improvement in accuracy of multiple sequence alignment
Katoh, K. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki198 · Cited by 4,837
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246
Cited by
Recent developments in the MAFFT multiple sequence alignment program
Katoh, K., & Toh, H. (2008) · Briefings in Bioinformatics · doi:10.1093/bib/bbn013 · Cited by 3,586
PROMALS3D: a tool for multiple protein sequence and structure alignments
Pei, J., Kim, B.-H., & Grishin, N. V. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn072 · Cited by 1,298
Self-citationDi Tommaso, P., Moretti, S., Xenarios, I., Orobitg, M., Montanyola, A., Chang, J.-M., Taly, J.-F., & Notredame, C. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr245 · Cited by 1,165
A global averaging method for dynamic time warping, with applications to clustering
Petitjean, F., Ketterlin, A., & Gançarski, P. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.013 · Cited by 1,138
Szymanski, K. M., Binns, D., Bartz, R., Grishin, N. V., Li, W.-P., Agarwal, A. K., Garg, A., Anderson, R. G. W., & Goodman, J. M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0704154104 · Cited by 628
Self-citationKatoh, K., & Toh, H. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-212 · Cited by 603
The DISC locus in psychiatric illness
Chubb, J. E., Bradshaw, N. J., Soares, D. C., Porteous, D. J., & Millar, J. K. (2008) · Molecular Psychiatry · doi:10.1038/sj.mp.4002106 · Cited by 542
Angel, R., Claus, P., & Conrad, R. (2012) · The ISME Journal · doi:10.1038/ismej.2011.141 · Cited by 520
Structure prediction for CASP8 with all‐atom refinement using Rosetta
Raman, S., Vernon, R., Thompson, J., Tyka, M., Sadreyev, R., Pei, J., Kim, D., Kellogg, E., DiMaio, F., Lange, O., et al. (2009) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22540 · Cited by 518
Self-citationMAFFT: Iterative Refinement and Additional Methods
Katoh, K., & Standley, D. M. (2014) · Methods in Molecular Biology · doi:10.1007/978-1-62703-646-7_8 · Cited by 516
Wang, J. (2020) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.0c00179 · Cited by 498
DECIPHER: harnessing local sequence context to improve protein multiple sequence alignment
Wright, E. S. (2015) · BMC Bioinformatics · doi:10.1186/s12859-015-0749-z · Cited by 385
Liu, Y., Tewari, R., Ning, J., Blagborough, A. M., Garbom, S., Pei, J., Grishin, N. V., Steele, R. E., Sinden, R. E., Snell, W. J., et al. (2008) · Genes & Development · doi:10.1101/gad.1656508 · Cited by 320
Self-citationTemplate-Based Protein Structure Modeling
Fiser, A. (2010) · Methods in Molecular Biology · doi:10.1007/978-1-60761-842-3_6 · Cited by 259
Thompson, J. D., Linard, B., Lecompte, O., & Poch, O. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018093 · Cited by 242
Izumo is part of a multiprotein family whose members form large complexes on mammalian sperm
Ellerman, D. A., Pei, J., Gupta, S., Snell, W. J., Myles, D., & Primakoff, P. (2009) · Molecular Reproduction and Development · doi:10.1002/mrd.21092 · Cited by 143
Self-citationIssues in bioinformatics benchmarking: the case study of multiple sequence alignment
Aniba, M. R., Poch, O., & Thompson, J. D. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq625 · Cited by 72
Highly significant improvement of protein sequence alignments with AlphaFold2
(2022) · doi:10.1093/bioinformatics/btac625 · Cited by 32
Identification of a covert evolutionary pathway between two protein folds
Chakravarty, D., Sreenivasan, S., Swint-Kruse, L., & Porter, L. L. (2023) · Nature Communications · doi:10.1038/s41467-023-38519-0 · Cited by 29
Identification of a covert evolutionary pathway between two protein folds
Chakravarty, D., Sreenivasan, S., Swint-Kruse, L., & Porter, L. L. (2022) · doi:10.1101/2022.12.08.519646 · Cited by 2
Metadata
- Authors
- Pei, J., & Grishin, N. V.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-01-31
- Volume
- 23
- Issue
- 7
- Pages
- 802-808
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2169602699
- Cited by
- 338
- References
- 36
- FWCI
- 10.30
- Type
- journal article
- 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.