Comparison between Double Stranded DNA with Restriction Enzymes and Single Stranded DNA with Primers for Solving Boolean Matrix Multiplication

Authors

  • Nordiana Rajaee Faculty of Engineering, Universiti Malaysia Sarawak, 94300 Kota Samarahan, Sarawak, Malaysia
  • Awang Ahmad Sallehin Awang Hussaini Faculty of Resource Science and Technology, 94300 Kota Samarahan, Sarawak, Malaysia.
  • Azham Zulkharnain Faculty of Resource Science and Technology, 94300 Kota Samarahan, Sarawak, Malaysia.

Keywords:

DNA Computing, Bio-Inspired Computing, Boolean Matrix Multiplication, Graph Problem

Abstract

Boolean matrix multiplication is the basis for most computing algorithms and is widely used in many fields.  In this paper, we compare and discuss two methods to solve Boolean matrix multiplication with DNA computing.  The first method utilizes double stranded DNA sequences with Restriction Enzymes meanwhile the second method utilizes single stranded DNA sequences with primers.  We prove that while both methods are able to solve the Boolean matrix multiplication problem, these two methods differ in their performance and output results.  We compare the advantages of the latter method in terms of easier sequence designs and more efficient analysis of results.

References

R. Agrawal, F. Gustavson, M. Zubair, A high performance matrix multiplication algorithm on distributed memory parallel computer using overlapped communication, IBM Journal of Research and Development, 38, 6, 673-681 (1994)

J. Watada, RA. Bakar, DNA computing and its applications, Proc 8th International Conference on Intelligent Systems Design and Applications, 288 – 294 (2008)

L. Adleman, Molecular computation of solutions to combinatorial problem, Science, 266, 1021 – 1024 (1994)

JS. Oliver, Matrix multiplication with DNA. J Mol. Evo 45, 161 – 167 (1997)

M. Amos, Theoretical and Experimental DNA Computation, Natural Computing Series. Springer (2004)

N. Rajaee, Y. Kon, K. Yabe, O. Ono, Matrix multiplication with DNA based computing: A comparison study between hybridization-ligation and parallel overlap assembly, Proc of the 4th IEEE International Conference on Natural Computation, 527 – 530 (2008)

Z. Ibrahim, Y. Tsuboi, O. Ono, Hybridization-Ligation vs Parallel Overlap Assembly: An experimental comparison of initial pool generation for direct proportional length based DNA computing, IEEE Transactions on Nanobioscience, 5, 103 – 109 (2006)

NK Khalid, Z. Ibrahim, TB Kurniawan, M. Khalid, NH Sarmin, Function minimization in DNA sequence design based on continuous particle swarm optimization, ICIC Express Letters, 3, 1, 27 – 32 (2009)

CC. Chang, T. Lu, YF. Chang, CT. Lee, Reversible data hiding schemes for deoxyribonucleic acid (DNA) medium, International Journal of Innovative Computing, Information and Control, 3, 5, 1145 – 1160 (2007)

Downloads

Published

2016-12-01

How to Cite

Rajaee, N., Awang Hussaini, A. A. S., & Zulkharnain, A. (2016). Comparison between Double Stranded DNA with Restriction Enzymes and Single Stranded DNA with Primers for Solving Boolean Matrix Multiplication. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 8(12), 5–8. Retrieved from https://jtec.utem.edu.my/jtec/article/view/1427

Similar Articles

You may also start an advanced similarity search for this article.