Efficient synthesis of a class of Boolean programs from I-O data: application to genetic networks

DOI10.1016/j.dam.2010.10.009zbMath1214.68132OpenAlexW2075719098MaRDI QIDQ628335

Jacques Cohen, Aurélien Rizk, Ruth M. Charney

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.009

zbMATH Keywords

reverse engineeringprogram synthesisgenetic networksdiscrete Jacobians

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• REVEAL

Cites Work

• Unnamed Item
• A combinatorial analogue of the Jacobian problem in automata networks
• Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
• Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic
• Multistationarity, the basis of cell differentiation and memory. I. Structural conditions of multistationarity and other nontrivial behavior

This page was built for publication: Efficient synthesis of a class of Boolean programs from I-O data: application to genetic networks