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

DOI10.1016/J.DAM.2010.10.009zbMATH Open1214.68132OpenAlexW2075719098MaRDI QIDQ628335FDOQ628335

Authors: Jacques Cohen, Aurélien Rizk, Ruth 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

Recommendations

• A computational algebra approach to the reverse engineering of gene regulatory networks
• Identification of predictors of Boolean networks from observed attractor states
• scientific article; zbMATH DE number 1962877
• Parameter estimation for Boolean models of biological networks
• Towards Parallel Boolean Functional Synthesis

zbMATH Keywords

genetic networksreverse engineeringprogram synthesisdiscrete Jacobians

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Generation of mutants for boolean expression

Uses Software

• REVEAL

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

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