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) that applies DNA coding method to DNA computing in order to encode weights in TSP effectively. By applying ACO to TSP, we designed sequence more effectively than Adleman's DNA computing algorithm. Furthermore, we could find the shortest path quickly and reduce biological error rate.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
