Design of the Stack Structure Based on DNA Computing Model

Article Preview

Abstract:

DNA computer is a new type of computer which computing by biological molecular techniques. If DNA computer want to realize its practicability, it must be the same as a traditional computer. In order to settle the issues of representation and organizational in DNA computer, we need a reasonable data structures to effectively represent and organize the information of DNA computer. The thesis designs a stack structure model based on DNA computing, which can express limited stack constraints through hairpin structure. At the same time, it can complete the operations of entering stack and leaving stack using two different restrictive enzymes.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1393-1397

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Adleman Leonard M. Molecular Computation of Solution to Combinatorial Problems [J]. Science, 1994, 66(11): 1021-1024.

Google Scholar

[2] Li Wang-gen, DING Yong-sheng. Design and Implementation of Queue Data Structure in DNA Computer. Chinese Journal of Computer[J], 2007.6, PP:993-998.

Google Scholar

[3] Wang Shudong,Dong Yafei,Jin Xu.Minimum recovering problem based on DNA computing. [J].Journal of Chemical Information and Computer Seience,2002,42(2):146-150.

Google Scholar

[4] YAN Wei-min, WU Wei-min. Data Structure. Beijing: Tsinghua University Press, (2007)

Google Scholar

[5] Gao Lin,Ma Runnian, Xu Jin. DNA algorithm to the directed shortest Hamilton path problem[J].Systems Engineering and Electronics,2004, 24(8):102-104.

Google Scholar