{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:55:10Z","timestamp":1754157310609,"version":"3.41.2"},"reference-count":37,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6,1]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this study is to develop a Turing machine or a finite automaton, which scans the input data tape in the form of DNA sequences and inspires the basic design of a DNA computer.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>This model based on a splicing system can solve fuzzy reasoning autonomously by using DNA sequences and human assisted protocols. Its hardware consists of class IIS restriction enzyme and T4 DNA ligase while the software consists of double stranded DNA sequences and transition molecules which are capable of encoding fuzzy rules. Upon mixing solutions containing these components, the automaton undergoes a cascade of cleaving and splicing cycles to produce the computational result in form of double stranded DNA sequence representing automaton's final state.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>In this work, the authors have fused the idea of a splicing system with the automata theory to develop fuzzy molecular automaton in which 1,018 processors can work in parallel, requiring a trillion times less space for information storage, is 105 times faster than the existing super computer and 1,019 power operations can be performed using one Joule of energy.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This paper presents a generalized model for biologically inspired computation in nano scale.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17563781211231543","type":"journal-article","created":{"date-parts":[[2012,6,3]],"date-time":"2012-06-03T05:51:24Z","timestamp":1338702684000},"page":"206-225","source":"Crossref","is-referenced-by-count":1,"title":["Splicing operation and fuzzy molecular automaton"],"prefix":"10.1108","volume":"5","author":[{"given":"Kumar S.","family":"Ray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mandrita","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022012720113221100_b1","doi-asserted-by":"crossref","unstructured":"Adleman, L. (1994), \u201cMolecular computation of solutions to combinatorial problems\u201d, Science, Vol. 266, pp. 1021\u20104.","DOI":"10.1126\/science.7973651"},{"key":"key2022012720113221100_b2","doi-asserted-by":"crossref","unstructured":"Adleman, L. (1995), \u201cOn constructing a molecular computer\u201d, available at: ftp:\/\/usc.edu\/pub\/csinfo\/papers\/adleman.","DOI":"10.1090\/dimacs\/027\/01"},{"key":"key2022012720113221100_b3","unstructured":"Adleman, L., Rothemund, P., Roweis, S. and Winfree, E. (1996), \u201cOn applying molecular computation to the data encryption standard\u201d, 2nd DIMACS Workshop on DNA Based Computers, Princeton, NJ, pp. 28\u201048."},{"key":"key2022012720113221100_b5","doi-asserted-by":"crossref","unstructured":"Beaver, D. (1995), \u201cComputing with DNA\u201d, Journal of Computational Biology, Vol. 2 No. 1, pp. 1\u20107.","DOI":"10.1089\/cmb.1995.2.1"},{"key":"key2022012720113221100_b6","doi-asserted-by":"crossref","unstructured":"Bennett, C.H. (1982), \u201cThe thermodynamics of computation \u2013 a review\u201d, International Journal of Theoretical Physics, Vol. 21 No. 12, pp. 905\u201040.","DOI":"10.1007\/BF02084158"},{"key":"key2022012720113221100_b9","doi-asserted-by":"crossref","unstructured":"Faulhammer, D., Cukras, A.R., Lipton, R.J. and Landweber, L.F. (2000), \u201cMolecular computation: RNA solutions to chess problems\u201d, Proc. Natl Acad. Sci. USA, Vol. 97 No. 4, pp. 1385\u20109.","DOI":"10.1073\/pnas.97.4.1385"},{"key":"key2022012720113221100_b10","doi-asserted-by":"crossref","unstructured":"Garzon, M. et al. (1998), Automata Implementation, Lecture Notes in Computer Science, Wood, D. and Yu, S. (Eds), Vol. 1436, Springer, Berlin, pp. 56\u201074.","DOI":"10.1007\/BFb0031381"},{"key":"key2022012720113221100_b11","doi-asserted-by":"crossref","unstructured":"Hartemink, A.J., Gifford, D.K. and Khodor, J. (1999), \u201cAutomated constraint\u2010based nucleotide sequence selection for DNA computation\u201d, Biosystems, Vol. 52, pp. 227\u201035.","DOI":"10.1016\/S0303-2647(99)00050-7"},{"key":"key2022012720113221100_b12","unstructured":"Hartmanis, J. (1995), \u201cOn the weight of computations\u201d, Bulletin of the European Association of Theoretical Computer Science, Vol. 55, pp. 136\u20108."},{"key":"key2022012720113221100_b13","doi-asserted-by":"crossref","unstructured":"Head, T. (1987), \u201cFormal language theory and DNA: an analysis of the generative capacity of recombinant behaviors\u201d, Bulletin of Mathematical Biology, Vol. 49, pp. 737\u201059.","DOI":"10.1016\/S0092-8240(87)90018-8"},{"key":"key2022012720113221100_b14","unstructured":"Head, T. (1998), \u201cHamiltonian paths and double stranded DNA\u201d, in Paun, G.H. (Ed.), Computing with Bio\u2010molecules; Theory and Experiments, Springer, Berlin, pp. 80\u201092."},{"key":"key2022012720113221100_b16","doi-asserted-by":"crossref","unstructured":"Head, T., Pixton, D. and Goode, E. (2003), Splicing System: Regularity and Below, Lecture Notes in Computer Science, Vol. 2568\/2003, Springer, Berlin, pp. 262\u20108.","DOI":"10.1007\/3-540-36440-4_23"},{"key":"key2022012720113221100_b15","doi-asserted-by":"crossref","unstructured":"Head, T., Antoniou, I., Calude, C.S. and Dineen, M.J. (2001), \u201cSplicing systems, aqueous computing, and beyond\u201d, Unconventional Models of Computation UMC'2K, Springer, London, pp. 68\u201084.","DOI":"10.1007\/978-1-4471-0313-4_5"},{"key":"key2022012720113221100_b17","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R. and Ullman, J.D. (2000), Introduction to Automata Theory, Languages and Computation, 2nd ed., Addison\u2010Wesley, Boston, MA.","DOI":"10.1145\/568438.568455"},{"key":"key2022012720113221100_b19","doi-asserted-by":"crossref","unstructured":"Khodor, J. and Giffird, D.K. (1999), \u201cDesign and implementation of computational systems based on programmed mutagenesis\u201d, Biosystems, Vol. 52, pp. 93\u20107.","DOI":"10.1016\/S0303-2647(99)00036-2"},{"key":"key2022012720113221100_b20","unstructured":"Kurtz, S., Mahaney, S., Royer, J. and Simon, J. (1996), \u201cActive transport in biological computing\u201d, 2nd DIMACS Workshop on DNA Based Computers, Princeton, NJ, pp. 111\u201021."},{"key":"key2022012720113221100_b21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J. (1995), \u201cDNA solution of hard computational problems\u201d, Science, Vol. 268, pp. 542\u20105.","DOI":"10.1126\/science.7725098"},{"key":"key2022012720113221100_b22","unstructured":"Lipton, R.J., Landweber, L.F. and Rabin, M.O. (1997), \u201cDNA based computers III\u201d, in Rubin, H. and Wood, D.H. (Eds), DIMACS Workshop, University of Pennsylvania, June 23\u201027, American Mathematical Society, Providence, RI, pp. 161\u201072."},{"key":"key2022012720113221100_b23","doi-asserted-by":"crossref","unstructured":"Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M. and Smith, L.M. (2000), \u201cDNA computing on surfaces\u201d, Nature, Vol. 403, pp. 175\u20109.","DOI":"10.1038\/35003155"},{"key":"key2022012720113221100_b24","doi-asserted-by":"crossref","unstructured":"Mao, C., LaBean, T.H., Reif, J.H. and Seeman, N.C. (2000), \u201cLogical computation using algorithmic self\u2010assembly of DNA triple\u2010crossover molecules\u201d, Nature, Vol. 407, pp. 493\u20106.","DOI":"10.1038\/35035038"},{"key":"key2022012720113221100_b25","doi-asserted-by":"crossref","unstructured":"Ouyang, Q., Kaplan, P.D., Liu, S. and Libchaber, A. (1997), \u201cDNA solution of the maximal clique problem\u201d, Science, Vol. 278 No. 5337, pp. 446\u20109.","DOI":"10.1126\/science.278.5337.446"},{"key":"key2022012720113221100_b26","doi-asserted-by":"crossref","unstructured":"Ray, K.S. and Chatterjee, P. (2010), \u201cApproximate reasoning on a DNA\u2010chip\u201d, International Journal of Intelligent Computing and Cybernetics, Vol. 3 No. 3, pp. 514\u201053.","DOI":"10.1108\/17563781011066756"},{"key":"key2022012720113221100_b27","doi-asserted-by":"crossref","unstructured":"Ray, K.S. and Mondal, M. (2010), \u201cSimilarity\u2010based fuzzy reasoning by DNA computing\u201d, International Journal of Bio\u2010inspired Computation, Vol. 3 No. 2, pp. 112\u201022.","DOI":"10.1504\/IJBIC.2011.039910"},{"key":"key2022012720113221100_b29","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K. (1995), DNA Based Computers: Proceedings of the DIMACS Workshop, April 4, Princeton University, Lipton, R.J. and Baum, E.B. (Eds), American Mathematical Society, Providence, RI, 1996, pp. 75\u2010119.","DOI":"10.1090\/dimacs\/027\/06"},{"key":"key2022012720113221100_b30","doi-asserted-by":"crossref","unstructured":"Ruben, A.J. and Landweber, L.F. (2000), \u201cThe past, present and future of molecular computing\u201d, Nature Rev. Mol. Cell Biol., Vol. 1, pp. 69\u201072.","DOI":"10.1038\/35036086"},{"key":"key2022012720113221100_b31","doi-asserted-by":"crossref","unstructured":"Sakamoto, K., Kiga, D., Komiya, K., Gouzu, H., Yokoyama, S., Ikeda, S., Sugiyama, H. and Hagiya, M. (1999), \u201cState transition by molecules\u201d, Biosystems, Vol. 52, pp. 81\u201091.","DOI":"10.1016\/S0303-2647(99)00035-0"},{"key":"key2022012720113221100_b32","unstructured":"Shapiro, E. and Karunaratne, K.S.G. (2001), \u201cMethod and system of computing similar to a Turing machine\u201d, US Patent 6,266,569."},{"key":"key2022012720113221100_b33","unstructured":"Smith, W.D. (1995), DNA Based Computers: Proceedings of the DIMACS Workshop, April 4, Princeton University, Lipton, R.J. and Baum, E.B. (Eds), American Mathematical Society, Providence, RI,, 1996, pp. 121\u201085."},{"key":"key2022012720113221100_b34","unstructured":"Turing, A.M. (1936), \u201cOn computable numbers, with an application to the Entcheidungproblem\u201d, Proc. Lond. Math. Soc. II Ser., Vol. 42, pp. 230\u201065."},{"key":"key2022012720113221100_b36","doi-asserted-by":"crossref","unstructured":"Winfree, E., Liu, F.R., Wenzler, L.A. and Seeman, N.C. (1998), \u201cDesign and self\u2010assembly of two\u2010dimensional DNA crystals\u201d, Nature, Vol. 394 No. 6693, pp. 539\u201044.","DOI":"10.1038\/28998"},{"key":"key2022012720113221100_frd1","doi-asserted-by":"crossref","unstructured":"Akerkar, R. and Sajja, P.S. (2009), \u201cBio\u2010inspired computing: constituents and challenges\u201d, International Journal of Bio\u2010inspired Computation, Vol. 1 No. 3, pp. 135\u201050.","DOI":"10.1504\/IJBIC.2009.023810"},{"key":"key2022012720113221100_frd2","doi-asserted-by":"crossref","unstructured":"Chang, W.\u2010L. (2007), \u201cFast parallel DNA\u2010based algorithms for molecular computation: the set\u2010partition problem\u201d, IEEE Transactions on Nanobioscience, Vol. 6 No. 1, pp. 346\u201053.","DOI":"10.1109\/TNB.2007.909012"},{"key":"key2022012720113221100_frd3","doi-asserted-by":"crossref","unstructured":"Chang, W.\u2010L., Ren, T.\u2010T., Luo, J., Feng, M., Guo, M. and Weicheng Lin, K. (2008), \u201cQuantum algorithms for bio\u2010molecular solutions of the satisfiability problem on a quantum machine\u201d, IEEE Transactions on Nanobioscience, Vol. 7 No. 3, pp. 215\u201022.","DOI":"10.1109\/TNB.2008.2002286"},{"key":"key2022012720113221100_frd4","doi-asserted-by":"crossref","unstructured":"Kari, L. (1997), \u201cDNA computing: the arrival of biological mathematics\u201d, The Mathematical Intelligencer, Vol. 19, pp. 9\u201022.","DOI":"10.1007\/BF03024425"},{"key":"key2022012720113221100_frd5","doi-asserted-by":"crossref","unstructured":"Ray, K.S. and Mondal, M. (2011), \u201cClassification of SODAR data using DNA computing\u201d, New Mathematics and Natural Computation, Vol. 7 No. 3, pp. 413\u201032.","DOI":"10.1142\/S1793005711002074"},{"key":"key2022012720113221100_frd6","doi-asserted-by":"crossref","unstructured":"Tsaftaris, S.A., Katsaggelos, A.K., Pappas, T.N. and Papoutsakis, E.T. (2004), \u201cHow can DNA computing be applied to digital signal processing?\u201d, Signal Processing Magazine, IEEE, Vol. 21 No. 6, pp. 57\u201061.","DOI":"10.1109\/MSP.2004.1359142"},{"key":"key2022012720113221100_frd7","doi-asserted-by":"crossref","unstructured":"Zhang, X., Wang, Y., Cui, G., Niu, Y. and Xu, J. (2009), \u201cApplication of a novel IWO to the design of encoding sequences for DNA computing\u201d, Computers & Mathematics with Applications, Vol. 57 Nos 11\/12, pp. 2001\u20108.","DOI":"10.1016\/j.camwa.2008.10.038"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17563781211231543","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563781211231543\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563781211231543\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:44:27Z","timestamp":1753400667000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/5\/2\/206-225\/133064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,1]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6,1]]}},"alternative-id":["10.1108\/17563781211231543"],"URL":"https:\/\/doi.org\/10.1108\/17563781211231543","relation":{},"ISSN":["1756-378X"],"issn-type":[{"type":"print","value":"1756-378X"}],"subject":[],"published":{"date-parts":[[2012,6,1]]}}}