DNA Computing Approach to Semantic Model

In this paper, we propose a new semantic model based on DNA computing. In the model the vertexes denote either a name of the target or both the attributes and attribute values. One path from an initial vertex to a terminal vertex means one object named on the tag. We name this model a semantic model based on DNA computing. The model explains a target object is reasoned out by the combinations between the vertexes. We describe its application to reasoning system by using DNA computing algorithm from theoretical point of a view. Vertexes and edges of the model are encoded to four kinds of nucleotides. The model is represented by double-stranded DNAs. Single-stranded DNAs are hybridized and ligated to let them the double-stranded DNAs, with the complementary sequences of input molecules and knowledge based ones. The generated DNAs are analyzed into necessary strands which are double-stranded DNAs representing the target objects. We discuss the proposed model and application with a simulation of computational complexity.

[1]  Junghuei Chen,et al.  A DNA-based memory with in vitro learning and associative recall , 2003, Natural Computing.

[2]  Masami Hagiya,et al.  Joining and rotating data with molecules , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[3]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

[4]  Bo Guo,et al.  Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability , 2001, DNA.

[5]  Byoung-Tak Zhang,et al.  Version Space Learning with DNA Molecules , 2002, DNA.

[6]  Erik Winfree,et al.  A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[7]  M. Ross Quillian,et al.  The teachable language comprehender: a simulation program and theory of language , 1969, CACM.

[8]  E. Shapiro,et al.  Programmable and autonomous computing machine made of biomolecules , 2001, Nature.

[9]  J. SantaLucia,et al.  A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[10]  J. SantaLucia,et al.  Improved nearest-neighbor parameters for predicting DNA duplex stability. , 1996, Biochemistry.

[11]  Junghuei Chen,et al.  A DNA-Based Memory with In Vitro Learning and Associative Recall , 2003, DNA.

[12]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[13]  R. Deaton,et al.  A statistical mechanical treatment of error in the annealing biostep of DNA computation , 1999 .

[14]  E B Baum,et al.  Building an associative memory vastly larger than the brain. , 1995, Science.

[15]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.