The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
SAGA: sequence alignment by genetic algorithm
Open accessAbstract
We describe a new approach to multiple sequence alignment using genetic algorithms and an associated software package called SAGA. The method involves evolving a population of alignments in a quasi evolutionary manner and gradually improving the fitness of the population as measured by an objective function which measures multiple alignment quality. SAGA uses an automatic scheduling scheme to control the usage of 22 different operators for combining alignments or mutating them between generations. When used to optimise the well known sums of pairs objective function, SAGA performs better than some of the widely used alternative packages. This is seen with respect to the ability to achieve an optimal solution and with regard to the accuracy of alignment by comparison with reference alignments based on sequences of known tertiary structure. The general attraction of the approach is the ability to optimise any objective function that one can invent.
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
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-citationGenetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
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
Hidden Markov Models in Computational Biology
Krogh, A., Brown, M., Mian, I. S., Sjölander, K., & Haussler, D. (1994) · Journal of Molecular Biology · doi:10.1006/jmbi.1994.1104 · Cited by 1,943
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
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
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
A 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
A strategy for the rapid multiple alignment of protein sequences
Barton, G. J., & Sternberg, M. J. E. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90316-0 · Cited by 478
Improved sensitivity of profile searches through the use of sequence weights and gap excision
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Bioinformatics · doi:10.1093/bioinformatics/10.1.19 · Cited by 299
Optimal sequence alignment using affine gap costs
Altschul, S. F., & Erickson, B. W. (1986) · Bulletin of Mathematical Biology · doi:10.1007/bf02462326 · Cited by 234
A flexible method to align large numbers of biological sequences
Taylor, W. R. (1988) · Journal of Molecular Evolution · doi:10.1007/bf02143508 · Cited by 218
Weights for data related by a tree
Altschul, S. F., Carroll, R. J., & Lipman, D. J. (1989) · Journal of Molecular Biology · doi:10.1016/0022-2836(89)90234-9 · Cited by 177
MASCOT: multiple alignment system for protein sequences based on three-way dynamic programming
Hirosawa, M., Hoshida, M., Ishikawa, M., & Toya, T. (1993) · Bioinformatics · doi:10.1093/bioinformatics/9.2.161 · Cited by 165
Rapid and accurate estimates of statistical significance for sequence data base searches.
Waterman, M. S., & Vingron, M. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.11.4625 · Cited by 158
A data bank merging related protein structures and sequences
Pascarella, S., & Argos, P. (1992) · Protein Engineering Design and Selection · doi:10.1093/protein/5.2.121 · Cited by 141
Gap costs for multiple sequence alignment
Altschul, S. F. (1989) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(89)80196-1 · Cited by 139
Multiple sequence alignment using simulated annealing
Kim, J. R., Pramanik, S., & Chung, M. J. (1994) · Computer applications in the biosciences · doi:10.1093/bioinformatics/10.4.419 · Cited by 135
Determination of reliable regions in protein sequence alignments
Vingron, M., & Argos, P. (1990) · Protein Engineering Design and Selection · doi:10.1093/protein/3.7.565 · Cited by 110
Cited by
Thompson, J. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.24.4876 · Cited by 38,993
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
Self-citationRecent 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
Multiple sequence alignment with Clustal X
Jeanmougin, F., Thompson, J. D., Gouy, M., Higgins, D. G., & Gibson, T. J. (1998) · Trends in Biochemical Sciences · doi:10.1016/s0968-0004(98)01285-7 · Cited by 2,652
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
- Notredame, C.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 1996-04-15
- Volume
- 24
- Issue
- 8
- Pages
- 1515-1524
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2102941368
- Cited by
- 510
- References
- 22
- FWCI
- 3.22
- 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.