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
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
Di 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
Self-citationCOBALT: constraint-based alignment tool for multiple protein sequences
Papadopoulos, J. S., & Agarwala, R. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm076 · Cited by 1,127
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
Chevreux, B., Pfisterer, T., Drescher, B., Driesel, A. J., Müller, W. E. G., Wetter, T., & Suhai, S. (2004) · Genome Research · doi:10.1101/gr.1917404 · Cited by 1,050
Meyers, B. C., Dickerman, A. W., Michelmore, R. W., Sivaramakrishnan, S., Sobral, B., & Young, N. D. (1999) · The Plant Journal · doi:10.1046/j.1365-313x.1999.00606.x · Cited by 838
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
“Thus, it seems worthwhile to apply alternative techniques such as branch and cut (Reinert et al ., 1997; Lenhof et al ., 1999) or genetic algorithms (Notredame and Higgins, 1996) to the optimization problem defined by our segment-based objective function.”
BackgroundMethodM-Coffee: combining multiple sequence alignment methods with T-Coffee
Wallace, I. M. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl091 · Cited by 581
Edgar, R. C., & Batzoglou, S. (2006) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2006.04.004 · Cited by 517
MAFFT: 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
Yeh, K.-C., & Lagarias, J. C. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.23.13976 · Cited by 411
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
Self-citationComparative protein structure modeling by iterative alignment, model building and model assessment
John, B. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg460 · Cited by 316
Relationships within the aldehyde dehydrogenase extended family
Perozich, J., Nicholas, H., Wang, B., Lindahl, R., & Hempel, J. (1999) · Protein Science · doi:10.1110/ps.8.1.137 · Cited by 286
Thompson, J. D., Linard, B., Lecompte, O., & Poch, O. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018093 · Cited by 242
“As a consequence, iterative algorithms were developed to construct more reliable multiple alignments, using for example iterative refinement strategies [17], Hidden Markov Models [18] or Genetic Algorithms [19].”
MethodMultiple sequence alignment modeling: Methods and applications
Chatzou, M., Magis, C., Chang, J.-M., Kemena, C., Bussotti, G., Erb, I., & Notredame, C. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbv099 · Cited by 229
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
Girisha, M. N., Badiger, V. P., & Pattar, S. (2022) · Network Modeling Analysis in Health Informatics and Bioinformatics · doi:10.1007/s13721-022-00353-7 · Cited by 4
“In doing so, we can ascertain the functionality of the unknown sequence (Corpet 1988; Johnson et al. 2008; Notredame and Higgins 1996).”
Background
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.