Predictor Set Inference using SAT

Chapter

Abstract

The inference of gene predictors in the gene regulatory network (GRN) has become an important research area in the genomics and medical disciplines. Accurate predictors are necessary for constructing the GRN model and to enable targeted biological experiments that attempt to validate or control the regulation process. In this chapter, 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 conjunctive normal form (CNF) expression is generated which encodes these predictors and their biological constraints. Each CNF is solved using a SAT solver to find candidate predictor sets. Statistical analysis of the resulting predictor sets 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.

References

  1. 1.
    Lin, P. K., Khatri, S.P.: Inference of Gene Predictor Set Using Boolean Satisfiability. Genomic Signal Processing and Statistics (GENSIPS). 2010 IEEE International Workshop on, pp. 1–4. (2010)Google Scholar
  2. 2.
    Lin, P. K., Khatri, S.P.: Application of Logic Synthesis to the Understanding and Cure of Genetic Diseases. Proceedings of the 49th Annual Design Automation Conference, pp. 734–740. (2012)Google Scholar
  3. 3.
    Bittner M. et al.: Molecular classification of cutaneous malignant melanoma by gene expression profiling. Nature. 406(3), 536–540 (2000)Google Scholar
  4. 4.
    Burke, W., Psaty, B.M.: Personalized medicine in the era of genomics. JAMA. 298(14), 1682–1684 (2007)CrossRefGoogle Scholar
  5. 5.
    Teutsch, M. et al.: The evaluation of genomic applications in practice and prevention (EGAPP) initiative:methods of the EGAPP working group. Genet. Med. 11(1), 3–14 (2009)Google Scholar
  6. 6.
    Guelzim, N. et al.: Topological and causal structure of the yeast transcriptional regulatory network. Nat. Genet. 31, 60–63 (2002)Google Scholar
  7. 7.
    Dougherty, E.R., Kim, S., Chen, Y.: Coefficient of determination in nonlinear signal processing. Signal Process. 80(10), 2219–2235 (2000)CrossRefMATHGoogle Scholar
  8. 8.
    Zhao, W., Serpendin, E., Dougherty, E.R.: Inferring connectivity of genetic regulatory networks using information-theoretic criteria. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 5(2), 262–274 (2008)CrossRefGoogle Scholar
  9. 9.
    Een, N., Sorensson, N.: The minisat page http://minisat.se/. Accessed 6 April 2010
  10. 10.
    Zhou,W, Wang, X., Dougherty, E.R: Gene prediction using multinomial probit regression with Bayesian gene selection. EURASIP J. App. Signal. Process. 115–124 (2004)Google Scholar
  11. 11.
    Zhou, W., Serpendin, E., Dougherty, E.R.: Inferring gene regulatory networks from time series data using the minimum description length principle. Bioinformatics, 17, 2129–2135 (2006)CrossRefGoogle Scholar
  12. 12.
    Pal R., Ivanov I., Datta A., Bittner M.L., Dougherty E.R.: Generating Boolean networks with a prescribed attractor structure. Bioinformatics, 21(21), 4021–4025 (2005)CrossRefGoogle Scholar
  13. 13.
    Kauffman S.A.: The Origins of Order: Self-Organization and Selection in Evolution (1 edn). Oxford University Press, USA 1993Google Scholar
  14. 14.
    Een N., Sorensson N.: An Extensible SAT-solver, Lecture Notes in Computer Science. springer berlin, Heidelberg, 2004Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Electrical and Computer EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations