Nordiana, Rajaee and Awang Ahmad Sallehin, Awang Husaini and Azham, Zulkharnain (2017) 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, 8 (12). pp. 5-8. ISSN 2289-8131
|
PDF
Comparison between Double Stranded DNA (abstract).pdf Download (297kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | DNA Computing; Bio-Inspired Computing; Boolean Matrix Multiplication; Graph Problem, unimas, university, universiti, Borneo, Malaysia, Sarawak, Kuching, Samarahan, ipta, education, research, Universiti Malaysia Sarawak |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Academic Faculties, Institutes and Centres > Faculty of Engineering Faculties, Institutes, Centres > Faculty of Engineering |
| Depositing User: | Karen Kornalius |
| Date Deposited: | 21 Feb 2017 06:08 |
| Last Modified: | 23 Aug 2023 02:49 |
| URI: | http://ir.unimas.my/id/eprint/15391 |
Actions (For repository members only: login required)
 |
View Item |
