DNA computing

Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing

Author(s): Xian Wu, Zhao Cai Wang, Tun Hua Wu, Xiao Guang Bao
Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing 457 373 Transactions on NanoBioscience (TNB)

The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson Problem (TSP), in which all vertices are divided into several different families, and the goal of the…

read more

Constraining DNA sequences with a triplet-bases unpaired

Author(s): Qiang Yin, Qiang Zhang, Xiaopeng Wei, Bin Wang, Xue Li, Hui Lv
Constraining DNA sequences with a triplet-bases unpaired 979 441 Transactions on NanoBioscience (TNB)

DNA computing, the combination of computer science and molecular biology, is a burgeoning research field that holds promise for many applications. The accuracy of DNA computing is determined by reliable…

read more