作者: Rana Barua , Janardan Misra
关键词: Binary logarithm 、 Feature (linguistics) 、 Structure (mathematical logic) 、 DNA computing 、 Cryptography 、 Binary number 、 Boolean circuit 、 Algorithm 、 Type (model theory) 、 Mathematics
摘要: We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of strands, where n is the size string representing largest numbers. The salient feature our technique that input strands and output have exactly same structure makes it fully procedural unlike most methods proposed so far. Logical operations can easily be performed by method hence used cryptographic purpose.