Abstract
DNA computing is widely used in complex NP-complete problems, such as the optimal portfolio problem, the optimum path search problem. DNA computing, having the characteristics of high parallelism, huge storage capacity and low energy loss, is very suitable for solving complex combinatorial problems. The maximal connected subgraph problem aims to find a connected vertex subset with maximal number of vertices in a simple undirected graph. Using biological computing technology, we give a new DNA algorithm to solve the maximal connected subgraphs problem with O(n) time complexity, which can significantly reduce the complexity of computing compared with the previous algorithms.
Sign-in/Register to access full text options 
Free) 
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 call
