In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose two procedures for sorting with DNA strands. An input of the algorithms is a set of binary numbers of bits, which are denoted by kinds of DNA strands. We first propose a procedure for the compare-and-e...

Our goal is to better understand, at a theoretical level, the database aspects of DNA computing. Thereto, we introduce a formally defined data model of so-called sticker DNA complexes, suitable for the representation and manipulation of structured data in DNA. We also define DNAQL, a restricted programming language over sticker DNA complexes. DNAQL stands to general DNA computing as the standar...

A defining moment for DNA computing was Adleman’s (1) fundamental contribution in which he demonstrated the potential of this novel computing paradigm by solving an instance of the Hamiltonian Path Problem in theoretical as well as practical terms. Since then, DNA computing has been proposed and tested in numerous areas including, finite automata (14), machine learning (12), relational database...

Molecular computing is a new multidisciplinary area of research concerned with design, and theoretical and empirical understanding of computing gleaned from nature. It aims at the implementation of algorithms in molecular hardware, e.g. using DNA molecules and enzymes. The main advantages of the molecular computing lie in the possibility to obtain a massive parallelism of computation and associ...