Abstract

This paper proposes new models for DNA computation based on a simple principle called equality checking. The advantages of the proposed models may include (i) the universal computability of the general models, (ii) the clarity and simplicity of molecular biological operations employed, and therefore (iii) the high feasibility in molecular biological implementation of the models. 1 Introduction Since Adleman's ground-breaking work on the DNA implementation of computing a small instance of directed Hamiltonian path problem ([Adl94]), a numerous number of research papers on this new computation paradigm have been published. In fact, Adleman's model has been extensively studied by many researches, for generalizing his technique to solve larger class of problems ([Lip95a], [Lip95b],[Bea95]), for providing abstract DNA computer models with Turing computability ([Adl95],[Bea95], [Rot95],[WYS96]), and so forth. In spite of those efforts on pursuing possible implementation methods for DNA com...

Citations