Splicing operation and fuzzy molecular automaton

Adleman, L. (1994), “Molecular computation of solutions to combinatorial problems”, Science, Vol. 266, pp. 1021‐4.

Adleman, L. (1995), “On constructing a molecular computer”, available at: ftp://usc.edu/pub/csinfo/papers/adleman.

Adleman, L., Rothemund, P., Roweis, S. and Winfree, E. (1996), “On applying molecular computation to the data encryption standard”, 2nd DIMACS Workshop on DNA Based Computers, Princeton, NJ, pp. 28‐48.

Beaver, D. (1995), “Computing with DNA”, Journal of Computational Biology, Vol. 2 No. 1, pp. 1‐7.

Bennett, C.H. (1982), “The thermodynamics of computation – a review”, International Journal of Theoretical Physics, Vol. 21 No. 12, pp. 905‐40.

Faulhammer, D., Cukras, A.R., Lipton, R.J. and Landweber, L.F. (2000), “Molecular computation: RNA solutions to chess problems”, Proc. Natl Acad. Sci. USA, Vol. 97 No. 4, pp. 1385‐9.

Garzon, M. et al. (1998), Automata Implementation, Lecture Notes in Computer Science, Wood, D. and Yu, S. (Eds), Vol. 1436, Springer, Berlin, pp. 56‐74.

Hartemink, A.J., Gifford, D.K. and Khodor, J. (1999), “Automated constraint‐based nucleotide sequence selection for DNA computation”, Biosystems, Vol. 52, pp. 227‐35.

Hartmanis, J. (1995), “On the weight of computations”, Bulletin of the European Association of Theoretical Computer Science, Vol. 55, pp. 136‐8.

Head, T. (1987), “Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors”, Bulletin of Mathematical Biology, Vol. 49, pp. 737‐59.

Head, T. (1998), “Hamiltonian paths and double stranded DNA”, in Paun, G.H. (Ed.), Computing with Bio‐molecules; Theory and Experiments, Springer, Berlin, pp. 80‐92.

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‐8.

Head, T., Antoniou, I., Calude, C.S. and Dineen, M.J. (2001), “Splicing systems, aqueous computing, and beyond”, Unconventional Models of Computation UMC'2K, Springer, London, pp. 68‐84.

Hopcroft, J.E., Motwani, R. and Ullman, J.D. (2000), Introduction to Automata Theory, Languages and Computation, 2nd ed., Addison‐Wesley, Boston, MA.

Khodor, J. and Giffird, D.K. (1999), “Design and implementation of computational systems based on programmed mutagenesis”, Biosystems, Vol. 52, pp. 93‐7.

Kurtz, S., Mahaney, S., Royer, J. and Simon, J. (1996), “Active transport in biological computing”, 2nd DIMACS Workshop on DNA Based Computers, Princeton, NJ, pp. 111‐21.

Lipton, R.J. (1995), “DNA solution of hard computational problems”, Science, Vol. 268, pp. 542‐5.

Lipton, R.J., Landweber, L.F. and Rabin, M.O. (1997), “DNA based computers III”, in Rubin, H. and Wood, D.H. (Eds), DIMACS Workshop, University of Pennsylvania, June 23‐27, American Mathematical Society, Providence, RI, pp. 161‐72.

Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M. and Smith, L.M. (2000), “DNA computing on surfaces”, Nature, Vol. 403, pp. 175‐9.

Mao, C., LaBean, T.H., Reif, J.H. and Seeman, N.C. (2000), “Logical computation using algorithmic self‐assembly of DNA triple‐crossover molecules”, Nature, Vol. 407, pp. 493‐6.

Ouyang, Q., Kaplan, P.D., Liu, S. and Libchaber, A. (1997), “DNA solution of the maximal clique problem”, Science, Vol. 278 No. 5337, pp. 446‐9.

Ray, K.S. and Chatterjee, P. (2010), “Approximate reasoning on a DNA‐chip”, International Journal of Intelligent Computing and Cybernetics, Vol. 3 No. 3, pp. 514‐53.

Ray, K.S. and Mondal, M. (2010), “Similarity‐based fuzzy reasoning by DNA computing”, International Journal of Bio‐inspired Computation, Vol. 3 No. 2, pp. 112‐22.

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‐119.

Ruben, A.J. and Landweber, L.F. (2000), “The past, present and future of molecular computing”, Nature Rev. Mol. Cell Biol., Vol. 1, pp. 69‐72.

Sakamoto, K., Kiga, D., Komiya, K., Gouzu, H., Yokoyama, S., Ikeda, S., Sugiyama, H. and Hagiya, M. (1999), “State transition by molecules”, Biosystems, Vol. 52, pp. 81‐91.

Shapiro, E. and Karunaratne, K.S.G. (2001), “Method and system of computing similar to a Turing machine”, US Patent 6,266,569.

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‐85.

Turing, A.M. (1936), “On computable numbers, with an application to the Entcheidungproblem”, Proc. Lond. Math. Soc. II Ser., Vol. 42, pp. 230‐65.

Winfree, E., Liu, F.R., Wenzler, L.A. and Seeman, N.C. (1998), “Design and self‐assembly of two‐dimensional DNA crystals”, Nature, Vol. 394 No. 6693, pp. 539‐44.

Akerkar, R. and Sajja, P.S. (2009), “Bio‐inspired computing: constituents and challenges”, International Journal of Bio‐inspired Computation, Vol. 1 No. 3, pp. 135‐50.

Chang, W.‐L. (2007), “Fast parallel DNA‐based algorithms for molecular computation: the set‐partition problem”, IEEE Transactions on Nanobioscience, Vol. 6 No. 1, pp. 346‐53.

Chang, W.‐L., Ren, T.‐T., Luo, J., Feng, M., Guo, M. and Weicheng Lin, K. (2008), “Quantum algorithms for bio‐molecular solutions of the satisfiability problem on a quantum machine”, IEEE Transactions on Nanobioscience, Vol. 7 No. 3, pp. 215‐22.

Kari, L. (1997), “DNA computing: the arrival of biological mathematics”, The Mathematical Intelligencer, Vol. 19, pp. 9‐22.

Ray, K.S. and Mondal, M. (2011), “Classification of SODAR data using DNA computing”, New Mathematics and Natural Computation, Vol. 7 No. 3, pp. 413‐32.

Tsaftaris, S.A., Katsaggelos, A.K., Pappas, T.N. and Papoutsakis, E.T. (2004), “How can DNA computing be applied to digital signal processing?”, Signal Processing Magazine, IEEE, Vol. 21 No. 6, pp. 57‐61.

Zhang, X., Wang, Y., Cui, G., Niu, Y. and Xu, J. (2009), “Application of a novel IWO to the design of encoding sequences for DNA computing”, Computers & Mathematics with Applications, Vol. 57 Nos 11/12, pp. 2001‐8.