Open Access Open Access  Restricted Access Subscription or Fee Access

Molecular Beacon DNA-Strand Optical Processor


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/irecos.v14i1.16481

Abstract


Since the emergence of DNA-based optical calculations, it is expected to develop rapidly and widely because of its tolerance, which makes it one of the most important mechanisms for researchers. It provides a strong information processing routine in the future that employs distinctive characteristics of optics, for example, with lower power consumption than conventional silicon computer. In this research, a new plan of combining two binary modified signed digit (BMSD) numbers based on three-step addition algorithm and using strands of DNA is offered. The achievement of the addition process depends on the ability of DNA strands to connect with each other based on the rule of complementarity between nucleotides (nts). According to Watson-Crick complementary rule in the two anti-parallel strands, the DNA strands have been used as gate, called molecular beacon unit (MBU), and single strands have been used as inputs. The output is obtained as a light by attaching at the ends of MBU fluorophore and quencher, the simulation for this model showing the decrease in the number of nitrogen bases used, which leads to the processing of the largest number of data with the ability to increase the length of a word, in addition to the adoption of the parallel principle of implementation. The model is designed on a mechanism which includes adder with two methods of implementation and multiplier.
Copyright © 2019 Praise Worthy Prize - All rights reserved.

Keywords


Binary Modified Signed Digit (BMSD); Conventional Method; DNA Computing; DNA-Strand; Molecular Beacon MB; Pipeline Method; Three-Step Algorithm

Full Text:

PDF


References


L. M. Adleman, Molecular Computation of Solutions to Combinatorial Problems, (1994) Science, New Series, 266 ( 5187), pp. 1021-1024.
https://doi.org/10.1126/science.7973651

L. Kari, G. Gloor and S. Yua, Using DNA to Solve the Bounded Post Correspondence Problem, (2000) Theoretical Computer Science, 231, pp. 193-203.
https://doi.org/10.1016/s0304-3975(99)00100-0

M. Ogihara and A. Ray, Simulating Boolean Circuits on a DNA Computer, (1999) Algorithmica, 25, pp. 239-250.
https://doi.org/10.1007/pl00008276

Q. Liu, L. Wang, A. G. Frutos, A. E. Condon, R. M. Corn, and L. M. Smith, DNA Computing on Surfaces, (2000) Nature, V 403, pp. 175-179.
https://doi.org/10.1038/35003155

M. R. Lakin, S. Youssef, L. Cardelli and A. Phillips, Abstractions for DNA Circuit Design, (2011) Journal of The Royal Society Interface, Vol. 9, pp. 470-486.
https://doi.org/10.1098/rsif.2011.0343

Y. Dong, C. Dong, F. Wan, J. Yang and C. Zhang, Development of DNA Computing and Information Processing Based on DNA-Strand Displacement, (2015) Science China Chemistry, 58(10), pp. 1515-1523.
https://doi.org/10.1007/s11426-015-5373-2

Y. S. Jiang, S. Bhadra, B. Li, and A. D. Ellington, Mismatches Improve the Performance of Strand-Displacement Nucleic Acid Circuits, (2014) Angewandte Communications, 53, pp. 1845-1848.
https://doi.org/10.1002/anie.201307418

N. C. Seeman, Nucleic Acid Junctions and Lattices, (1982) Journal Theor. Biol., 99, pp. 237–247.

J. Jung, D. Hyun, and Y. Shin, Physical Synthesis of DNA Circuits with Spatially Localized Gates, Proceedings of the 33rd IEEE International Conference on Computer Design (ICCD)( Page: 259–265 Year of Publication:2015 ISBN: 978-1-4673-7166-7).
https://doi.org/10.1109/iccd.2015.7357112

R. L. Petersen, M. R. Lakin and A. Phillips, A strand Graph Semantics for DNA-Based Computation, (2016) Theor Comput Sci. , 632, pp. 43–73.
https://doi.org/10.1016/j.tcs.2015.07.041

M. Jain, Computer-Aided Design for DNA Self-Assembly: Process and Applications, ( 2009) International Journal of Recent Trends in Engineering, 1(2), pp. 299-303.

C. Pistol, V. Mao, V. Thusu, A. R. Lebeck and C. Dwyer, Encoded Multichromophore Response for Simultaneous Label-Free Detection, ( 2010) Small, 6(7), pp. 843–850.
https://doi.org/10.1002/smll.200901996

J. Panga, A. R. Lebeck, C.L. Dwyer, Modeling and Simulation of a Nanoscale Optical Computing System,( 2014) J. Parallel Distrib. Comput, 74, pp. 2470-2483.
https://doi.org/10.1016/j.jpdc.2013.07.006

C. LaBoda, H. Duschl, and C. L. Dwyer, DNA-Enabled Integrated Molecular Systems for Computation and Sensing, ( 2014) Accounts of Chemical Research, 47, pp. 1816-1824.
https://doi.org/10.1021/ar500054u

W. Li, F. Zhang, H. Yan, and Y. Liu, DNA Based Arithmetic Function: a Half Adder Based on DNA Strand Displacement, (2016) Nanoscale, 8(6), pp. 3775-3784.
https://doi.org/10.1039/c5nr08497k

K. Boruah and J. Ch. Dutta, DNA Computing Models for Boolean Circuits and Logic Gates, Proceedings of the IEEE International Conference on Computational Intelligence & Communication Technology (Page: 529-533 Year of Publication: 2015 ISBN: 978-1-4799-6023-1).
https://doi.org/10.1109/cict.2015.105

Ch. M. Gearheart, E. C. Rouchka and B. Arazi, DNA-Based Dynamic Logic Circuitry, Proceedings of the 53rd IEEE International Midwest Symposium on Circuits and Systems (Page: 248-251 Year of Publication: 2010 ISBN: 978-1-4244-7773-9).
https://doi.org/10.1109/mwscas.2010.5548656

Alaa A. Al-Saffar and Qabeela Q. Thabit, Optical Computing for A Three-Step Binary Modified Signed-Digit Addition Using DNA, Fourth International Conference on Computational Science and Technology, Kuala Lumpur, Malaysia, 29-30, Nov.2017.

Alaa A. Al-Saffar and Qabeela Q. Thabit, Simulation of Nanoscale Optical Signed Digit Addition Based on DNA-Strands, Proceedings of the International Conference On Advanced Science And Engineering (ICOASE), (Page: 128-133 Year of Publication: 2018 ISBN: 978-1-5386-6696-8).
https://doi.org/10.1109/icoase.2018.8548926

M. Amos, G. Paun, G. Rozenberg, and A. Salomaa, Topics in the Theory of DNA Computing, (2002) Theoretical Computer Science, 287, pp. 3-38.
https://doi.org/10.1016/s0304-3975(02)00134-2

A. Srivastava, V. Pandey, Inconsistency in DNA computing and It’s used in Cryptography, Proceedings of the 3rd IEEE International Advance Computing Conference (IACC), (Page: 769-774 Year of Publication: 2013 ISBN: 978-1-4673-4529-3).
https://doi.org/10.1109/iadcc.2013.6514324

A. Sarker, T. Ahmed, S. M. M. Rashid, S. Anwar, L. Jaman, N. Tara, Md, M. Alam, and H. Md. H. Babu, Realization of reversible logic in DNA computing, Proceedings of the 11th IEEE International Conference on Bioinformatics and Bioengineering (Page: 261-265 Year of Publication: 2011 ISBN: 978-1-61284-975-1).
https://doi.org/10.1109/bibe.2011.46

R. S. Fyath, A. A. W. Alsaffar and M. S. Alam, Nonrecoded trinary signed-digit multiplication based on digit grouping and pixel assignment,(2004) Opt. Comm., 230 pp.35-44.
https://doi.org/10.1016/j.optcom.2003.11.038

C. Yang, C.Hsu and Y. Chuang, Molecular Beacon Based Half Adder and Half Subtractor, (2012) Chem. Commun., 48, pp. 112–114.
https://doi.org/10.1039/c1cc14518e

H. He, J. Peng, Y. Liu, X. Wang, and K. Song, Research and Design of A MSD Adder of Ternary Optical Computer, (2011) Springer- V ICAIC-228, pp. 413-420.

G. K. Maity, S. P. Maity, and J.N.Roy, MZI Based Modified Trinary Number System,(2012) Science Direct, 4, pp. 297-302.
https://doi.org/10.1016/j.protcy.2012.05.045

N. Takagi, H. Yasuura and S. Yajima, High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree,(1985) IEEE Transactions on Computers, 34(9), pp. 789-796.
https://doi.org/10.1109/tc.1985.1676634

A. Persson and L. Bengtsson, Forward and Reverse Converters and Moduli Set Selection in Signed-Digit Residue Number Systems, (2009) Journal Sign Processing Systems, 56, pp. 1-15.
https://doi.org/10.1007/s11265-008-0249-8

A. Omondi, Residue Number Systems Theory and Implementation, (Imperial College Press,2007).

Y. Jin, X. Wang, J. Peng, M. Li, Z. Shen and S. Yang, Vector-Matrix Multiplication in Ternary Optical Computer, (2012) International Journal of Numerical Analysis And Modelling, 9(2), pp. 401-409.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize