Paper Info
Title
Cellular Automata Analysis On Self-Assembly Properties In Dna Tile Computing
Abstract
An Analysis on the self-assembly process in DNA tile computing is presented using the cellular automata approach. It is known that a cellular automata model can simulate various complex systems by updating the states of calculation cells based on the local interaction rules. Generally DNA computing is operated through the local interaction between complimentary strands. Therefore the cellular automata approach is suitable to investigate qualitative features of such systems. Focusing on the cryptosystem using a DNA motif called a triple crossover (TX) tile, we construct a new cellular automata model. Our objective is to find a solution to improve the fragmentation problem in the self-assembly process of a calculation sheet of TX tiles, because the fragmentation prevents the system from realizing the sufficient performance. Our results suggest that such fragmentation occurs when the error correction function is lost due to the strong stability of local interaction. It is expected that these findings using cellular automata simulations provide effective information to solve the problems to develop practical applications of DNA-based computation.
Year
DOI
Venue
2012
10.1007/978-3-642-33350-7_56
CELLULAR AUTOMATA, ACRI 2012
Keywords
Field
DocType
DNA computing, self-assembly, DNA cryptosystem, pattern formation
Complex system,Cellular automaton,Crossover,Mobile automaton,Computer science,Algorithm,Theoretical computer science,Cryptosystem,Stochastic cellular automaton,Computation,DNA computing
Conference
Volume
ISSN
Citations 
7495
0302-9743
1
PageRank 
References 
Authors
0.40
5
6
Name
Order
Citations
PageRank
Miki Hirabayashi1156.71
Syunsuke Kinoshita210.73
Shukichi Tanaka321.76
Hajime Honda410.40
Hiroaki Kojima55833.37
Kazuhiro Oiwa67229.15