Skip to main content
SpringerLink
Log in

ASP Applications in Bio-informatics: A Short Tour

  • Technical Contribution
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

Abstract

We report on how the declarative nature of Answer Set Programming allows one to model and solve some well-known and challenging classes of problems in the general domain of bioinformatics. We briefly survey the main results appeared in the areas of genomics, structure prediction, and systems biology.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Abdallah EB, Folschette M, Roux O, Magnin M (2017) ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks. AMB 12:20

    Google Scholar 

  2. Anfinsen CB (1973) Principles that govern the folding of protein chains. Science 181:223–230

    Article  Google Scholar 

  3. Campeotto F, Dal Palù A, Dovier A, Fioretto F, Pontelli E (2013) A constraint solver for flexible protein model. JAIR 48:953–1000

    Article  MathSciNet  Google Scholar 

  4. Chen L, Wang RS, Zhang XS (2009) Biomolecular networks: methods and applications in systems biology. Wiley, Hoboken

    Book  Google Scholar 

  5. Chisham B, Wright B, Le T, Son T, Pontelli E (2011) CDAO-store: ontology-driven data integration for phylogenetic analysis. BMC Bioinform 12:98

    Article  Google Scholar 

  6. Clote P, Backofen R (2001) Computational molecular biology: an introduction. Wiley, Hoboken

    MATH  Google Scholar 

  7. Cohen J (2004) Bioinformatics: an introduction for computer scientists. ACM Comput Surv 36(2):122–158

    Article  Google Scholar 

  8. Collet G, Eveillard D, Gebser M, Prigent S, Schaub T, Siegel A, Thiele S (2013) Extending the metabolic network of Ectocarpus siliculosus using answer set programming. In: Cabalar P, Son T (eds) LPNMR’13, LNCS, vol 8148. Springer, Berlin, pp 245–256

    Google Scholar 

  9. Corblin F, Fanchon E, Trilling L, Chaouiya C, Thieffry D (2012) Automatic inference of regulatory and dynamical properties from incomplete gene interaction and expression data. IPCAT 2012, LNCS, vol 7223. Springer, Berlin, pp 25–30

    Google Scholar 

  10. Crick F (1970) Central dogma of molecular biology. Nature 227:561–563

    Article  Google Scholar 

  11. Dal Palù A, Dovier A, Fogolari F (2004) Constraint logic programming approach to protein structure prediction. BMC Bioinform 5:186

    Article  MATH  Google Scholar 

  12. Dal Palù A, Dovier A, Fogolari F, Pontelli E (2010) CLP-based protein fragment assembly. TPLP 10(4–6):709–724

    MathSciNet  MATH  Google Scholar 

  13. Dal Palù A, Dovier A, Formisano A, Pontelli E (2018) Exploring life: answer set programming in bioinformatics. In: Kifer M, Liu YA (eds) Declarative logic programming: theory, systems, and applications, Chap 7. ACM Press (to appear)

  14. Dobzhansky T (1973) Nothing in biology makes sense except in the light of evolution. Am Biol Teach 35(3):125–129

    Article  Google Scholar 

  15. Dovier A, Formisano A, Pontelli E (2009) An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems. JETAI 21(2):79–121

    MATH  Google Scholar 

  16. Dovier A, Formisano A, Pontelli E (2011) Perspectives on logic-based approaches for reasoning about actions and change. In: Balduccini M, Son TC (eds) LP, KR, and NMR, LNCS, vol 6565. Springer, Berlin, pp 259–279

    Google Scholar 

  17. Dworschak S, Grell S, Nikiforova VJ, Schaub T, Selbig J (2008) Modeling biological networks by action languages via answer set programming. Constraints 13(1–2):21–65

    Article  MathSciNet  MATH  Google Scholar 

  18. Dworschak S, Grote T, König A, Schaub T, Veber P (2008) The system BioC for reasoning about biological models in action language C. In: 20th IEEE international conference on tools with artificial intelligence (ICTAI 2008), November 3–5, 2008, Dayton, Ohio, USA, vol 1. IEEE Computer Society 2008, ISBN 978-0-7695-3440-4

  19. Erdem E (2011) Applications of answer set programming in phylogenetic systematics. LP, KR, and NMR, vol 6565. Springer, Berlin, pp 415–431

    Google Scholar 

  20. Erdem E, Gelfond M, Leone N (2016) Applications of answer set programming. AI Mag 37(3):53–68

    Article  Google Scholar 

  21. Erdem E, Türe F (2008) Efficient haplotype inference with answer set programming. In: Fox D, Gomes CP (eds) Proceedings of the 23rd AAAI conference on artificial intelligence, AAAI 2008, Chicago, Illinois, USA, July 13–17, 2008. AAAI Press. ISBN 978-1-57735-368-3

  22. Estabrook G (1997) Ancestor-descendant relations and incompatible data: motivation for research in discrete mathematics. In: Mirkin B, McMorris FR, Roberts FS, Rzhetsky A (eds) Mathematical hierarchies and biology, Proceedings of a DIMACS workshop, November 13–15, 1996, DIMACS series in discrete mathematics and theoretical computer science, vol 37, DIMACS/AMS 1997

  23. Fayruzov T, Cock MD, Cornelis C, Vermeir D (2009) Modeling protein interaction networks with answer set programming. In: Proceedings of 2009 IEEE international conference on bioinformatics and biomedicine, BIBM 2009, Washington, DC, USA, November 1–4, 2009. IEEE Computer Society, ISBN 978-0-7695-3885-3

  24. Fayruzov T, Janssen J, Vermeir D, Cornelis C, Cock MD (2011) Modelling gene and protein regulatory networks with answer set programming. IJDMB 5(2):209–229

    Article  Google Scholar 

  25. Fitime LF, Roux O, Guziolowski C, Paulevé L (2017) Identification of bifurcation transitions in biological regulatory networks using answer-set programming. Algorithms Mol Biol 12(1):19:1–19:14

    Article  Google Scholar 

  26. Folschette M, Paulevé L, Inoue K, Magnin M, Roux O (2012) Concretizing the process hitting into biological regulatory networks. In: Gilbert D, Heiner M (eds) CMSB, LNCS, vol 7605. Springer, Berlin, pp 166–186

    Google Scholar 

  27. Frioux C, Schaub T, Schellhorn S, Siegel A, Wanko P (2017) Hybrid metabolic network completion. In: Balduccini M, Janhunen T (eds) LPNMR 2017, LNCS, vol 10377. Springer, Berlin, pp 308–321

  28. Gebser M, Guziolowski C, Ivanchev M, Schaub T, Siegel A, Thiele S, Veber P (2010) Repair and prediction (under inconsistency) in large biological networks with answer set programming. In: Lin F, Sattler U, Truszczyński M (eds) KR. AAAI Press, Palo Alto

    Google Scholar 

  29. Gebser M, Schaub T, Thiele S, Veber P (2011) Detecting inconsistencies in large biological networks with answer set programming. TPLP 11(2–3):323–360

    MathSciNet  MATH  Google Scholar 

  30. Guziolowski C, Videla S, Eduati F, Thiele S, Cokelaer T, Siegel A, Saez-Rodriguez J (2013) Exhaustively characterizing feasible logic models of a signaling network using answer set programming. Bioinformatics 29(18):2320–2326

    Article  Google Scholar 

  31. International Human Genome Sequencing Consortium (2004) Finishing the euchromatic sequence of the human genome. Nature 431:931–945

    Article  Google Scholar 

  32. Jones NC, Pevzner P (2004) An introduction to bioinformatics algorithms. Computational molecular biology. MIT Press, Cambridge, London (2004)

  33. Kavanagh J, Mitchell DG, Ternovska E, Manuch J, Zhao X, Gupta A (2006) Constructing Camin-Sokal phylogenies via answer set programming. In: Hermann M, Voronkov A (eds) Proc of LPAR, LNCS, vol 4246. Springer, Berlin, pp 452–466

    Google Scholar 

  34. Koponen L, Oikarinen E, Janhunen T, Säilä L (2015) Optimizing phylogenetic supertrees using answer set programming. TPLP 15(4–5):604–619

    MathSciNet  MATH  Google Scholar 

  35. Lancia G, Pinotti MC, Rizzi R (2004) Haplotyping populations by pure parsimony. INFORMS J Comput 16(4):348–359

    Article  MathSciNet  MATH  Google Scholar 

  36. Le T, Nguyen H, Pontelli E, Son T (2012) ASP at work: an ASP implementation of PhyloWS. In: Dovier A, Santos Costa V (eds) Technical communications of the 28th international conference on logic programming, ICLP 2012, September 4–8, 2012, Budapest, Hungary. LIPIcs 17, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, ISBN 978-3-939897-43-9

  37. Ostrowski M, Paulevé L, Schaub T, Siegel A, Guziolowski C (2016) Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming. Biosystems 149:139–153

    Article  Google Scholar 

  38. Prosdocimi F, Chisham B, Pontelli E, Thompson J, Stoltzfus A (2009) Initial implementation of a comparative data analysis ontology. Evol Bioinform 5:47–66

    Article  Google Scholar 

  39. Ray O, Soh T, Inoue K (2011) Analyzing pathways using ASP-based approaches. In: Horimoto K, Nakatsui M, Popov N (eds) ANB, LNCS, vol 6479. Springer, Berlin, pp 167–183

    Google Scholar 

  40. Schaub T, Thiele S (2009) Metabolic network expansion with answer set programming. In: Hill PM, Warren DS (eds) Proc of ICLP, LNCS, vol 5649. Springer, Berlin, pp 312–326

    Google Scholar 

  41. Stoltzfus A et al (2013) Phylotastic! making tree-of-life knowledge accessible, reusable and convenient. BMC Bioinform 14:158

    Article  Google Scholar 

  42. Tran N, Baral C (2007) Reasoning about non-immediate triggers in biological networks. Ann Math Artif Intell 51(2–4):267–293

    Article  MathSciNet  MATH  Google Scholar 

  43. Tran N, Baral C (2009) Hypothesizing about signaling networks. J Appl Logic 7(3):253–274

    Article  MathSciNet  MATH  Google Scholar 

  44. Wu G, You J, Lin G (2007) Quartet-based phylogeny reconstruction with answer set programming. IEEE/ACM Trans Comput Biol Bioinform 4(1):139–152

    Article  Google Scholar 

Download references

Acknowledgements

This work is partially supported by projects GNCS 2017, PRID UNIUD ENCASE, YASMIN, and CLTP, and NSF Grants 1458595, 1440911, 1401639, and 1345232. A. Dal Palù, A. Dovier, and A. Formisano are IN\(\delta\)AM GNCS-members.

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Matematiche, Fisiche e Informatiche, University of Parma, Parma, Italy

    Alessandro Dal Palù

  2. Dipartimento di Scienze Matematiche, Informatiche e Fisiche, University of Udine, Udine, Italy

    Agostino Dovier

  3. Dipartimento di Matematica e Informatica, University of Perugia, Perugia, Italy

    Andrea Formisano

  4. Department of Computer Science, New Mexico State University, Las Cruces, NM, USA

    Enrico Pontelli

Authors
  1. Alessandro Dal Palù
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Agostino Dovier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrea Formisano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Enrico Pontelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Agostino Dovier.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dal Palù, A., Dovier, A., Formisano, A. et al. ASP Applications in Bio-informatics: A Short Tour. Künstl Intell 32, 157–164 (2018). https://doi.org/10.1007/s13218-018-0551-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-018-0551-y

Keywords

Search

Navigation