Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (204K) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (96)
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Notredame, C
Right arrow Articles by Higgins, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Notredame, C
Right arrow Articles by Higgins, D.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, Vol 24, Issue 8 1515-1524, Copyright © 1996 by Oxford University Press


ARTICLES

SAGA: sequence alignment by genetic algorithm

C Notredame and DG Higgins
EMBL outstation, The European Bioinformatics Institute, Cambridge, UK.

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.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
C. Kemena and C. Notredame
Upcoming challenges for multiple sequence alignment methods in the high-throughput era
Bioinformatics, October 1, 2009; 25(19): 2455 - 2465.
[Abstract] [Full Text] [PDF]


Home page
CSH ProtocolsHome page
D. W. Mount
Using Iterative Methods for Global Multiple Sequence Alignment
CSH Protocols, July 1, 2009; 2009(7): pdb.top44 - pdb.top44.
[Abstract] [Full Text]


Home page
Brief BioinformHome page
K. Katoh and H. Toh
Recent developments in the MAFFT multiple sequence alignment program
Brief Bioinform, July 1, 2008; 9(4): 286 - 298.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
G. B. Fogel
Computational intelligence approaches for pattern discovery in biological systems
Brief Bioinform, July 1, 2008; 9(4): 307 - 316.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. S. Papadopoulos and R. Agarwala
COBALT: constraint-based alignment tool for multiple protein sequences
Bioinformatics, May 1, 2007; 23(9): 1073 - 1079.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
S. Kumar and A. Filipski
Multiple sequence alignment: In pursuit of homologous DNA positions
Genome Res., February 1, 2007; 17(2): 127 - 135.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
I. M. Wallace, O. O'Sullivan, D. G. Higgins, and C. Notredame
M-Coffee: combining multiple sequence alignment methods with T-Coffee
Nucleic Acids Res., March 23, 2006; 34(6): 1692 - 1699.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
S. Chakrabarti, C. J. Lanczycki, A. R. Panchenko, T. M. Przytycka, P. A. Thiessen, and S. H. Bryant
Refining multiple sequence alignments with conserved core regions.
Nucleic Acids Res., January 1, 2006; 34(9): 2598 - 2606.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
I. M. Wallace, O. Orla, and D. G. Higgins
Evaluation of iterative alignment algorithms for multiple alignment
Bioinformatics, April 15, 2005; 21(8): 1408 - 1414.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
C. B. Do, M. S.P. Mahabhashyam, M. Brudno, and S. Batzoglou
ProbCons: Probabilistic consistency-based multiple sequence alignment
Genome Res., February 1, 2005; 15(2): 330 - 340.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
B. Chevreux, T. Pfisterer, B. Drescher, A. J. Driesel, W. E.G. Muller, T. Wetter, and S. Suhai
Using the miraEST Assembler for Reliable and Automated mRNA Transcript Assembly and SNP Detection in Sequenced ESTs
Genome Res., June 1, 2004; 14(6): 1147 - 1159.
[Abstract] [Full Text] [PDF]


Home page
INFORMS Journal on ComputingHome page
H. J. Greenberg, W. E. Hart, and G. Lancia
Opportunities for Combinatorial Optimization in Computational Biology
INFORMS Journal on Computing, January 1, 2004; 16(3): 211 - 231.
[Abstract] [PDF]


Home page
Protein Eng Des SelHome page
A. Williams, D.R. Gilbert, and D.R. Westhead
Multiple structural alignment for distantly related all {beta} structures using TOPS pattern discovery and simulated annealing
Protein Eng. Des. Sel., December 1, 2003; 16(12): 913 - 923.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
B. John and A. Sali
Comparative protein structure modeling by iterative alignment, model building and model assessment
Nucleic Acids Res., July 15, 2003; 31(14): 3982 - 3992.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
K.-C. Yeh and J. C. Lagarias
Eukaryotic phytochromes: Light-regulated serine/threonine protein kinases with histidine kinase ancestry
PNAS, November 10, 1998; 95(23): 13976 - 13981.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.