An ASP-based approach for Boolean networks representation and attractor detection

DOI10.29007/FB4FMaRDI QIDQ7024199zbMATH OpenFDO

Authors Tarek Khaled, Belaïd Benhamou

Publication date 20 February 2025

Full work available at URL https://doi.org/10.29007/FB4F

zbMATH Keywords

answer set programmingattractorsbioinformaticsBoolean networkslogic programming

Mathematics Subject Classification ID

Logic programming (68N17) Systems biology, networks (92C42) Genetics and epigenetics (92D10)

Cites work

• An ASP-based approach for attractor enumeration in synchronous and asynchronous Boolean networks
• ASSAT: computing answer sets of a logic program by SAT solvers
• Computing maximal and minimal trap spaces of Boolean networks
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 611095 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Hypothesizing about signaling networks

This page was built for publication: An ASP-based approach for Boolean networks representation and attractor detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7024199)