SAGA: Sequence alignment by genetic algorithm

414Citations
Citations of this article
97Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Notredame, C., & Higgins, D. G. (1996). SAGA: Sequence alignment by genetic algorithm. Nucleic Acids Research, 24(8), 1515–1524. https://doi.org/10.1093/nar/24.8.1515

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free