Journal
CHINESE SCIENCE BULLETIN
Volume 55, Issue 9, Pages 890-896Publisher
SCIENCE PRESS
DOI: 10.1007/s11434-009-0608-2
Keywords
NP-complete problem; reverse PCR; linear ssDNA circularization; DNA length reducing
Categories
Funding
- National Natural Science Foundation of China [60533010, 30670540, 60874036 and 60503002]
- National High-Tech Research and Development Program of China [2006AA01Z104]
- Ph.D. Programs Foundation of the Ministry of Education of China [20070001020]
- Post-doctoral Science Foundation of China [20060400344]
Ask authors/readers for more resources
In this paper, a new molecular computing model is developed to solve the maximum independent set problem, based on the method of DNA length reducing. To solve the maximum independent set problem with n-vertices and in-edges, the time complexity is O(n+m). With the enlargement of the problem scale, the numbers of the required tubes will increase linearly. Two important methods in this experiment are single strand DNA (ssDNA) circularization and DNA length reducing. In addition, using reverse polymerase chain reaction (PCR) and circligase, the structure of DNA molecules is changed in each computing step, transforming from linear double strand DNA (dsDNA) to linear ssDNA and circular ssDNA. Using the circular DNA structure, the recombination among DNA molecules is avoided. To verify this computing model, a small maximum independent set problem was solved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available