论文信息 - A genetic algorithm for molecular sequence comparison

A genetic algorithm for molecular sequence comparison

Genetic algorithms are a set of stochastic algorithms for efficient and robust search. The problem of aligning biomolecular sequences can be converted into a one of searching for optimal points in a problem space. Thus a genetic algorithm can be developed for sequence alignment. In this paper, a genetic algorithm for aligning two sequences is described. The experimental results indicate that genetic algorithms may provide an efficient and accurate approach for biomolecular sequence comparison and analysis.<<ETX>>

Ching Zhang

[1] Michael S. Waterman,et al. General methods of sequence comparison , 1984 .

[2] David Sankoff,et al. A strategy for sequence phylogeny research , 1982, Nucleic Acids Res..

[3] K. De Jong. Learning with Genetic Algorithms: An Overview , 1988 .

[4] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[5] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6] David E. Goldberg,et al. Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[7] D Sankoff,et al. Matching sequences under deletion-insertion constraints. , 1972, Proceedings of the National Academy of Sciences of the United States of America.