Abstract
We introduce an abstract molecular structure, then we describe the DNA methylation by using a known calculus of the communicating concurrent systems, namely the π-calculus. Finally, we show that it is possible to have a well-defined interpretation of the π-terms by using our abstract molecular structures. In this way we introduce and study some abstract structures which are similar to the abstract machines in computer science (as Turing machines or automata), and suitable to express molecular interactions. We should remark that the considered interactions imply modifications too (e.g. DNA methylation); in order to express this aspect, we consider and study interactions with substitutions. Because the covalent bounds play a special role when we refer to DNA, our abstract molecular structures are systems with joined (shared) resources; they emphasize the use of some shared resources, as well as the resource transitions. Formally, we use some notions and results of concurrency theory, particularly π-calculus and multiset semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boudol, G. (1992), Asynchrony and the Tr-calculus, INRIA Research Report, 1702.
Ciobanu, G. (1998), A molecular abstract machine, in Gh. Păun, ed., Computing with Bio-Molecules. Theory and Experiments: 61–79. Springer, Berlin.
Ciobanu, G. (2000), Formal Description of the Molecular Processes, in Gh. Păun, ed., Recent Topics in Mathematical and Computational Linguistics, Publishing House of the Romanian Academy, Bucharest.
Ciobanu, G. & M. Rotaru (1998), Faithful π-nets. A faithful graphic representation for π-calculus, Electronic Notes in Theoretical Computer Science 18. http://www.elsevier.nl/locate/entcs/volume18.html.
Ciobanu, G. & M. Rotaru (2000), A π-calculus machine, Journal of Universal Computer Science, 6.1, Springer, Berlin, http://www.iicm.edu/jucs_6_l/a_pi_calcuius_machine.
Honda, K. & M. Tokoro (1991), An object calculus for asynchronous communication, in Proceedings of the ECOOP’: 133-147. Springer, Berlin.
Milner, R. (1989), Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ.
Milner, R. (1993), Elements of interaction, Communications of the Association for Computing Machinery, 36: 78–89.
Milner, R. (1993), The polyadic π-calculus: a tutorial, in E.L. Bauer; W. Brauer & H. Schwichtenberg, eds., Logic and Algebra of Specification: 203–246. Springer, Berlin.
Milner, R. (1996), Calculi for Interaction, Acta Informatica, 33.8: 707–737.
Milner, R; J. Parrow & D. Walker (1992), A calculus of mobile processes, Journal of Information and Computation, 100: 1–77.
Wegner, P. (1998) Interactive foundation of computing, Theoretical Computer Science.
Winskel, G. & M. Nielsen (1995), Models for concurrency, in Handbook of Logic in Computer Science, IV. Oxford University Press, Oxford.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ciobanu, G. (2001). Molecular Structures. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_27
Download citation
DOI: https://doi.org/10.1007/978-94-015-9634-3_27
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5607-8
Online ISBN: 978-94-015-9634-3
eBook Packages: Springer Book Archive