Addressable procedures for logic and arithmetic operations with DNA strands

In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA representation of n binary numbers of m bits, and propose a procedure to assign values for the representation. The procedure is applicable to n binary numbers of m bits in O(1) lab steps in parallel. Next, we propose a procedure for logic operations. The procedure enables any Boolean operation whose input and output are defined by a truth table, and executes different kinds of Boolean operations simultaneously for any pair of n binary numbers of m bits in O(1) lab steps using O(mn) DNA strands. Finally, we propose a procedure for additions of pairs of two binary numbers. The procedure works in O(1) lab steps using O(mn) DNA strands for O(n) additions of two m-bit binary numbers.