The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Kalign2: high-performance multiple alignment of protein and nucleotide sequences allowing external features
Open accessAbstract
In the growing field of genomics, multiple alignment programs are confronted with ever increasing amounts of data. To address this growing issue we have dramatically improved the running time and memory requirement of Kalign, while maintaining its high alignment accuracy. Kalign version 2 also supports nucleotide alignment, and a newly introduced extension allows for external sequence annotation to be included into the alignment procedure. We demonstrate that Kalign2 is exceptionally fast and memory-efficient, permitting accurate alignment of very large numbers of sequences. The accuracy of Kalign2 compares well to the best methods in the case of protein alignments while its accuracy on nucleotide alignments is generally superior. In addition, we demonstrate the potential of using known or predicted sequence annotation to improve the alignment accuracy. Kalign2 is freely available for download from the Kalign web site (http://msa.sbc.su.se/).
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
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
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
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
MUSCLE: 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
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
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
Fast folding and comparison of RNA secondary structures
Hofacker, I. L., Fontana, W., Stadler, P. F., Bonhoeffer, L. S., Tacker, M., & Schuster, P. (1994) · Monatshefte f�r Chemie Chemical Monthly · doi:10.1007/bf00818163 · Cited by 2,306
Pfam: clans, web tools and services
Finn, R. D. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj149 · Cited by 2,302
[5] Rapid and sensitive sequence comparison with FASTP and FASTA
Pearson, W. R. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83007-v · Cited by 1,946
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
Rfam: annotating non-coding RNAs in complete genomes
Griffiths-Jones, S. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki081 · Cited by 1,714
Optimal alignments in linear space
Myers, E. W., & Miller, W. (1988) · Bioinformatics · doi:10.1093/bioinformatics/4.1.11 · Cited by 1,235
ProbCons: Probabilistic consistency-based multiple sequence alignment
Do, C. B., Mahabhashyam, M. S. P., Brudno, M., & Batzoglou, S. (2005) · Genome Research · doi:10.1101/gr.2821705 · Cited by 1,114
Fast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
Kalign – an accurate and fast multiple sequence alignment algorithm
Lassmann, T., & Sonnhammer, E. L. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-298 · Cited by 705
Self-citationDIALIGN 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
M-Coffee: combining multiple sequence alignment methods with T-Coffee
Wallace, I. M. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl091 · Cited by 581
BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark
Thompson, J. D., Koehl, P., Ripp, R., & Poch, O. (2005) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20527 · Cited by 404
Recent progress in multiple sequence alignment: a survey
Notredame, C. (2002) · Pharmacogenomics · doi:10.1517/14622416.3.1.131 · Cited by 353
Rose: generating sequence families.
Stoye, J., Evers, D., & Meyer, F. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.2.157 · Cited by 265
Sequence alignment and penalty choice
Vingron, M., & Waterman, M. S. (1994) · Journal of Molecular Biology · doi:10.1016/s0022-2836(05)80006-3 · Cited by 249
SCORING PAIRWISE GENOMIC SEQUENCE ALIGNMENTS
CHIAROMONTE, F., YAP, V. B., & MILLER, W. (2001) · Biocomputing 2002 · doi:10.1142/9789812799623_0012 · Cited by 214
Karchin, R., Cline, M., Mandel‐Gutfreund, Y., & Karplus, K. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10369 · Cited by 201
Improvement in the accuracy of multiple sequence alignment program MAFFT.
Katoh, K., Kuma, K., Miyata, T., & Toh, H. (2005) · PubMed · Cited by 183
An enhanced RNA alignment benchmark for sequence alignment programs
Wilm, A., Mainz, I., & Steger, G. (2006) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-1-19 · Cited by 137
Automatic assessment of alignment quality
Lassmann, T., & Sonnhammer, E. L. L. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki1020 · Cited by 132
Self-citationPartTree: an algorithm to build an approximate tree from a large number of unaligned sequences
Katoh, K., & Toh, H. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl592 · Cited by 105
CONTRAlign: Discriminative Training for Protein Sequence Alignment
Do, C. B., Gross, S. S., & Batzoglou, S. (2006) · Lecture notes in computer science · doi:10.1007/11732990_15 · Cited by 90
Qian, B., & Goldstein, R. A. (2001) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.1129 · Cited by 77
Multiple alignment of complete sequences (MACS) in the post-genomic era
Lecompte, O., Thompson, J., Plewniak, F., Thierry, J., & Poch, O. (2001) · Gene · doi:10.1016/s0378-1119(01)00461-9 · Cited by 70
MACSIMS : multiple alignment of complete sequences information management system
Thompson, J., Muller, A., Waterhouse, A. M., Procter, J. B., Barton, G. J., Plewniak, F., & Poch, O. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-318 · Cited by 52
Refining multiple sequence alignments with conserved core regions
Chakrabarti, S., Lanczycki, C. J., Panchenko, A. R., Przytycka, T. M., Thiessen, P. A., & Bryant, S. H. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl274 · Cited by 42
Cited by
Whole-genome analyses resolve early branches in the tree of life of modern birds
Jarvis, E. D., Mirarab, S., Aberer, A. J., Li, B., Houde, P., Li, C., Ho, S. Y. W., Faircloth, B. C., Nabholz, B., Howard, J. T., et al. (2014) · Science · doi:10.1126/science.1253451 · Cited by 1,901
Characterization of the oral fungal microbiome (mycobiome) in healthy individuals
Ghannoum, M. A., Jurevic, R. J., Mukherjee, P. K., Cui, F., Sikaroodi, M., Naqvi, A., & Gillevet, P. M. (2010) · PLoS Pathogens · doi:10.1371/journal.ppat.1000713 · Cited by 1,150
“to reduce the number of sequences used in the multiple alignment. These clusters were annotated by the number of reads in each sample and then aligned using KALIGN”
MethodThe EMBL-EBI bioinformatics web and programmatic tools framework
Li, W., Cowley, A., Uludag, M., Gur, T., McWilliam, H., Squizzato, S., Park, Y. M., Buso, N., & Lopez, R. (2015) · Nucleic Acids Research · doi:10.1093/nar/gkv279 · Cited by 1,024
InParanoid 7: new algorithms and tools for eukaryotic orthology analysis
Ostlund, G., Schmitt, T., Forslund, K., Kostler, T., Messina, D. N., Roopra, S., Frings, O., & Sonnhammer, E. L. L. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkp931 · Cited by 623
Self-citationZhang, D., de Souza, R. F., Anantharaman, V., Iyer, L. M., & Aravind, L. (2012) · Biology Direct · doi:10.1186/1745-6150-7-18 · Cited by 515
Metadata
- Authors
- Lassmann, T., Frings, O., & Sonnhammer, E. L. L.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-12-22
- Volume
- 37
- Issue
- 3
- Pages
- 858-865
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2170831688
- Cited by
- 274
- References
- 32
- FWCI
- 4.47
- Type
- journal article
- Language
- en
- Open access
- gold
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.