Treffer: Cycles and communicating classes in membrane systems and molecular dynamics
Universita degli Studi di Milano, Dipartimento di Informatica e Comunicazione, Via Comelico 39, 20135 Milano, Italy
Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333 CA Leiden, Netherlands
Università degli Studi di Milano-Bicocca, Dipartimento di Informatica, Sistemistica e Comunicazione, Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy
Vrije Universiteit Amsterdam, Faculteit der Bewegingswetenschappen, Van der Boechorststraat 9, 1081 BT Amsterdam, Netherlands
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Computer science; theoretical automation; systems
Generalities in biological sciences
Mathematics
Weitere Informationen
We are considering sequential membrane systems and molecular dynamics from the viewpoint of Markov chain theory. The configuration space of these systems (including the transitions) is a special kind of directed graph, called a pseudo-lattice digraph, which is closely related to the stoichiometric matrix. Taking advantage of the monoidal structure of this space, we introduce the algebraic notion of precycle. A precycle leads to the identification of cycles by means of the concept of defect, which is a set of geometric constraints on configuration space. Two efficient algorithms for evaluating precycles and defects are given: one is an algorithm due to Contejean and Devie, the other is a novel branch-and-bound tree search procedure. Cycles partition configuration space into equivalence classes, called the communicating classes. The structure of the communicating classes in the free regime -where all rules are enabled - is analyzed: testing for communication can be done efficiently. We show how to apply these ideas to a biological regulatory system.