Transactions on NanoBioscience
Articles
Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing
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 problem is to find a loop that concatenates a specified...
Read more
Posted on 8 SEP 2021
Featured Articles
Constraining DNA sequences with a triplet-bases unpaired
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 DNA sequences, the quality of which affects the accuracy of...
Read more
Posted on 10 MAR 2020