{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:19:59Z","timestamp":1740158399721,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13218-018-0551-y","type":"journal-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T04:55:13Z","timestamp":1529297713000},"page":"157-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ASP Applications in Bio-informatics: A Short Tour"],"prefix":"10.1007","volume":"32","author":[{"given":"Alessandro","family":"Dal Pal\u00f9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2052-8593","authenticated-orcid":false,"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"551_CR1","first-page":"20","volume":"12","author":"EB Abdallah","year":"2017","unstructured":"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","journal-title":"AMB"},{"key":"551_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1126\/science.181.4096.223","volume":"181","author":"CB Anfinsen","year":"1973","unstructured":"Anfinsen CB (1973) Principles that govern the folding of protein chains. Science 181:223\u2013230","journal-title":"Science"},{"key":"551_CR3","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1613\/jair.4193","volume":"48","author":"F Campeotto","year":"2013","unstructured":"Campeotto F, Dal Pal\u00f9 A, Dovier A, Fioretto F, Pontelli E (2013) A constraint solver for flexible protein model. JAIR 48:953\u20131000","journal-title":"JAIR"},{"key":"551_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470488065","volume-title":"Biomolecular networks: methods and applications in systems biology","author":"L Chen","year":"2009","unstructured":"Chen L, Wang RS, Zhang XS (2009) Biomolecular networks: methods and applications in systems biology. Wiley, Hoboken"},{"key":"551_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1186\/1471-2105-12-98","volume":"12","author":"B Chisham","year":"2011","unstructured":"Chisham B, Wright B, Le T, Son T, Pontelli E (2011) CDAO-store: ontology-driven data integration for phylogenetic analysis. BMC Bioinform 12:98","journal-title":"BMC Bioinform"},{"key":"551_CR6","volume-title":"Computational molecular biology: an introduction","author":"P Clote","year":"2001","unstructured":"Clote P, Backofen R (2001) Computational molecular biology: an introduction. Wiley, Hoboken"},{"issue":"2","key":"551_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/1031120.1031122","volume":"36","author":"J Cohen","year":"2004","unstructured":"Cohen J (2004) Bioinformatics: an introduction for computer scientists. ACM Comput Surv 36(2):122\u2013158","journal-title":"ACM Comput Surv"},{"key":"551_CR8","first-page":"245","volume-title":"LPNMR\u201913, LNCS","author":"G Collet","year":"2013","unstructured":"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\u201913, LNCS, vol 8148. Springer, Berlin, pp 245\u2013256"},{"key":"551_CR9","first-page":"25","volume-title":"IPCAT 2012, LNCS","author":"F Corblin","year":"2012","unstructured":"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\u201330"},{"key":"551_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1038\/227561a0","volume":"227","author":"F Crick","year":"1970","unstructured":"Crick F (1970) Central dogma of molecular biology. Nature 227:561\u2013563","journal-title":"Nature"},{"key":"551_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1186\/1471-2105-5-186","volume":"5","author":"A Pal\u00f9 Dal","year":"2004","unstructured":"Dal Pal\u00f9 A, Dovier A, Fogolari F (2004) Constraint logic programming approach to protein structure prediction. BMC Bioinform 5:186","journal-title":"BMC Bioinform"},{"issue":"4\u20136","key":"551_CR12","first-page":"709","volume":"10","author":"A Pal\u00f9 Dal","year":"2010","unstructured":"Dal Pal\u00f9 A, Dovier A, Fogolari F, Pontelli E (2010) CLP-based protein fragment assembly. TPLP 10(4\u20136):709\u2013724","journal-title":"TPLP"},{"key":"551_CR13","doi-asserted-by":"crossref","unstructured":"Dal Pal\u00f9 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)","DOI":"10.1145\/3191315.3191323"},{"issue":"3","key":"551_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.2307\/4444260","volume":"35","author":"T Dobzhansky","year":"1973","unstructured":"Dobzhansky T (1973) Nothing in biology makes sense except in the light of evolution. Am Biol Teach 35(3):125\u2013129","journal-title":"Am Biol Teach"},{"issue":"2","key":"551_CR15","first-page":"79","volume":"21","author":"A Dovier","year":"2009","unstructured":"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\u2013121","journal-title":"JETAI"},{"key":"551_CR16","first-page":"259","volume-title":"LP, KR, and NMR, LNCS","author":"A Dovier","year":"2011","unstructured":"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\u2013279"},{"issue":"1\u20132","key":"551_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10601-007-9031-y","volume":"13","author":"S Dworschak","year":"2008","unstructured":"Dworschak S, Grell S, Nikiforova VJ, Schaub T, Selbig J (2008) Modeling biological networks by action languages via answer set programming. Constraints 13(1\u20132):21\u201365","journal-title":"Constraints"},{"key":"551_CR18","doi-asserted-by":"crossref","unstructured":"Dworschak S, Grote T, K\u00f6nig 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\u20135, 2008, Dayton, Ohio, USA, vol 1. IEEE Computer Society 2008, ISBN 978-0-7695-3440-4","DOI":"10.1109\/ICTAI.2008.69"},{"key":"551_CR19","first-page":"415","volume-title":"LP, KR, and NMR","author":"E Erdem","year":"2011","unstructured":"Erdem E (2011) Applications of answer set programming in phylogenetic systematics. LP, KR, and NMR, vol 6565. Springer, Berlin, pp 415\u2013431"},{"issue":"3","key":"551_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem E, Gelfond M, Leone N (2016) Applications of answer set programming. AI Mag 37(3):53\u201368","journal-title":"AI Mag"},{"key":"551_CR21","unstructured":"Erdem E, T\u00fcre 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\u201317, 2008. AAAI Press. ISBN 978-1-57735-368-3"},{"key":"551_CR22","doi-asserted-by":"crossref","unstructured":"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\u201315, 1996, DIMACS series in discrete mathematics and theoretical computer science, vol 37, DIMACS\/AMS 1997","DOI":"10.1090\/dimacs\/037\/01"},{"key":"551_CR23","doi-asserted-by":"crossref","unstructured":"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\u20134, 2009. IEEE Computer Society, ISBN 978-0-7695-3885-3","DOI":"10.1109\/BIBM.2009.9"},{"issue":"2","key":"551_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1504\/IJDMB.2011.039178","volume":"5","author":"T Fayruzov","year":"2011","unstructured":"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\u2013229","journal-title":"IJDMB"},{"issue":"1","key":"551_CR25","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1186\/s13015-017-0110-3","volume":"12","author":"LF Fitime","year":"2017","unstructured":"Fitime LF, Roux O, Guziolowski C, Paulev\u00e9 L (2017) Identification of bifurcation transitions in biological regulatory networks using answer-set programming. Algorithms Mol Biol 12(1):19:1\u201319:14","journal-title":"Algorithms Mol Biol"},{"key":"551_CR26","first-page":"166","volume-title":"CMSB, LNCS","author":"M Folschette","year":"2012","unstructured":"Folschette M, Paulev\u00e9 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\u2013186"},{"key":"551_CR27","doi-asserted-by":"crossref","unstructured":"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\u2013321","DOI":"10.1007\/978-3-319-61660-5_28"},{"key":"551_CR28","volume-title":"KR","author":"M Gebser","year":"2010","unstructured":"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\u0144ski M (eds) KR. AAAI Press, Palo Alto"},{"issue":"2\u20133","key":"551_CR29","first-page":"323","volume":"11","author":"M Gebser","year":"2011","unstructured":"Gebser M, Schaub T, Thiele S, Veber P (2011) Detecting inconsistencies in large biological networks with answer set programming. TPLP 11(2\u20133):323\u2013360","journal-title":"TPLP"},{"issue":"18","key":"551_CR30","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1093\/bioinformatics\/btt393","volume":"29","author":"C Guziolowski","year":"2013","unstructured":"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\u20132326","journal-title":"Bioinformatics"},{"key":"551_CR31","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1038\/nature03001","volume":"431","author":"International Human Genome Sequencing Consortium","year":"2004","unstructured":"International Human Genome Sequencing Consortium (2004) Finishing the euchromatic sequence of the human genome. Nature 431:931\u2013945","journal-title":"Nature"},{"key":"551_CR32","unstructured":"Jones NC, Pevzner P (2004) An introduction to bioinformatics algorithms. Computational molecular biology. MIT Press, Cambridge, London (2004)"},{"key":"551_CR33","first-page":"452","volume-title":"Proc of LPAR, LNCS","author":"J Kavanagh","year":"2006","unstructured":"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\u2013466"},{"issue":"4\u20135","key":"551_CR34","first-page":"604","volume":"15","author":"L Koponen","year":"2015","unstructured":"Koponen L, Oikarinen E, Janhunen T, S\u00e4il\u00e4 L (2015) Optimizing phylogenetic supertrees using answer set programming. TPLP 15(4\u20135):604\u2013619","journal-title":"TPLP"},{"issue":"4","key":"551_CR35","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1287\/ijoc.1040.0085","volume":"16","author":"G Lancia","year":"2004","unstructured":"Lancia G, Pinotti MC, Rizzi R (2004) Haplotyping populations by pure parsimony. INFORMS J Comput 16(4):348\u2013359","journal-title":"INFORMS J Comput"},{"key":"551_CR36","unstructured":"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\u20138, 2012, Budapest, Hungary. LIPIcs 17, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, ISBN 978-3-939897-43-9"},{"key":"551_CR37","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.biosystems.2016.07.009","volume":"149","author":"M Ostrowski","year":"2016","unstructured":"Ostrowski M, Paulev\u00e9 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\u2013153","journal-title":"Biosystems"},{"key":"551_CR38","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4137\/EBO.S2320","volume":"5","author":"F Prosdocimi","year":"2009","unstructured":"Prosdocimi F, Chisham B, Pontelli E, Thompson J, Stoltzfus A (2009) Initial implementation of a comparative data analysis ontology. Evol Bioinform 5:47\u201366","journal-title":"Evol Bioinform"},{"key":"551_CR39","first-page":"167","volume-title":"ANB, LNCS","author":"O Ray","year":"2011","unstructured":"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\u2013183"},{"key":"551_CR40","first-page":"312","volume-title":"Proc of ICLP, LNCS","author":"T Schaub","year":"2009","unstructured":"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\u2013326"},{"key":"551_CR41","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1186\/1471-2105-14-158","volume":"14","author":"A Stoltzfus","year":"2013","unstructured":"Stoltzfus A et al (2013) Phylotastic! making tree-of-life knowledge accessible, reusable and convenient. BMC Bioinform 14:158","journal-title":"BMC Bioinform"},{"issue":"2\u20134","key":"551_CR42","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10472-008-9091-8","volume":"51","author":"N Tran","year":"2007","unstructured":"Tran N, Baral C (2007) Reasoning about non-immediate triggers in biological networks. Ann Math Artif Intell 51(2\u20134):267\u2013293","journal-title":"Ann Math Artif Intell"},{"issue":"3","key":"551_CR43","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.jal.2008.10.001","volume":"7","author":"N Tran","year":"2009","unstructured":"Tran N, Baral C (2009) Hypothesizing about signaling networks. J Appl Logic 7(3):253\u2013274","journal-title":"J Appl Logic"},{"issue":"1","key":"551_CR44","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TCBB.2007.1008","volume":"4","author":"G Wu","year":"2007","unstructured":"Wu G, You J, Lin G (2007) Quartet-based phylogeny reconstruction with answer set programming. IEEE\/ACM Trans Comput Biol Bioinform 4(1):139\u2013152","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-018-0551-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0551-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0551-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T19:26:29Z","timestamp":1560799589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-018-0551-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":44,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["551"],"URL":"https:\/\/doi.org\/10.1007\/s13218-018-0551-y","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"type":"print","value":"0933-1875"},{"type":"electronic","value":"1610-1987"}],"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"15 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}