Inference of Gene Predictor Set Using Boolean Satisfiability

Details Inference of Gene Predictor Set Using Boolean Satisfiability Inference of Gene Predictor Set Using Boolean Satisfiability

2010-05-26

arxiv.org/abs/1005.4812v1

Biology

Quantitative Biology

Genomics

9 pages, 3 figures, 6 tables, 17 references

Scientific paper

The inference of gene predictors in the gene regulatory network has become an important research area in the genomics and medical disciplines. Accurate predicators are necessary for constructing the GRN model and to enable targeted biological experiments that attempt to confirm or control the regulation process. In this paper, we implement a SAT-based algorithm to determine the gene predictor set from steady state gene expression data (attractor states). Using the attractor states as input, the states are ordered into attractor cycles. For each attractor cycle ordering, all possible predictors are enumerated and a CNF expression is formulated which encodes these predictors and their biological constraints. Each CNF is explored using a SAT solver to find candidate predictor sets. Statistical analysis of the results selects the most likely predictor set of the GRN corresponding to the attractor data. We demonstrate our algorithm on attractor state data from a melanoma study, and present our predictor set results.

Affiliated with

Also associated with

No associations

Rating

Inference of Gene Predictor Set Using Boolean Satisfiability 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 Inference of Gene Predictor Set Using Boolean Satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inference of Gene Predictor Set Using Boolean Satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-606204