Procedure for Multiplication Based on DNA Computing

DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations. In this paper, we describe a procedure for multiplication of a pair of two binary numbers. The procedure mainly consist of bit-shift and addition operations that depends on the bit position of 1’s in the multiplier and finally addition operations which take place simultaneously in each steps. The above method takes O(1) time in the best case which exists when each bit of multiplier is zero. The time complexity of proposed algorithm is O(n) for average and worst case and the space complexity of proposed algorithm is O(n) for average case, worst case and best case.