Abstract

This study describes the possible structure of hybrid DNA-computer. Hybrid DNA-computer is a hybrid of traditional binary electronic computer and DNA-computer. DNA-computer is a computer that uses DNA-molecules to perform the computations instead of silicon chips. Traditional part of hybrid computer is supposed to control the DNA-part. The hybrid DNA-computer combines the power of modern electronic and DNA-computers. This computer provides the convenience and capabilities in solving problems that requires the brute-force search. The suggested structure of DNA-part is scalable and reusable. DNA-part is controlled by special electronic microcontrollers, which are controlled by traditional electronic computer. Electronic computer can keep some intermediate data while DNA-part is operating. The hybrid computer is a universal machine and it can compute a wide variety of problems. Another advantage of hybrid computer is a software that could be developed in familiar way. Hybrid computer can provide an API, which could be used in regular programming languages. It will be sufficient to import some library into a project and the apps will be able to use advantages of both electronic and DNA-computers. Of course, creating of such computers could give additional difficulties, but the model suggested in this study could be a good starting point for hybrid computer systems. Here are the structure and the common principles of DNA-part in this study. The suggested structure is scalable and could be modified to work with DNA-memory complexes of any length, memory unit also could be extended.

Keywords:

Bio computer, DNA-computations, DNA-logic, hybrid computer, molecular computer,

References

1. Adleman, L.M., 1994. Molecular computation of solutions to combinatorial problems. Science, 226(5187): 1021-1024. http://www.sciencemag.org/content/266/5187/1021.
   CrossRef    Direct Link
2. Benenson, Y., T. Paz-Elizur, R. Adar, E. Keinan, Z. Livneh and E. Shapiro, 2001. Programmable and autonomous computing machine made of biomolecules. Nature, 414: 430-434.
   CrossRef    PMid:11719800 PMCid:PMC3838952    Direct Link
3. Cheng, Z., M. Lina, D. Yafei, Y. Jing and X. Jin, 2013. Molecular logic computing model based on DNA self-assembly strand branch migration. Chinese Sci. Bull., 58(1): 32-38.
   CrossRef    
4. Elbas, J., O. Liobashevski, F. Wang, F. Remacle, R. Levine and I. Willner, 2010. DNA computing circuits using libraries of DNAzyme subunits. Nat. Nanotechnol., 5: 417-422. http://www.nature.com/nnano/journal/v5/n6/abs/nnano.2010.88.html.
   CrossRef    PMid:20512129    Direct Link
5. Ke, Y.G., L.L. Ong, W.M. Shih and P. Yin, 2012. Three-dimensional structures self-assembled from DNA bricks. Science, 338(6111): 1177-1183. https://www.sciencemag.org/content/338/6111/1177.short.
   CrossRef    PMid:23197527 PMCid:PMC3843647    Direct Link
6. Lipton, R.J., 1995. Using DNA to solve NP-complete problems. Science, 268: 542-545.
   CrossRef    PMid:7725098    
7. Qian, L. and E. Winfree, 2011. Scaling up digital circuit computation with DNA strand displacement cascades. Science, 332(6034): 1196-1201. http://www.sciencemag.org/content/332/6034/1196abstract.
   CrossRef    PMid:21636773    
8. Rothemund, P.W.K., N. Papadakis and E. Winfree, 2004. Algorighmic self-assembly of DNA sierpinski triangles. PLOS Biol., 2(12). http://www.dna.caltech.edu/Papers/SierpinskiDNA_PLoS2004.pdf.
   CrossRef    PMid:15583715 PMCid:PMC534809    Direct Link
9. Roweis, S., E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W. Rothemund and L.M. Adleman, 1996. A sticker-based model for DNA computation. J. Comput. Biol., 5(4): 615-629.
   CrossRef    PMid:10072080    Direct Link
10. Sorgenfrei, S., C.Y. Chiu, R.L. Gonzalez Jr., Y.J. Yu, P. Kim, C. Nuckolls and K.L. Shepard, 2011. Label-free single-molecule detection of DNA-hybridization kinetics with a carbon nanotube ?eld-effect transistor. Nat.
    CrossRef    PMid:21258331 PMCid:PMC3783941    Direct Link

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.