Abstraction of Graph-Based Models of Bio-molecular Reaction Systems for Efficient Simulation
We propose a technique to simulate molecular reaction systems efficiently by abstracting graph models. Graphs (or networks) and their transitions give rise to simple but powerful models for molecules and their chemical reactions. Depending on the purpose of a graph-based model, nodes and edges of a graph may correspond to molecular units and chemical bonds, respectively. This kind of model provides naive simulations of molecular reaction systems by applying chemical kinetics to graph transition. Such naive models, however, can immediately cause a combinatorial explosion of the number of molecular species because combination of chemical bonds is usually unbounded, which makes simulation intractable. To overcome this problem, we introduce an abstraction technique to divide a graph into local structures. New abstracted models for simulating DNA hybridization systems and RNA interference are explained as case studies to show the effectiveness of our abstraction technique. We then discuss the trade-off between the efficiency and exactness of our abstracted models from the aspect of the number of structures and simulation error. We classify molecular reaction systems into three groups according to the assumptions on reactions. The first one allows efficient and exact abstraction, the second one allows efficient but approximate abstraction, and the third one does not reduce the number of structures by abstraction. We conclude that abstraction is a useful tool to analyze complex molecular reaction systems and measure their complexity.
KeywordsLocal Structure Combinatorial Explosion Reaction Rule Abstracted Model Supplementary Document
Unable to display preview. Download preview PDF.
- 9.Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: exact and automated model reduction. In: Proceedings of the Twenty-Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 362–381. IEEE (2010)Google Scholar
- 17.Kawamata, I.: Formal Definition of the ODE of RNAi and Experimental Results for Approximate Abstraction: supplementary documents (2012), http://hagi.is.s.u-tokyo.ac.jp/~ibuki/cmsb2012supply.pdf
- 19.Kawamata, I., Tanaka, F., Hagiya, M.: Abstraction of DNA Graph Structures for Efficient Enumeration and Simulation. In: International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 800–806 (2011)Google Scholar
- 21.Kobayashi, S.: A New Approach to Computing Equilibrium State of Combinatorial Hybridization Reaction Systems. In: Proc. of Workshop on Computing and Communications from Biological Systems: Theory and Applications, pp. 330–335 (2007)Google Scholar
- 22.Kobayashi, S.: Symmetric Enumeration Method: A New Approach to Computing Equilibria. Technical Report of Dept. of Computer Science, University of Electro-Communications (2008)Google Scholar
- 24.Marshall, W.F.: Modeling recursive RNA interference. PLoS Comput. Biol. 4(9), e1000183 (2008)Google Scholar
- 31.Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)Google Scholar