Molecular interaction

Authors:
Gabriel Ciobanu;Mihai Rotaru
Affiliations:
Institute of Computer Science, Romanian Academy, Iasi, Romania and National University of Singapore, School of Computing, Dept. of Computer Science, 10 Kent Ridge Crescent, 119260 Singapore, Singa ...;Institute of Computer Science, Romanian Academy, Iasi, Romania
Venue:
Theoretical Computer Science
Year:
2002

Citing 9
Cited 1

Modeling concurrency with partial orders

International Journal of Parallel Programming
Elements of interaction: Turing award lecture

Communications of the ACM
A calculus of mobile processes, I

Information and Computation
Models for concurrency

Handbook of logic in computer science (vol. 4)
Interactive foundations of computing

Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Molecular structures

Where mathematics, computer science, linguistics and biology meet
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Mobility in computer science and in membrane systems

CMC'10 Proceedings of the 11th international conference on Membrane computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We introduce and study abstract structures which are suitable for expressing molecular interaction. The abstract structures are able to manage shared resources and to describe the use of shared resources. We show that these structures can provide an interpretation of the π-calculus, a known calculus of communicating concurrent systems. We briefly describe DNA methylation by using the π-calculus. Molecular interactions during DNA methylation imply changes of conformation and other modifications; these changes can be modelled by substitutions. Formally, we use some notions and results of the concurrency theory, particularly related to the π-calculus and multiset semantics.