scholarly journals Biomolecular computing

2002 ◽  
Vol 20 (3) ◽  
pp. 215-216
Author(s):  
Masayuki Yamamura ◽  
Tom Head ◽  
Masami Hagiya
2020 ◽  
Vol 10 (3) ◽  
pp. 554-563
Author(s):  
Simone Aiassa ◽  
Rossana Terracciano ◽  
Sandro Carrara ◽  
Danilo Demarchi

Author(s):  
Tao Song ◽  
Xun Wang ◽  
Shudong Wang ◽  
Yun Jiang

DNA computing is widely accepted as a new computing framework all over the world. In this chapter, the background of DNA computing is firstly introduced by solving a Hamilton Path problem. Then three research directions are proposed according to the current development of it, including the theoretical framework, practical DNA computing models and DNA encoding. In each part of the three research directions, many recent results are involved. In the theoretical framework, DNA computing is proved to be computationally universal by four formal DNA computing models. In practical DNA computing models, DNA computing is shown to solve NP-complete problems and work well in other fields, such as medical science. In DNA encoding, some DNA codes and encoding methods are introduced to avoid the false positive phenomenon. And they have a final purpose in common: constructing a universal Biomolecular computing model, which is also called as biomolecular computer, to solve intractable problems for electrical computers. Finally, some further research directions are shown in each part for the design of biomolecular computer.


Author(s):  
Daniela Dragoman ◽  
Mircea Dragoman

1999 ◽  
Vol 3 (3) ◽  
pp. 236-250 ◽  
Author(s):  
M.H. Garzon ◽  
R.J. Deaton

2009 ◽  
Vol 3 (2) ◽  
pp. 130-138
Author(s):  
Israel Martinez-Perez ◽  
Zoya Ignatova ◽  
Karl-Heinz Zimmermann

2009 ◽  
Vol 31 (12) ◽  
pp. 2103-2108
Author(s):  
Xiang-Rong LIU ◽  
Dong-Ming ZHAO ◽  
Fang XI ◽  
Fei LI

2001 ◽  
Vol 7 (2) ◽  
pp. 259-278 ◽  
Author(s):  
Masahiko HIRATSUKA ◽  
Takafumi AOKI ◽  
Tatsuo HIGUCHI

Sign in / Sign up

Export Citation Format

Share Document