DNA ternary addition

In this paper, we first show a DNA representation of a ternary number with digit set {− 1, 0, 1}, which features its address and each bit position. Based on this DNA representation, operations for value assigning and bit position shifting are proposed. The algorithm of DNA computing for adding two ternary integers is presented. The algorithm works in O(m) steps for adding two ternary integers of m bits.