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

^*此作品的通讯作者

数学科学学院

Shanghai Jiao Tong University

科研成果: 期刊稿件 › 文章 › 同行评审

21 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	977-986
页数	10
期刊	Applied Mathematics and Computation
卷	182
期	2
DOI	https://doi.org/10.1016/j.amc.2006.04.051
出版状态	已出版 - 15 11月 2006

访问文件

10.1016/j.amc.2006.04.051

其它文件与链接

链接到 Scopus 的出版物

引用此

@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

摘要

访问文件

其它文件与链接

指纹

引用此