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 Jan 1 |
| Externally published | Yes |
Fingerprint
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
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; Bin Zulkharnain, Azham.
In: Journal of Telecommunication, Electronic and Computer Engineering, Vol. 8, No. 12, 01.01.2016, p. 5-8.Research output: Contribution to journal › Article
}
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 - Bin Zulkharnain, Azham
PY - 2016/1/1
Y1 - 2016/1/1
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 -