Skip to content
2000
Volume 6, Issue 3
  • ISSN: 1573-4137
  • E-ISSN: 1875-6786

Abstract

A novel molecular computing model based on circular DNA was developed to solve a 3-coloring graph problem. This computing model uses circular DNA and works as to dial a number. The method of selecting true solutions is similar to dialing on a telephone. Moreover, the key methods in this model were circularization of single single-strand DNA (ssDNA) molecules and a backtracking deletion algorithm. In the course of computing, the structure of the DNA molecule was transformed into linear double-strand DNA (dsDNA), linear ssDNA, and circular ssDNA. For a 3-coloring graph problem with n vertices, the algorithm time complexity and the space complexity are both O(n2) at most. The computing achievement by this model indicates that circular DNA has extensive applications in molecular computing research.

Loading

Article metrics loading...

/content/journals/cnano/10.2174/157341310791171072
2010-06-01
2025-09-21
Loading full text...

Full text loading...

/content/journals/cnano/10.2174/157341310791171072
Loading

  • Article Type:
    Research Article
Keyword(s): 3-coloring graph problem; algorithm complexity; backtracking; Circular DNA
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test