Abstract
Although DNA computing was rapidly discarded when researchers realized some of the drawbacks related to it, but by computer simulation of molecular reaction it may be implemented in silico by computer architectures offering massive parallelism. In this review, we describe sticker algorithm for several famous graph problem. Presented algorithms have polynomial time complexity.
Full Text
Published Version
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