zbMATH — the first resource for mathematics

Formal molecular biology. (English) Zbl 1071.68041
Summary: A language of formal proteins, the \(\kappa\)-calculus, is introduced. Interactions are modeled at the domain level, bonds are represented by means of shared names, and reactions are required to satisfy a causality requirement of monotonicity.
An example of a simplified signalling pathway is introduced to illustrate how standard biological events can be expressed in our protein language. A more comprehensive example, the lactose operon, is also developed, bringing some confidence in the formalism considered as a modeling language.
Then a finer-grained concurrent model, the \(m\kappa\)-calculus, is considered, where interactions have to be at most binary. We show how to embed the coarser-grained language in the latter, a property which we call self-assembly.
Finally we show how the finer-grained language can itself be encoded in \(\pi\)-calculus, a standard foundational language for concurrency theory.

68Q45 Formal languages and automata
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
92C40 Biochemistry, molecular biology
Full Text: DOI
[1] Berry, G.; Boudol, G., The chemical abstract machine, Theoret. comput. sci, 96, 217-248, (1992) · Zbl 0747.68013
[2] R. Bruni, C. Laneve, U. Montanari, Orchestrating transactions in join calculus, in: Proc. CONCUR’02. Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 321-337. · Zbl 1012.68524
[3] L. Cardelli, Brane calculi, in: Proc. BIO-CONCUR’03, Marseille, France, Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2003, to appear.
[4] L. Cardelli, P. Gardner, G. Ghelli, Manipulating trees with hidden labels, in: Proc. FOSSACS 2003, Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003, p. 216-232. · Zbl 1029.68092
[5] M. Chiaverini, V. Danos, A core modeling language for the working molecular biologist, in: Proc. CMSB’03, Lecture Notes in Computer Science, Vol. 2602, Springer, Berlin, 2003, p. 166. · Zbl 1112.92313
[6] V. Danos, J. Krivine, Formal molecular biology done in CCS, in: Proc. BIO-CONCUR’03, Marseille, France, Electronic Notes in Theoretical Computer Science, Elsevier, 2003, to appear.
[7] V. Danos, G. Laneve, Core formal molecular biology, in: Proc. 12th European Symp. on Programming (ESOP’03), Warsaw, Poland, Lecture Notes in Computer Science, Vol. 2618, Springer, Berlin, 2003, pp. 302-318. · Zbl 1033.92013
[8] V. Danos, C. Laneve, Graphs for formal molecular biology, in: Proc. First Internat. Workshop on Computational Methods in Systems Biology (CMSB’03), Rovereto, Italy, Lecture Notes in Computer Science, Vol. 2602, Springer Berlin, 2003, pp. 34-46. · Zbl 1053.92021
[9] Diestel, R., Graph theory, (2000), Springer New York · Zbl 0945.05002
[10] F.L. Fessant, Jocaml: Conception et implémentation d’un langage à agents mobiles, Ph.D. Thesis, Ecole Polytechnique, France, 2001.
[11] Fontana, W.; Buss, L.W., The barrier of objects: from dynamical systems to bounded organizations, (), 56-116
[12] C. Fournet, G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: 23rd ACM Symp. on Principles of Programming Languages (POPL’96), 1996.
[13] Gillespie, D.T., Exact stochastic simulation of coupled chemical reactions, J. phys. chem, 81, 2340-2361, (1977)
[14] Hasty, J.; McMillen, D.; Collins, J.J., Engineered gene circuits, Nature, 420, 224-230, (2002)
[15] Inada, T.; Kimata, K.; Aiba, H., Mechanism responsible for glucose-lactose diauxie in Escherichia colichallenge to the camp model, Genes cells, 1, 3, 293-301, (1996)
[16] J.W. Kimball, Kimball’s biology pages, Online Biology Textbook, 2003.
[17] E. Klavins, Automatic synthesis of controllers for assembly and formation forming, in: Proc. Internat. Conf. on Robotics and Automation, 2002.
[18] K.W. Kohn, Molecular interaction map of the mammalian cell cycle control and DNA repair systems, Mol. Biol. Cell (10) (1999) 2703-2734.
[19] Lafont, Y., Interaction combinators, Inform. and comput, 137, 1, 69-101, (1997) · Zbl 0882.68058
[20] Milner, R.; Parrow, J.; Walker, D., A calculus of mobile processes I and II, Inform. and comput, 100, 1, 41, 42.78, (1992)
[21] J. Monod, F. Jacob, General conclusions: teleonomic mechanisms in cellular metabolism, growth and differentiation, Cold Spring Harbor Symp. on Quantitative Biology: Cellular Regulatory Mechanisms, Vol. 26, 1961, pp. 389-401.
[22] C. Priami, Stochastic pi-calculus with general distributions, in: CLUP (Ed.), Proc. PAPM 96, 1996.
[23] C. Priami, A. Regev, E. Shapiro, W. Silverman, Application of a stochastic name-passing calculus to representation and simulation of molecular processes, Inform. Process. Lett. (2001). · Zbl 0997.92018
[24] A. Regev, E.M. Panina, W. Silverman, L. Cardelli, E. Shapiro, Bioambients: an abstraction for biological compartments, Theoret. Comput. Sci. (2003) to appear. · Zbl 1069.68569
[25] Regev, A.; Shapiro, E., Cells as computation, Nature, 419, (2002)
[26] A. Regev, W. Silverman, E. Shapiro, Representation and simulation of biochemical processes using the π-calculus process algebra, in: R.B. Altman, A.K. Dunker, L. Hunter, T.E. Klein (Eds.), Pacific Symp. on Biocomputing, Vol. 6, World Scientific Press, Singapore, 2001, pp. 459-470.
[27] Segel, I.H., Enzyme kinetics: behavior and analysis of rapid equilibrium and steady-state enzyme systems, (1975), Wiley New York
[28] A. Unypoth, P. Sewell, Nomadic Pict: correct communication infrastructure for mobile computation, in: Proc. POPL 2001, 2001. · Zbl 1323.68416
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.