The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
Open accessAbstract
In this paper, a new way to think about, and to construct, pairwise as well as multiple alignments of DNA and protein sequences is proposed. Rather than forcing alignments to either align single residues or to introduce gaps by defining an alignment as a path running right from the source up to the sink in the associated dot-matrix diagram, we propose to consider alignments as consistent equivalence relations defined on the set of all positions occurring in all sequences under consideration. We also propose constructing alignments from whole segments exhibiting highly significant overall similarity rather than by aligning individual residues. Consequently, we present an alignment algorithm that (i) is based on segment-to-segment comparison instead of the commonly used residue-to-residue comparison and which (ii) avoids the well-known difficulties concerning the choice of appropriate gap penalties: gaps are not treated explicity, but remain as those parts of the sequences that do not belong to any of the aligned segments. Finally, we discuss the application of our algorithm to two test examples and compare it with commonly used alignment methods. As a first example, we aligned a set of 11 DNA sequences coding for functional helix-loop-helix proteins. Though the sequences show only low overall similarity, our program correctly aligned all of the 11 functional sites, which was a unique result among the methods tested. As a by-product, the reading frames of the sequences were identified. Next, we aligned a set of ribonuclease H proteins and compared our results with alignments produced by other programs as reported by McClure et al. [McClure, M. A., Vasi, T. K. & Fitch, W. M. (1994) Mol. Biol. Evol. 11, 571-592]. Our program was one of the best scoring programs. However, in contrast to other methods, our protein alignments are independent of user-defined parameters.
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
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
CLUSTAL V: improved software for multiple sequence alignment
Higgins, D. G., Bleasby, A. J., & Fuchs, R. (1992) · Bioinformatics · doi:10.1093/bioinformatics/8.2.189 · Cited by 2,381
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
Fast and sensitive multiple sequence alignments on a microcomputer
Higgins, D. G., & Sharp, P. M. (1989) · Bioinformatics · doi:10.1093/bioinformatics/5.2.151 · Cited by 1,218
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
A sensitive procedure to compare amino acid sequences
Argos, P. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90226-9 · Cited by 190
Comparative analysis of multiple protein-sequence alignment methods.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040138 · Cited by 160
Dang, C. V., Dolde, C., Gillison, M. L., & Kato, G. J. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.2.599 · Cited by 160
Simultaneous comparison of three protein sequences.
Murata, M., Richardson, J. S., & Sussman, J. L. (1985) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.82.10.3073 · Cited by 140
Optimal alignment between groups of sequences and its application to multiple sequence alignment
Gotoh, O. (1993) · Computer applications in the biosciences · doi:10.1093/bioinformatics/9.3.361 · Cited by 127
Weighting in sequence space: a comparison of methods in terms of generalized sequences.
Vingron, M., & Sibbald, P. R. (1993) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.90.19.8777 · Cited by 85
A flexible multiple sequence alignment program
Martínez, H. M. (1988) · Nucleic Acids Research · doi:10.1093/nar/16.5.1683 · Cited by 74
Similarities between protein 3-D structures
Lessel, U. F., & Schomburg, D. (1994) · Protein Engineering Design and Selection · doi:10.1093/protein/7.10.1175 · Cited by 71
A method for the simultaneous alignment of three or more amino acid sequences
Johnson, M. S., & Doolittle, R. F. (1986) · Journal of Molecular Evolution · doi:10.1007/bf02115583 · Cited by 61
Motif-Biased Protein Sequence Alignment
Taylor, W. R. (1994) · Journal of Computational Biology · doi:10.1089/cmb.1994.1.297 · Cited by 11
Cited by
MAFFT: 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
“We have applied four methods described in Methods, NWAP-2, NW-NS-2, FFT-NS-2 and FFT-NS-i, to this database to compare their ef®ciencies with those of ®ve existing methods, DIALIGN (29,30), PIMA (31), CLUSTALW (7) version 1.”
MethodInfluentialMauve: Multiple alignment of conserved genomic sequence with rearrangements
Darling, A. C. E., Mau, B., Blattner, F. R., & Perna, N. T. (2004) · Genome Research · doi:10.1101/gr.2289704 · Cited by 4,949
“…can be readily observed between both closely related and divergent organisms of all types (Tillier and Collins 2000; Eichler and 2 similar to Smith-Waterman and Needleman-Wunsch (Thompson et al. 1994; Morgenstern et al. 1996; Morgenstern 1999; Notre-dame et al. 2000; Lee et al. 2002).”
BackgroundRecent 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
Transport Between the Cell Nucleus and the Cytoplasm
Görlich, D., & Kutay, U. (1999) · Annual Review of Cell and Developmental Biology · doi:10.1146/annurev.cellbio.15.1.607 · Cited by 2,022
Multiple Alignment of DNA Sequences with MAFFT
Katoh, K., Asimenos, G., & Toh, H. (2009) · Methods in Molecular Biology · doi:10.1007/978-1-59745-251-9_3 · Cited by 1,438
Metadata
- Authors
- Morgenstern, B., Dress, A., & Werner, T.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 1996-10-29
- Volume
- 93
- Issue
- 22
- Pages
- 12098-12103
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2052831012
- Cited by
- 299
- References
- 15
- FWCI
- 2.23
- Type
- journal article
- Language
- en
- Open access
- green
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.