DNA Hypernetworks for Information Storage and Retrieval

  • Byoung-Tak Zhang
  • Joo-Kyung Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4287)


Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addressable memories require complex interactions between memory elements, which makes conventional computation paradigms difficult. Here we present a molecular computational model of content-addressable information storage and retrieval which makes use of the massive interaction capability of DNA molecules in a reaction chamber. This model is based on the “hypernetwork” architecture which is an undirected hypergraph of weighted edges. We describe the theoretical basis of the hypernetwork model of associative memory and its realization in DNA-based computing. A molecular algorithm is derived for automatic storage of data into the hypernetwork, and its performance is examined on an image data set. In particular, we study the effect of the hyperedge cardinality and error tolerance on the associative recall performance. Our simulation results demonstrate that short DNA strands in a vast number can be effective in some pattern information processing tasks whose implementation is within reach of current DNA nanotechnology.


Associative Memory Incidence Matrix Error Tolerance Pattern Completion Ordinary Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baum, E.B.: Building an associative memory vastly larger than the brain. Science 268, 583–585 (1995)CrossRefGoogle Scholar
  2. 2.
    Berge, C.: Graphs and Hypergraphs. North-Holland Publishing, Amsterdam (1973)MATHGoogle Scholar
  3. 3.
    Chen, J., Deaton, R., Wang, Y.-Z.: A DNA-based memory with in vitro learning and associative recall. In: Chen, J., Reif, J.H. (eds.) DAN 2003. LNCS, vol. 2943, pp. 145–156. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Chisvin, L., Duckworth, R.J.: Content-addressable and associative memory: Alternatives to the ubiquitous RAM. IEEE Computer 22(7), 51–64 (1989)Google Scholar
  5. 5.
    Garzon, M., Bobba, K., Neel, A.: Efficiency and reliability of semantic retrieval in DNA-based memories. In: Chen, J., Reif, J.H. (eds.) DAN 2003. LNCS, vol. 2943, pp. 157–169. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Hopfield, J.: Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Nat. Acad. Sci. 81, 3088–3092 (1984)CrossRefGoogle Scholar
  7. 7.
    Hinton, G.E., Dayan, P., Frey, B.J., Neal, R.M.: The wake-sleep algorithm for unsupervised neural networks. Science 268, 1158–1161 (1995)CrossRefGoogle Scholar
  8. 8.
    Kohonen, T.: Content-Addressable Memories. Springer, Berlin (1980)MATHGoogle Scholar
  9. 9.
    Paziamtzis, K., Sheikholeslami, A.: A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme. IEEE Journal of Solid-State Circuits 39(9), 1512–1519 (2004)CrossRefGoogle Scholar
  10. 10.
    Reif, J.H., LaBean, T.H., Pirrung, M., Rana, V.S., Guo, B., Kingsford, C., Wickham, G.S.: Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 231–247. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Thurber, K.J., Wald, L.D.: Associative and parallel processors. ACM Computing Surveys 7(4), 215–225 (1975)MATHCrossRefGoogle Scholar
  12. 12.
    Zhang, B.-T., Jang, H.-Y.: A Bayesian Algorithm for In Vitro Molecular Evolution of Pattern Classifiers. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 458–467. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Zhang, B.-T., Yang, J.-S., Chi, S.-W.: Self-organizing latent lattice models for temporal gene expression profiling. Machine Learning 52(1/2), 67–89 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Byoung-Tak Zhang
    • 1
  • Joo-Kyung Kim
    • 1
  1. 1.Biointelligence Laboratory, School of Computer Science and EngineeringSeoul National UniversitySeoulKorea

Personalised recommendations