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   binary numbers of ¡ bits, and propose a procedure to assign values for the representation. The procedure is applicable to   binary numbers of ¡ bits in¢¤£¦¥¨§ 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   binary numbers of ¡ bits in ¢¤£¦¥¨§ lab steps using ¢¤£ ¡   § DNA strands. Finally, we propose a procedure for additions of pairs of two binary numbers. The procedure works in ¢¤£¦¥©§ lab steps using ¢¤£ ¡   § DNA strands for ¢¤£   § additions of two ¡ -bit binary numbers.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen
• Keywords: Binary Numbers, Distributed And Parallel Computing, DNA Strands, IPPS 2003, Procedure