title: Solving the fully-connected 15-city TSP using probabilistic DNA computing.
abstract: Implementation of DNA computers has lagged behind the theoretical advances due to several technical limitations. These limitations include the amount of DNA required, the efficiency and accuracy of methods to generate and purify answers, and the lack of a reliable method to read the answer. Here we show how to perform calculations using a reasonable amount of DNA with greater efficiency and accuracy and a new readout method that was used to successfully solve a problem with 15 vertices and 210 edges, the largest problem ever solved with DNA. These advances will provide new opportunities for DNA computing to perform practical computations that utilize the massively parallel nature of DNA hybridization.
authors.affiliation: School of Life Sciences, Arizona State University, P.O. Box 874501, Tempe, AZ 85287-4501, USA.
authors.forename: Fusheng
authors.initials: F
authors.lastname: Xiong
authors.forename: David
authors.initials: D
authors.lastname: Spetzler
authors.forename: Wayne D
authors.initials: WD
authors.lastname: Frasch
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D039301:Computers, Molecular; D003661:Decision Support Techniques; D005716:Game Theory; D015233:Models, Statistical