Search Results

Documents authored by Soliman, Sylvain

Document
DOI: 10.4230/LIPIcs.CP.2023.35
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming

Authors: Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman

Published in: LIPIcs, Volume 280, 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)

Abstract
Boolean Networks (BNs) are an efficient modeling formalism with applications in various research fields such as mathematics, computer science, and more recently systems biology. One crucial problem in the BN research is to enumerate all fixed points, which has been proven crucial in the analysis and control of biological systems. Indeed, in that field, BNs originated from the pioneering work of R. Thomas on gene regulation and from the start were characterized by their asymptotic behavior: complex attractors and fixed points. The former being notably more difficult to compute exactly, and specific to certain biological systems, the computation of stable states (fixed points) has been the standard way to analyze those BNs for years. However, with the increase in model size and complexity of Boolean update functions, the existing methods for this problem show their limitations. To our knowledge, the most efficient state-of-the-art methods for the fixed point enumeration problem rely on Answer Set Programming (ASP). Motivated by these facts, in this work we propose two new efficient ASP-based methods to solve this problem. We evaluate them on both real-world and pseudo-random models, showing that they vastly outperform four state-of-the-art methods as well as can handle very large and complex models.
Cite as

Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman. Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 35:1-35:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{trinh_et_al:LIPIcs.CP.2023.35,
  author =	{Trinh, Van-Giang and Benhamou, Belaid and Soliman, Sylvain},
  title =	{{Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming}},
  booktitle =	{29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
  pages =	{35:1--35:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-300-3},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{280},
  editor =	{Yap, Roland H. C.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.35},
  URN =		{urn:nbn:de:0030-drops-190720},
  doi =		{10.4230/LIPIcs.CP.2023.35},
  annote =	{Keywords: Computational systems biology, Boolean network, Fixed point, Answer set programming}
}
Document
DOI: 10.4230/DagSemProc.09091.3
Analyzing various models of Circadian Clock and Cell Cycle coupling

Authors: Attila Csikász-Nagy, Adrien Faure, Roberto Larcher, Paola Lecca, Ivan Mura, Ferenc Jordan, Alida Palmisano, Alessandro Romanel, Sean Sedwards, Heike Siebert, Sylvain Soliman, Denis Thieffry, Judit Zámborszky, Tommaso Mazza, and Paolo Ballarini

Published in: Dagstuhl Seminar Proceedings, Volume 9091, Formal Methods in Molecular Biology (2009)

Abstract
The daily rhythm can influence the proliferation rate of many cell types. In the mammalian system the transcription of the cell cycle regulatory protein Wee1 is controlled by the circadian clock. Zamborszky et al. (2007) present a computational model coupling the cell cycle and circadian rhythm, showing that this coupling can lead to multimodal cell cycle time distributions. Biological data points to additional couplings, including a link back from the cell cycle to the circadian clock. Proper modelling of this coupling requires a more detailed description of both parts of the model. Hence, we aim at further extending and analysing earlier models using a combination of modelling techniques and computer software, including CoSBI lab, BIOCHAM, and GINsim.
Cite as

Attila Csikász-Nagy, Adrien Faure, Roberto Larcher, Paola Lecca, Ivan Mura, Ferenc Jordan, Alida Palmisano, Alessandro Romanel, Sean Sedwards, Heike Siebert, Sylvain Soliman, Denis Thieffry, Judit Zámborszky, Tommaso Mazza, and Paolo Ballarini. Analyzing various models of Circadian Clock and Cell Cycle coupling. In Formal Methods in Molecular Biology. Dagstuhl Seminar Proceedings, Volume 9091, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{csikasznagy_et_al:DagSemProc.09091.3,
  author =	{Csik\'{a}sz-Nagy, Attila and Faure, Adrien and Larcher, Roberto and Lecca, Paola and Mura, Ivan and Jordan, Ferenc and Palmisano, Alida and Romanel, Alessandro and Sedwards, Sean and Siebert, Heike and Soliman, Sylvain and Thieffry, Denis and Z\'{a}mborszky, Judit and Mazza, Tommaso and Ballarini, Paolo},
  title =	{{Analyzing various models of Circadian Clock and Cell Cycle coupling}},
  booktitle =	{Formal Methods in Molecular Biology},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9091},
  editor =	{Rainer Breitling and David Roger Gilbert and Monika Heiner and Corrado Priami},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09091.3},
  URN =		{urn:nbn:de:0030-drops-19944},
  doi =		{10.4230/DagSemProc.09091.3},
  annote =	{Keywords: Cell cycle, circadian clock, computational modelling}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact