Comparison between double stranded DNA with restriction enzymes and single stranded DNA with primers for solving boolean matrix multiplication

Nordiana Rajaee, Awang Ahmad Sallehin Awang Hussaini, Azham Zulkharnain

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)5-8
ページ数4
ジャーナルJournal of Telecommunication, Electronic and Computer Engineering
8
12
出版ステータスPublished - 2016
外部発表はい

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「Comparison between double stranded DNA with restriction enzymes and single stranded DNA with primers for solving boolean matrix multiplication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル