CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Efficient Algorithm for Constructing DNA Boolean Circuit

by Michael Arock, R.Ponalagusamy, B.S.E.Zoraida
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 22
Year of Publication: 2010
Authors: Michael Arock, R.Ponalagusamy, B.S.E.Zoraida
10.5120/524-684

Michael Arock, R.Ponalagusamy, B.S.E.Zoraida . An Efficient Algorithm for Constructing DNA Boolean Circuit. International Journal of Computer Applications. 1, 22 ( February 2010), 14-19. DOI=10.5120/524-684

@article{ 10.5120/524-684,
author = { Michael Arock, R.Ponalagusamy, B.S.E.Zoraida },
title = { An Efficient Algorithm for Constructing DNA Boolean Circuit },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 22 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 14-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number22/524-684/ },
doi = { 10.5120/524-684 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:47:44.257380+05:30
%A Michael Arock
%A R.Ponalagusamy
%A B.S.E.Zoraida
%T An Efficient Algorithm for Constructing DNA Boolean Circuit
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 22
%P 14-19
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Computation using biological Deoxyribonucleic acid (DNA) strand is increasingly found to be a viable proposition. A unique generalized efficient algorithm for forming any Boolean circuit strand is proposed in this paper. The implementation of the Boolean circuit using the proposed algorithm is also presented. This Boolean circuit requires only one kind of bio-operation at each level. Further, this paper adopts a uniform representation for logical 0 and 1 for all Boolean circuit. Simulation to validate the efficient algorithm is also presented in this work.

References
  1. Adleman, L., 1994. Molecular computation of solutions to combinatorial problems.Science 266, 1021–1029.
  2. Ahrabian, H., Ganjtabesh, M. and Nowzari-Dalini, A., 2005. DNA algorithm for an unbounded fan-in Boolean circuit. Biosystems 82, 52–60.
  3. Ahrabian, H. and Nowzari-Dalini, A., 2004. DNA simulation of NAND circuits. AMO Advanced Modeling and Optimization 6, 2.
  4. Erk, K., 1999. Simulating Boolean circuits by finite splicing. In: Proceedings of the Congress on Evolutionary Computation, vol. 2. IEEE Press, 1279–1285.
  5. Fang, X., Liu, X., Schuster, S. and Tan, W., 1999. Designing a novel molecular beacon for surface-immobilized DNA hybridization studies. Journal of the American chemical Society 121 (12), 2921–2922.
  6. Jianzhong, C., Zhixiang, Y., Wei, W., XiaoHong, S. and Linqiang, P., 2006. Towards reliable simulation of bounded fan-in Boolean circuits using molecular beacon. In: Proceedings of the World Congress on Intelligent Control and Automation, IEEE, Dalian, China, 3910–3914.
  7. Liu, Q.,Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M., Smith, L.M., 2000. DNA computing on surfaces. Nature 403, 175–179.
  8. Liu, W., Shi, X., Zhang, S., Liu, X., Xu, J., 2005. A new DNA computing model for the NAND gate based on induced hairpin formation. Biosystems 77, 92–97.
  9. Mulawka, J.J.,Wasiewicz, P., Plucienniczak, A., 1999. Another logical molecular NAND gate system. In: Proceedings of the Seventh International Conference on microelectronics for Neural, Fuzzy and Bio-Inspired Systems, Granada, Spain, 340–346.
  10. Ogihara, M., Ray, A., 1998. DNA-based self-propagating algorithm for solving bounded-fan-in Boolean circuit. In: Proceedings of the Third Conference on Genetic Programming. Morgan Kaufman Publisher, San Francisco, . 725–730.
  11. Ogihara, M., Ray, A., 1999. Simulating Boolean circuits on a DNA computers. Algorithmica 25, 239–250.
  12. Rothemund, P., 1996. A DNA and restriction enzyme implementation of Turing machines. In: DIMACS Series, Proceedings of a DIMAC Workshop, AMS 27, pp. 75–119.
  13. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund, P., Adleman, L., 1998. A sticker based model for DNA computation. Journal of Computational Biology 5 (4), 615–629.
  14. Su, X., Smith, L.M., 2004.Demonstration of a universal surface DNA computer. Nucleic Acids Research 32 (10), 3115–3123.
  15. Tyagi, S., Kramer, F.R., 1996. Molecular beacon: probes that fluorescence upon hybridization. Nature Biotechnology 14, 303–308.
  16. Wang, L., Liu, Q., Frutos, A., Gillmor, S., Thiel, A., Strother, T., Condon, A., Corn, R., Lagally, M., Smith, L., 1999. Surface-based DNA computing operations: destroy and readout. Biosystems 52 (1), 189–191.
  17. Zoraida, B.S.E., Arock, M., Ronald, B.S.M. and Ponalagusamy, R., 2009. A novel generalized design methodology and realization of Boolean operations using DNA, Biosystems, vol.97, pp.146-153.
  18. Zoraida, B.S.E., Arock, M., Ronald, B.S.M. and Ponalagusamy, R., 2008. A novel generalized model for constructing reusable and reliable logic gates using DNA. In: Proceedings of the Fourth International Conference on Natural Computing, vol. 7. IEEE Press, China, pp. 353–357.
Index Terms

Computer Science
Information Sciences

Keywords

Boolean circuit DNA computing Truth table Traffic light signaling Graph

Powered by PhDFocusTM