DNA Computing Adopting DNA Coding Method for NP-complete Problems

Abstract

DNA computing suggests the potential of DNA with immense parallelism and huge storage capacity by solving NPcomplete problems such as the Traveling Salesman Problem (TSP). If DNA computing is used to solve TSP, however, weights between vertexes in sequence design cannot be encoded effectively. This study proposes an algorithm for code optimization (ACO… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics