The Community for Technology Leaders
Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE (2008)
Dec. 19, 2008 to Dec. 20, 2008
ISBN: 978-0-7695-3490-9
pp: 252-255
ABSTRACT
It is not convenient to use separate or multi-separate operations of sticker DNA model directly in Adleman-Lipton model. In order to make experiments conveniently in Adleman-Lipton model, the Extended Separate technology was proposed originally; and the biochemical implementing method was given, too. Both a sticker DNA algorithm of linear full permutation problem (LIFPP) and a sticker DNA algorithm of circle full permutation problem (CIFPP) were proposed based on the vast parallelism and large message-storage capacity of sticker DNA model; and the differences between the algorithms were illustrated, too. The operation steps of the two algorithms were given through an instance; and the biochemical processes were illustrated by simulation experiments. The final correct results were gotten through the simulation experiments. Consequently, the feasibilities and validities of the algorithms were proved. At last, the operation complexities of the algorithms were analyzed.
INDEX TERMS
full permutation, circle permutation, DNA computation, sticker model
CITATION
Qingsheng Li, Yuxing Yang, Jilan Ma, "DNA Algorithms of Two Kinds of Full Permutation Problem Based on Sticker Model", Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE, vol. 01, no. , pp. 252-255, 2008, doi:10.1109/PACIIA.2008.129
179 ms
(Ver 3.3 (11022016))