Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 31 January 2009

DNA Code Word Design for DNA Computing with Real-Time Polymerase Chain Reaction

Muhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Mohamad Shukri Zainal Abidin, Marzuki Khalid & Nor Haniza Sarmin

Journal of Computer Science, Volume 5, Issue 1, pp. 1–10 · doi.org/10.3844/jcssp.2009.1.10

7,502 accesses4,869 downloads6 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during a computation. We have proposed a DNA computing readout method tailored specifically to HPP in DNA computing using real-time Polymerase Chain Reaction (PCR). The DNA sequences were designed based on a procedure and DNASequenceGenerator was employed to generate the sequences required for the experiment. The drawback of the previous approach is that a pool of DNA sequences need to be generated by DNASequenceGenerator before the selection is done manually, based on several design constraints. Hence, an automatic and systematic approach is needed to generate the DNA sequences based on design constraints. Approach: In this study, a generate-and-test approach was proposed for the same problem subjected to several design constraints. The generate-and-test algorithm consists of two main levels. The first level considered the basic constraints of DNA sequence design, which were melting temperature, GC-percentage, similarity, continuity, hairpin, and H-measure. This was followed by the second level that includes specific constraints formulated based on five rules, which had been used in previous study. A generated sequence was chosen only if the sequence satisfies all the basic and specific constraints. Results: Sequences designed by generate-and-test approach have higher H-measure value than sequences generated by DNASequenceGenerator. However, the generated sequences show lower value for similarity as well as for additional constraints compared to sequences designed by DNASequenceGenerator. Conclusion: The generated DNA sequences were better compared to the sequences, obtained from DNASequenceGenerator.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Saaid, M. F. M., Ibrahim, Z., Abidin, M. S. Z., Khalid, M. & Sarmin, N. H. (2009). DNA Code Word Design for DNA Computing with Real-Time Polymerase Chain Reaction . Journal of Computer Science, 5(1), 1–10. https://doi.org/10.3844/jcssp.2009.1.10

Licence
© Science Publications
Issue
Volume 5, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
DNA Code Word Design for DNA Computing with Real-Time Polymerase Chain ReactionJournal of Computer Science · Volume 5, Issue 1 · pp. 1–10 · © Science PublicationsDownload