Biology – Quantitative Biology – Molecular Networks
Scientific paper
2009-01-28
Biology
Quantitative Biology
Molecular Networks
9 pages, 1 figure
Scientific paper
This paper addresses the problem of finding cycles in the state transition graphs of synchronous Boolean networks. Synchronous Boolean networks are a class of deterministic finite state machines which are used for the modeling of gene regulatory networks. Their state transition graph cycles, called attractors, represent cell types of the organism being modeled. When the effect of a disease or a mutation on an organism is studied, attractors have to be re-computed every time a fault is injected in the model. We present an algorithm for finding attractors which uses a SAT-based bounded model checking. Novel features of the algorithm compared to the traditional SAT-based bounded model checking approaches are: (1) a termination condition which does not require an explicit computation of the diameter and (2) a technique to reduce the number of additional clauses which are needed to make paths loop-free. The presented algorithm uses much less space than existing BDD-based approaches and has a potential to handle several orders of magnitude larger networks.
Dubrova Elena
Teslenko Maxim
No associations
LandOfFree
A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-344747