A genetic algorithm for molecular sequence comparison

Author

Zhang, Ching

Author_Institution

Dept. of Syst. Design Eng., Waterloo Univ., Ont., Canada

Volume

2

fYear

1994

fDate

2-5 Oct 1994

Firstpage

1926

Abstract

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

Keywords

biophysics; computational complexity; estimation theory; genetic algorithms; molecular biophysics; search problems; biomolecular sequence comparison; genetic algorithm; optimal point searching; robust search; sequence alignment; stochastic algorithms; Algorithm design and analysis; Computational biology; DNA; Design engineering; Dynamic programming; Genetic algorithms; Genetic engineering; Robustness; Sequences; Stochastic processes; Stochastic systems; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-2129-4

Type

conf

DOI

10.1109/ICSMC.1994.400133

Filename

400133