Improved Genetic Algorithm for Designing DNA Sequences

Author

Hongyan, Zhang ; Xiyu, Liu

Author_Institution

Sch. of Inf. & Manage., Shandong Normal Univ., Jinan, China

Volume

1

fYear

2009

fDate

22-24 May 2009

Firstpage

514

Lastpage

518

Abstract

Designing DNA sequences is one of the most practical and important research topics in DNA computing. An improved genetic algorithm for designing of the equal-length single-stranded DNA sequences is proposed, especially for the short DNA sequences needed in the DNA computing experiment. This algorithm can satisfy certain combinatorial and thermodynamic constraints such as GC content constraint, Hamming distance constraint and similarity constraint. It can generate the good short DNA sequences quickly by giving up the bad sequences in every generation. Finally, through analyzing the experiment data, two formulas are given to estimate the number of the DNA sequences satisfied GC content constraint and Hamming distance constraint.

Keywords

biocomputing; genetic algorithms; DNA computing; DNA sequences design; Hamming distance constraint; genetic algorithm; similarity constraint; Algorithm design and analysis; Biological information theory; DNA computing; Data analysis; Genetic algorithms; Genetic mutations; Hamming distance; Information management; Sequences; Thermodynamics; DNA computing; designing of DNA sequences; genetic algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on

Conference_Location

Nanchang

Print_ISBN

978-0-7695-3643-9

Type

conf

DOI

10.1109/ISECS.2009.11

Filename

5209670