Résumé
We introduce a formalism to represent and analyze protein-protein and protein-DNA interaction networks. We illustrate the expressivity of this language, by proposing a formal counterpart of Kohn's compilation on the mammalian cell-cycle control. This effectively turns an otherwise static knowledge into a discrete transition system incorporating a qualitative description of the dynamics. We then propose to use the computation tree logic (CTL) as a query language for querying the possible behaviors of the system. We provide examples of biologically relevant queries expressed in CTL about the mammalian cell-cycle control and show the effectiveness of symbolic model checking tools to evaluate CTL queries in this context.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 25-44 |
| Nombre de pages | 20 |
| journal | Theoretical Computer Science |
| Volume | 325 |
| Numéro de publication | 1 |
| Les DOIs | |
| état | Publié - 28 sept. 2004 |
| Modification externe | Oui |
| Evénement | Computational Systems Biology - Rovereto, Italie Durée: 24 févr. 2003 → 26 févr. 2003 |
Empreinte digitale
Examiner les sujets de recherche de « Modeling and querying biomolecular interaction networks ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver