Abstract—The massive parallel computing capabilities of
DNA computing is extremely attractive for solving matrices
problems with large data sets such as in network fault
monitoring, data mining and social studies. However, the design
and strategy to encode these problems into DNA sequences for
computation still proves a hurdle as DNA computing is a
wet-lab process highly dependent on bio-molecular tools.
Various designs, strategy and tools give different advantages,
limitations and affects the performance of the computation
including extractions of results. In this paper, we study the
utilization of restriction enzymes as row/column indicators for
matrices problem with DNA computing. We model and propose
steps to compute Boolean matrices and discuss highlights,
drawbacks and applicability of the restriction enzymes during
the encoding of the problems in DNA computing. In general, the
utilization of restriction enzymes enables information to be
tagged directly to the DNA sequences. However, due to the
cutting reactions, the formed path cannot be utilized as weight
or distance.
Index Terms—DNA computing, evolutionary computing,
restriction enzymes, Boolean matrices.
N. Rajaee, K. Hong Ping, A. Lit, D. N. S. A. Salleh, N. Liang Yew are
with Faculty of Engineering, Universiti Malaysia Sarawak, 94300 Kota
Samarahan, Sarawak, Malaysia (e-mail: {rnordiana, hpkismet, lasrani,
asdnsdharmiza, ngliangy}@feng.unimas.my).
[PDF]
Cite:Nordiana Rajaee, Kismet Hong Ping, Asrani Lit, Dyg Nur Salmi Dharmiza Awg Salleh, and Liang Yew Ng, "Constructing Boolean Matrices with Restriction Enzymes as Row/Column Indicators in DNA Computing," International Journal of Computer Theory and Engineering vol. 7, no. 4, pp. 306-310, 2015.
