Skip to main content

An ASP Application in Integrative Biology: Identification of Functional Gene Units

  • Conference paper
  • 996 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8148))

Abstract

Integrating heterogeneous knowledge is necessary to elucidate the regulations in biological systems. In particular, such an integration is widely used to identify functional units, that are sets of genes that can be triggered by the same external stimuli, as biological stresses, and that are linked to similar responses of the system. Although several models and algorithms shown great success for detecting functional units on well-known biological species, they fail in identifying them when applied to more exotic species, such as extremophiles, that are by nature unrefined. Indeed, approved methods on unrefined models suffer from an explosion in the number of solutions for functional units, that are merely combinatorial variations of the same set of genes. This paper overcomes this crucial limitation by introducing the concept of “genome segments”. As a natural extension of recent studies, we rely on the declarative modeling power of answer set programming (ASP) to encode the identification of shortest genome segments (SGS). This study shows, via experimental evidences, that SGS is a new model of functional units with a predictive power that is comparable to existing methods. We also demonstrate that, contrary to existing methods, SGS are stable in (i) computational time and (ii) ability to predict functional units when one deteriorates the biological knowledge, which simulates cases that occur for exotic species.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rocha, E.P.C.: The organization of the bacterial genome. Annual Review of Genetics 42, 211–233 (2008)

    Article  MathSciNet  Google Scholar 

  2. Boyer, F., Morgat, A., Labarre, L., Pothier, J., Viari, A.: Syntons, metabolons and interactons: an exact graph-theoretical approach for exploring neighbourhood between genomic and functional data. Bioinformatics 21, 4209–4215 (2005)

    Article  Google Scholar 

  3. Zhang, H.H., Yin, Y.Y., Olman, V.V., Xu, Y.Y.: Genomic arrangement of regulons in bacterial genomes. PLoS ONE 7, e29496–e29496 (2011)

    Google Scholar 

  4. Bordron, P., Eveillard, D., Rusu, I.: Integrated analysis of the gene neighbouring impact on bacterial metabolic networks. IET Systems Biology 5, 261–268 (2011)

    Article  Google Scholar 

  5. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)

    Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user’s guide to gringo, clasp, clingo, and iclingo (2010), http://potassco.sourceforge.net

  7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 386–392. AAAI Press/The MIT Press (2007)

    Google Scholar 

  8. Schaub, T., Thiele, S.: Metabolic network expansion with answer set programming. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 312–326. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Fayruzov, T., Cock, M.D., Cornelis, C., Vermeir, D.: Modeling protein interaction networks with answer set programming. In: IEEE Int. Conf. on Bioinformatics and Biomedicine, BIBM 2009, pp. 99–104 (2009)

    Google Scholar 

  10. Durzinsky, M., Marwan, W., Ostrowski, M., Schaub, T., Wagler, A.: Automatic network reconstruction using ASP. Theory and Practice of Logic Programming 11, 749–766 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Papatheodorou, I., Ziehm, M., Wieser, D., Alic, N., Partridge, L., Thornton, J.M.: Using answer set programming to integrate rna expression with signalling pathway information to infer how mutations affect ageing. PLoS ONE 7, e50881 (2012)

    Google Scholar 

  12. Gebser, M., Kaminski, R., Schaub, T.: Complex optimization in answer set programming. Theory and Practice of Logic Programming 11, 821–839 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Brouwer, R.W.W., Kuipers, O.P., van Hijum, S.A.F.T.: The relative value of operon predictions. Briefings in Bioinformatics 9, 367–375 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bordron, P., Eveillard, D., Maass, A., Siegel, A., Thiele, S. (2013). An ASP Application in Integrative Biology: Identification of Functional Gene Units. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40564-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40563-1

  • Online ISBN: 978-3-642-40564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics