|
|
Comparison between double stranded DNA with restriction enzymes and single stranded DNA with primers for solving boolean matrix multiplication
|
|
|
|
|
نویسنده
|
rajaee n. ,hussaini a.a.s.a. ,zulkharnain a.
|
منبع
|
journal of telecommunication, electronic and computer engineering - 2016 - دوره : 8 - شماره : 12 - صفحه:5 -8
|
چکیده
|
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.
|
کلیدواژه
|
Bio-inspired computing; Boolean matrix multiplication; DNA computing; Graph problem
|
آدرس
|
faculty of engineering,universiti malaysia sarawak,kota samarahan,sarawak, Malaysia, faculty of resource science and technology,kota samarahan,sarawak, Malaysia, faculty of resource science and technology,kota samarahan,sarawak, Malaysia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|