supported by the National Natural Science Foundation of China (Grant Nos. 60373089,60674106, 30570431, 30370356, and 60773122);the Pro-gram for New Century Excellent Talents in University(Grant No. NCET-05-0612);the Ph.D. Programs Founda-tion of Ministry of Education of China (Grant No.20060487014);the Chenguang Program of Wuhan (GrantNo. 200750731262);HUST-SRF (Grant No.2007Z015A)
Recently, experiments have demonstrated that simple binary arithmetic and logical operations can be computed by the process of self- assembly of DNA tiles. In this paper, we show how the tile assembly process can be u...
the National Natural Science Foundation of China (60373089, 60674106, and 60533010);the National High Technology Research and Development "863" Program (2006AA01Z104)
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annea...
This work was supported by the National High Technology Research and Development Program (863 Program)of China (Grant No.2006AA0lZl04);the National Natural Science Foundation of China (Grant Nos. 60373089,60674106,3057043l,and 605330l01);the Program for New Century Excellent Talents in University (Grant No.NCET.05-0612);the Ph.D.Programs Foundation of Ministry of Education of China(Grant No.20060487014);the Chenguang Program of Wuhan (Grant No.20075073l262); HUST—SRF fGrant No.2007Z0l5A).
The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, ...
国家自然科学基金( the National Natural Science Foundation of China under Grant No.60373089) ;湖北省自然科学基金( the Natural Science Foundation of Hubei Province of China under Grant No.2005ABA233);浙江省自然科学基金( the Natural Science Foundation of Zhejiang Province of China under Grant No.ZJNSF- Y105654);湖北省优秀中青年科技创新团队计划
Supported by National Natural Science Foundation of China (Grant Nos 60533010 ,60373089 ,60674106);Science Foundation of Shaanxi Bu-reau of Education (Grant No 06JK202);Programfor New Century Excellent Talentsin University (No NCET-05-0612);the PhDProgramsFoundation of Ministry of Education of China (No 20060487014)
The field of DNA computing emerged in 1994 after Adleman’s paper was published. Henceforth,a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conven...
Supported by National Natural Science Foundation of China (Grant Nos 60533010 ,60373089 ,and 60674106);PhDPrograms Founda-tion of Ministry of Education of China (No 20060487014);Programfor New Century Excellent Talents in University (No NCET-05-0612)
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate...