Abstract
The volume's exponential explosion problem has been the critical factor that constraints the development of the DNA computing. For the objective to decrease the DNA volume complex of the vertex cover problem which is a famous NP-complete problem, a new DNA algorithm is advanced. The new algorithm consists of a parallel reducer, a solution generator, a dense parallel searcher, a sparse parallel searcher and a vertex cover searcher. In a computer simulation, the DNA strands of maximum number required is O(√3 n) on the condition of not varying the time complexity. Besides, this algorithm is highly space-efficient and error-tolerant compared to conventional brute-force searching, and thus can be scaled-up to solve large and hard minimum vertex cover problems.
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.
