A CONSTANT TIME ALGORITHM FOR DNA ADD
Abstract
We present a new molecular algorithm for adding two binary numbers with n bits. Without considering the generation of input, this algorithm can be performed in O(1) in a test tube using O(n) different types of DNA strands, and the output can be detected in O(n). The output strands, prior to read out operation, can serve as the input strands for another round of addition. The algorithm can be easily extended to any other logical operation, and even for adding two decimal numbers.
This research was partially supported by University of Tehran.
Remember to check out the Most Cited Articles! |
---|
Check out these Handbooks in Computer Science |