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

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

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	5-8
Number of pages	4
Journal	Journal of Telecommunication, Electronic and Computer Engineering
Volume	8
Issue number	12
Publication status	Published - 2016
Externally published	Yes

Keywords

Bio-inspired computing
Boolean matrix multiplication
DNA computing
Graph problem

ASJC Scopus subject areas

Hardware and Architecture
Computer Networks and Communications
Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Comparison between double stranded DNA with restriction enzymes and single stranded DNA with primers for solving boolean matrix multiplication'. Together they form a unique fingerprint.

Cite this

Comparison between double stranded DNA with restriction enzymes and single stranded DNA with primers for solving boolean matrix multiplication. / Rajaee, Nordiana; Hussaini, Awang Ahmad Sallehin Awang; Zulkharnain, Azham.

In: Journal of Telecommunication, Electronic and Computer Engineering, Vol. 8, No. 12, 2016, p. 5-8.

Research output: Contribution to journal › Article › peer-review

@article{c57f9e076b164c87bad3a3de9cc67669,

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

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.",

keywords = "Bio-inspired computing, Boolean matrix multiplication, DNA computing, Graph problem",

author = "Nordiana Rajaee and Hussaini, {Awang Ahmad Sallehin Awang} and Azham Zulkharnain",

year = "2016",

language = "English",

volume = "8",

pages = "5--8",

journal = "Journal of Telecommunication, Electronic and Computer Engineering",

issn = "2180-1843",

publisher = "Universiti Teknikal Malaysia Melaka",

number = "12",

}

TY - JOUR

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

AU - Rajaee, Nordiana

AU - Hussaini, Awang Ahmad Sallehin Awang

AU - Zulkharnain, Azham

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Bio-inspired computing

KW - Boolean matrix multiplication

KW - DNA computing

KW - Graph problem

UR - http://www.scopus.com/inward/record.url?scp=85011340353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85011340353&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85011340353

VL - 8

SP - 5

EP - 8

JO - Journal of Telecommunication, Electronic and Computer Engineering

JF - Journal of Telecommunication, Electronic and Computer Engineering

SN - 2180-1843

IS - 12

ER -