DNA ternary addition

Wenxia Li; Dongmei Xiao; Lin He

doi:10.1016/j.amc.2006.04.051

DNA ternary addition

Wenxia Li, Dongmei Xiao, Lin He

School of Mathematical Sciences

Shanghai Jiao Tong University

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	977-986
Number of pages	10
Journal	Applied Mathematics and Computation
Volume	182
Issue number	2
DOIs	https://doi.org/10.1016/j.amc.2006.04.051
State	Published - 15 Nov 2006

Keywords

Algorithm
DNA computing
DNA representation
Ternary integers

Access to Document

10.1016/j.amc.2006.04.051

Cite this

@article{6ea85baeeb5844adbeb1ecf0b3bbd027,

title = "DNA ternary addition",

abstract = "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.",

keywords = "Algorithm, DNA computing, DNA representation, Ternary integers",

author = "Wenxia Li and Dongmei Xiao and Lin He",

year = "2006",

month = nov,

day = "15",

doi = "10.1016/j.amc.2006.04.051",

language = "英语",

volume = "182",

pages = "977--986",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - DNA ternary addition

AU - Li, Wenxia

AU - Xiao, Dongmei

AU - He, Lin

PY - 2006/11/15

Y1 - 2006/11/15

N2 - 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.

AB - 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.

KW - Algorithm

KW - DNA computing

KW - DNA representation

KW - Ternary integers

UR - https://www.scopus.com/pages/publications/33751542163

U2 - 10.1016/j.amc.2006.04.051

DO - 10.1016/j.amc.2006.04.051

M3 - 文章

AN - SCOPUS:33751542163

SN - 0096-3003

VL - 182

SP - 977

EP - 986

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

DNA ternary addition

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this