1

Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction

Biotechnological innovations which sample gene expressions allow to measure the gene expression levels of a biological system with varying degree of accuracy, cost and speed. By repeating the measurement steps at different sampling rates, one can …

BuST: Bundled Suffix Trees

We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet ∑ together with a non-transitive relation ≈ among its letters. Following the path of a substring β …

Connecting process algebras and differential equations for Systems Biology

Exploiting Model Checking in Constraint-based Approaches to the Protein Folding.

In this paper we show how model checking can be used to drive the solution search in the protein folding problem encoded as a constraint optimization problem. The application of the model checking technique allows us to distinguish between meaningful …

Extensions of S1S and the composition method

Finding regulatory elements fixing error layouts

Global Constraints for Discrete Lattices

Hybrid Approaches for Rostering: a Case Study in the Integration of Constraint Programming and Local Search

Different approaches in the hybridization of constraint programming and local search techniques have been recently proposed in the literature. In this paper we investigate two of them, namely the employment of local search to improve a solution found …

Implementazione di Memoria Distribuita su cluster CompactPCI

Modal logics for Brane Calculus

The Brane Calculus is a calculus of mobile processes, intended to model the transport machinery of a cell system. In this paper, we introduce the Brane Logic, a modal logic for expressing formally properties about systems in Brane Calculus. Similarly …