The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of analyses and their computation, we introduced CP(BioNet), a constraint programming framework for the analysis of biochemical networks. An Oz-Mozart prototype of CP(BioNet) is described. This prototype consists of the implementation of a new kind of domain variables, graph domain variables, and the implementation of constraint propagators for constraints over graph-domain variables. These new variables and constraints are implemented in Oz and they can then be used like other domain variables in the Oz-Mozart platform. An implementation of a path constraint propagator is described in depth and constrained path finding tests are analysed to assess the tractability of our approach. Finally, an alternative Oz-Mozart data-structure for the graph-domain variables is presented and compared to the first one. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Dooms, G., Deville, Y., & Dupont, P. (2005). A Mozart implementation of CP(BioNet). In Lecture Notes in Computer Science (Vol. 3389, pp. 237–250). Springer Verlag. https://doi.org/10.1007/978-3-540-31845-3_20
Mendeley helps you to discover research relevant for your work.