supported by the National Natural Science Foundation of China (Grant Nos. 60533010, 30670540,60874036 and 60503002);the National High-Tech Research & Development Program of China (Grant No.2006AA01Z104);the Ph.D. Programs Foundation of the Ministry of Education of China (Grant No. 20070001020);the Postdoctoral Science Foundation of China (Grant No. 20060400344)
A novel DNA-based model is developed to calculate NP-complete problems, which is made of circular DNA molecules, streptavidin-coated magnetic beads and DNA circligase. To test the feasibility of the model, we apply it...
The authors sincerely acknowledge the anonymous referee’s suggestions to this paper. This work was supported by the National Natural Science Foundation of China (Grant Nos. 60533010, 30670540, 60874036 and 60503002);National High-Tech Research and Development Program of China (Grant No. 2006AA01Z104);Ph.D. Programs Foundation of the Ministry of Education of China (Grant No. 20070001020);the Postdoctoral Science Foundation of China (Grant No. 20060400344)
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 m-...