A Model in κ for DNA Addition

  • Authors:
  • Xian Xu;Xiaoju Dong;Yuxi Fu

  • Affiliations:
  • BASICS, Department of Computer Science and Technology, Shanghai Jiao Tong University, 1954 Hua Shan Road(200030), Shanghai, P.R. China;BASICS, Department of Computer Science and Technology, Shanghai Jiao Tong University, 1954 Hua Shan Road(200030), Shanghai, P.R. China;BASICS, Department of Computer Science and Technology, Shanghai Jiao Tong University, 1954 Hua Shan Road(200030), Shanghai, P.R. China

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

DNA computing is a hot research topic in recent years. Formalization and verification using theories(@p-calculus, bioambients, @k-calculus and etc.) in Computer Science attract attention because it can help prove and predict to a certian degree various kinds of biological processes. Combining these two aspects, formal methods can be used to verify algorithms in DNA computing, including basic arithmetic operations if they are to be included in a DNA chip. In this paper, we first introduce a newly-designed algorithm for solving binary addition with DNA, which contributes to a unit in DNA computer processor, and then formalize the algorithm in @k-calculus(a formal method well suited for describing protein interactions) to show the correctness of it in a sense, and a sensible example is provided. Finally, some discussion on the described model is made, in addition to a few possible future improvement directions.