A DNA Algorithm of a Kind of Circular Forbidden Permutation Problem

Author

Wang, Lei ; Yang, Yu-xing ; Wang, Ai-min ; Ma, Ji-lan

Author_Institution

Sch. of Comput. & Inf. Eng., Anyang Normal Univ., Anyang

Volume

2

fYear

2009

fDate

25-26 April 2009

Firstpage

13

Lastpage

16

Abstract

Sticker model was a popular computing in the area of DNA computing. The separate operation was one of the important operation in this model. Adleman-Lipton DNA computing model was belong to sticker model, but, it was not convenient to use separate and multi-separate operation in Adleman-Lipton model. In order to solve this problem, extended separate technology and extended multi-separate technology were introduced. A common problem in combinatorics area was solved by DNA computing way; and a DNA algorithm of a kind of circular forbidden permutation problem was proposed based on sticker model, extended technology and extended multi-separate technology. What is more, an instance was solved by this algorithm. The biochemical operation steps were given by simulation experiment. At last, the final DNA strands were obtained which proved the validity of the algorithm.

Keywords

biocomputing; Adleman-Lipton DNA computing model; DNA algorithm; biochemical operation steps; circular forbidden permutation problem; sticker model; Biochemistry; Combinatorial mathematics; Computational modeling; Computer networks; Computer security; DNA computing; Educational institutions; Information security; Software algorithms; Wireless communication; DNA computation; circular permutation; sticker model;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-4223-2

Type

conf

DOI

10.1109/NSWCTC.2009.92

Filename

4908394