ABSTRACT
This paper describes a rule-based multiset programming paradigm, as a unifying theme for biological, chemical, DNA, physical and molecular computations. The computations are interpreted as the outcome arising out of deterministic, nondeterministic or stochastic interaction among elements in a multiset object space which includes the environment. These interactions are like chemical reactions and the evolution of the multiset can mimic the biological evolution. Since the reaction rules are inherently parallel, any number of actions can be performed cooperatively or competitively among the subsets of elements, so that the elements evolve toward an equilibrium or an emergent state. Hence, this paradigm is widely applicable; e.g., to conventional algorithms, evolutionary algorithms, Markov chain Monte Carlo based Bayesian inference, genetic algorithms, self-organized criticality and active walker models (swarm and ant intelligence), DNA and molecular computing. Practical realisation of this paradigm is achieved through a coordination programming language using Multiset and transactions. This paradigm permits carrying out parts or all of the computations independently on distinct processors and is eminently suitable for cluster and grid computing.
- Adelman, L.M. Molecular computation of solutions to combinatorial problems, Science, 266, 1994, 1021--1024. Google ScholarDigital Library
- Banatre, J.-P., Me'tayer, D.L. The Gamma model and its discipline of programming, Science of Computer Programming, 15 , 1990, 55--77. Google ScholarDigital Library
- Banatre, J.-P, Me'tayer, D.L. Programming by Multiset transformation, Comm.ACM, 36, 1993, 98--111. Google ScholarDigital Library
- Belew, R.K., Forrest, S. Learning and Programming in classifier Systems, Machine Learning 3, 1988, 193--223. Google ScholarDigital Library
- Bonabeau, E., Dorigo, M., and Theraulaz, G. Swarm Intelligence: From natural to artificial systems, Oxford University Press, Oxford,U.K, 1999. Google ScholarDigital Library
- Booker, L.K., Goldberg, D.E., Holland, J.H. Classifier systems and Genetic Algorithms, Artificial Intelligence, 40, 1989, 235--282. Google ScholarDigital Library
- Calude,C.S, Paun, G., Rozenberg, G and Salomaa, A., Multiset Processing, Lecture notes in Computer Science, 2235, Springer Verlag, New York, 2001.Google Scholar
- Campbell, N. Biology, Benjamin/Cummings Publishing Company, New York, 1996.Google Scholar
- Conrad, M. Molecular Computing Paradigms, Computer 25, 6--68, 1992. Google ScholarDigital Library
- Conrad, M., Zauner, K.-P, Molecular computing: From conformational pattern recognition to complex processing networks, in Bioinformatics, Lecture notes in Computer Science 1278, 1--10, Springer Verlag, New York, 1997. Google ScholarDigital Library
- Conrad, M ., Zauner, K-P, DNA as a vehicle for the self-assembly model of computing, Biosystems, 45, 59--66, 1998.Google ScholarCross Ref
- Dorigo, M.,Caro, G.D.,and Sampels, M. Ant Algorithms, Lecture Notes in Computer Science, Vol. 2463, Springer Verlag, New York, 2002. Google ScholarDigital Library
- Doucet, A., Gordon, N., Krishnamurthy, V., Particle Filters for State Estimation of Jump Markov Linear Systems, IEEE Trans Signal Processing. 49, 2001, pp.613--624. Google ScholarDigital Library
- Fernandez-Villacanas, J.L., Fatah, J.M., Amin, S. Computing with Evolving Proteins, Parallel and Distributed Processing, Ed.J. Rolim, Lecture Notes in Computer Science, Vol.1388, Springer Verlag, New York , 1998, pp.207--215.Google Scholar
- Forrest, S. Parallelism and Programming in classifier systems, Morgan Kauffman, San Mateo, California, 1991. Google ScholarDigital Library
- Forrest, S. Emergent Computation , M.I.T Press, Cambridge, Mass, 1991. Google ScholarDigital Library
- Genesereth, M.H, Nilsson, N. Logical Foundations of Artificial Intelligence, Morgan Kaufmann, Los Altos, California, 1987. Google ScholarDigital Library
- Goldberg, D.E. Genetic algorithms in Search, optimisation and Machine Learning, Addison Wesley, Reading, Mass. 1989. Google ScholarDigital Library
- Grefenstett, J.J. Credit Assignment in rule discovery systems based on genetic algorithms, Machine Learning, 3, 225--245, 1988. Google ScholarDigital Library
- Holland, J.H, et al., Induction, M.I.T. Press, Cambridge, Mass., 1987.Google Scholar
- Ishida, T. Parallel, Distributed and Multiagent Production Systems, Lecture Notes in Computer Science, 890, Springer Verlag, New York, 1991. Google ScholarDigital Library
- Kauffman, S.A. The Origins of Order, Oxford university Press, Oxford, 1993.Google Scholar
- Kennedy, J. and Eberhart, R.C. Swarm Intelligence, Morgan Kauffman, London, 2001. Google ScholarDigital Library
- Kogge, P.M. The Architecture of Symbolic Computers, McGraw Hill, New York, 1991. Google ScholarDigital Library
- Krishnamurthy, E.V., Solving problems by random trials, Science and computers, (A volume dedicated to Nicholas Metropolis), Editor: G.C. Rota, Advances in Mathematics, Vol.10, pp.61--81, Academic Press, New York, 1986.Google Scholar
- Krishnamurthy, E.V. Parallel Processing, Addison Wesley, Reading, Mass. 1989. Google ScholarDigital Library
- Krishnamurthy, E.V. and Murthy, V.K. Transaction Processing Systems, Prentice Hall, Sydney, 1992. Google ScholarDigital Library
- Kuo, S., Moldovan, D., The state of the art in parallel production systems, J. Parallel and distributed computing, 15, 1--26, 1992. Google ScholarDigital Library
- Kulic, I. M. Evaluating Polynomials on the molecular level- a novel approach to molecular computers, Biosystems, 45, 45--57, 1998.Google ScholarCross Ref
- Lam,L., Nonlinear Physics for Beginners, World Scientific, Singapore, 1998.Google Scholar
- Lipton, R.J. DNA solution to hard computational problems, Science, 268, 542--545, 1995.Google ScholarCross Ref
- Ma, W., Murthy, V.K., and Krishnamurthy, E.V., Multran - A coordination Programming Language Using Multiset and Transactions,Proc. Neural ,Parallel and Scientific Computing, V.1, pp. 301--304, Dynamic Publishers, Inc.,U.S.A., 1995.Google Scholar
- Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs , Springer Verlag, New York, 1992. Google ScholarDigital Library
- Miranker, D.P. TREAT: A new efficient match algorithm for AI Production Systems, Pitman, London, 1991. Google ScholarDigital Library
- Misra, B, Prigogine, I. and Courbage, M. From deterministic dynamics to probabilistic descriptions, Physica, 98A, 1--26, 1979.Google Scholar
- Muehlenbein, H. Evolution in Time and Space- the parallel genetic algorithm, In Foundations of Genetic algorithms, in Rawlins, G., ed. Morgan Kaufmann, San Mateo, California, 1991, 316--337. Google ScholarDigital Library
- Murthy, V.K, Krishnamurthy, E.V. Probabilistic Parallel Programming based on multiset transformation, Future Generation Computer systems, 11, 283--295, 1995. Google ScholarDigital Library
- Murthy, V.K., Krishnamurthy, V., and Krishnamurthy, E.V., Can interacting agents in www reach self-organized criticality, Smart Engineering System Design, 12, pp.165--170, ASME Press, New York, 2002.Google Scholar
- Papadimitriou, C.H. Computational Complexity, Addison Wesley, Reading, Mass, 1985.Google Scholar
- Petrina, D. Ya. Mathematical Foundations of Quantum Statistical Mechanics, Kluwer Academic Publishers, London, 1995.Google ScholarCross Ref
- Prigogine, I. From being to becoming, W.H. Freeman, San Fransisco, 1980.Google Scholar
- Rambidi, N.G., 1997, Biomolecular Computer: roots and Promises, Biosystems, 44, 1997, 1--15.Google Scholar
- Robert, C.P., G. Casella, Monte Carlo Statistical Methods, Springer Verlag, 1999. Google ScholarDigital Library
- Rich, E. and Knight, K. Artificial Intelligence, McGraw Hill, New York, 1991. Google ScholarDigital Library
- Spall,J.C. Introduction to stochastic search and optimization, Wiley-Interscience, New York, 2003. Google ScholarDigital Library
- Spears, W.M., and De Jong, K.A., 1993, An overview of evolutionary computation, Machine Learning ECLML-93, Lecture Notes in Computer Science, 667, 442--459, Springer Verlag, New York, 1993. Google ScholarDigital Library
- Straub, D. Alternative Mathematical Theory of Nonequilibrium Phenomena, Academic Press, New York, 1997.Google Scholar
- Vose, M.D. Generalizing the notion of schema in genetic algorithms, Artificial Intelligence, 50, 385--396, 1991. Google ScholarDigital Library
- Whitley, D., Starkweather, T. Genitor: a distributed Genetic algorithm, J. Experimental and Theoretical Artificial Intelligence, 2, 184--214, 1990. Google ScholarDigital Library
- Wolfram, S. A New kind of Science, Wolfram Media Inc., Champaign,Ill, 2002. Google ScholarDigital Library
- Zauner, K.-P., Conrad, M. Parallel computing with DNA: toward the Anti-Universal Machine, Proc. PPSN-IV, Lecture Notes in Computer Science,1141, Springer Verlag, New York, 1996. Google ScholarDigital Library
Index Terms
- Biologically inspired rule-based multiset programming paradigm for soft-computing
Recommendations
RNA Secondary Structure Prediction Using Soft Computing
Prediction of RNA structure is invaluable in creating new drugs and understanding genetic diseases. Several deterministic algorithms and soft computing-based techniques have been developed for more than a decade to determine the structure from a known ...
Quantum mechanical approaches and molecular docking studies of metal based anticancer drugs cis-Diammine glycolato platinum and Diaminocyclohexane oxalatoplatinum structures
AbstractThe optimized structures and theoretical studies of metal based anticancer drugs Nedaplatin (cis-Diammine glycolato platinum) (CDGP) and Oxaliplatin (Diaminocyclohexane oxalatoplatinum) (DCOP) structures by Density Functional Theory (...
Graphical AbstractDisplay Omitted
Highlights- Our Research work focuses on the Structure based learning of the metal based anticancer drugs such as nedaplatin and Oxaliplatin.
Toward molecular programming with DNA
ASPLOS '08Biological organisms are beautiful examples of programming. The program and data are stored in biological molecules such as DNA, RNA, and proteins; the algorithms are carried out by molecular and biochemical processes; and the end result is the creation ...
Comments