{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T16:53:57Z","timestamp":1694710437562},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"unspecified","delay-in-days":64,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2015,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The supertree construction problem is about combining several phylogenetic trees with possibly conflicting information into a single tree that has all the leaves of the source trees as its leaves and the relationships between the leaves are as consistent with the source trees as possible. This leads to an optimization problem that is computationally challenging and typically heuristic methods, such as matrix representation with parsimony (MRP), are used. In this paper we consider the use of answer set programming to solve the supertree construction problem in terms of two alternative encodings. The first is based on an existing encoding of trees using substructures known as quartets, while the other novel encoding captures the relationships present in trees through direct projections. We use these encodings to compute a genus-level supertree for the family of cats (Felidae). Furthermore, we compare our results to recent supertrees obtained by the MRP method.<\/jats:p>","DOI":"10.1017\/s1471068415000265","type":"journal-article","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T08:21:21Z","timestamp":1441268481000},"page":"604-619","source":"Crossref","is-referenced-by-count":10,"title":["Optimizing phylogenetic supertrees using answer set programming"],"prefix":"10.1017","volume":"15","author":[{"given":"LAURA","family":"KOPONEN","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"EMILIA","family":"OIKARINEN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TOMI","family":"JANHUNEN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LAURA","family":"S\u00c4IL\u00c4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"S1471068415000265_ref19","doi-asserted-by":"crossref","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume-title":"Answer Set Solving in Practice","author":"Gebser","year":"2012"},{"key":"S1471068415000265_ref4","doi-asserted-by":"publisher","DOI":"10.2307\/1222480"},{"key":"S1471068415000265_ref14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R"},{"key":"S1471068415000265_ref21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: The Potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Commun."},{"key":"S1471068415000265_ref41","doi-asserted-by":"publisher","DOI":"10.1080\/10635150590950362"},{"key":"S1471068415000265_ref6","first-page":"166","volume-title":"Proceedings of the 14th European Conference on Logics in Artificial Intelligence, JELIA 2014","author":"Bomanson","year":"2014"},{"key":"S1471068415000265_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9_9"},{"key":"S1471068415000265_ref39","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-6-7"},{"key":"S1471068415000265_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(82)80004-3"},{"key":"S1471068415000265_ref11","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/061\/10"},{"key":"S1471068415000265_ref18","first-page":"351","volume-title":"Proceedings of the 21st European Conference on Artificial Intelligence, ECAI 2014","author":"Gebser","year":"2014"},{"key":"S1471068415000265_ref40","doi-asserted-by":"publisher","DOI":"10.1080\/10635150590949832"},{"key":"S1471068415000265_ref27","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing, SAT 2014","author":"Martins","year":"2014"},{"key":"S1471068415000265_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/1055-7903(92)90035-F"},{"key":"S1471068415000265_ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.26"},{"key":"S1471068415000265_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00202-X"},{"key":"S1471068415000265_ref15","doi-asserted-by":"publisher","DOI":"10.1080\/10635150590923326"},{"key":"S1471068415000265_ref8","unstructured":"Bryant D. 1997. Building trees, hunting for trees, and comparing trees. Ph.D. thesis, University of Canterbury."},{"key":"S1471068415000265_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1854776.1854800"},{"key":"S1471068415000265_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0210030"},{"key":"S1471068415000265_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(86)90161-6"},{"key":"S1471068415000265_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068415000265_ref25","first-page":"359","volume-title":"Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012","author":"Le","year":"2012"},{"key":"S1471068415000265_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2006.05.025"},{"key":"S1471068415000265_ref20","first-page":"502","volume-title":"Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009","author":"Gebser","year":"2009"},{"key":"S1471068415000265_ref2","volume-title":"Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2015","author":"Alviano","year":"2015"},{"key":"S1471068415000265_ref24","first-page":"452","volume-title":"Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2006","author":"Kavanagh","year":"2006"},{"key":"S1471068415000265_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_63"},{"key":"S1471068415000265_ref28","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3233\/FI-2010-311","article-title":"Combinatorial optimization solutions for the maximum quartet consistency problem","volume":"102","author":"Morgado","year":"2010","journal-title":"Fundam. Inform."},{"key":"S1471068415000265_ref34","article-title":"Taxon replacement: Invasion or speciation? First results for a supertree of Neogene mammals","volume":"31","author":"S\u00e4il\u00e4","year":"2011","journal-title":"Journal of Vertebrate Paleontology"},{"key":"S1471068415000265_ref29","doi-asserted-by":"publisher","DOI":"10.1111\/j.1096-0031.1999.tb00277.x"},{"key":"S1471068415000265_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2011.06.021"},{"key":"S1471068415000265_ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.1008"},{"key":"S1471068415000265_ref33","volume-title":"Proceedings of 60th Annual Symposium of Vertebrate Palaeontology and Comparative anatomy, SVPCA 2012","author":"S\u00e4il\u00e4","year":"2012"},{"key":"S1471068415000265_ref31","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/44.2.251"},{"key":"S1471068415000265_ref38","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/49.2.363"},{"key":"S1471068415000265_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9"},{"key":"S1471068415000265_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9082-1"},{"key":"S1471068415000265_ref26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","article-title":"The Sat4j library, release 2.2","volume":"7","author":"Le Berre","year":"2010","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"S1471068415000265_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.03.004"},{"key":"S1471068415000265_ref23","doi-asserted-by":"publisher","DOI":"10.1111\/j.1096-0031.2002.tb00289.x"},{"key":"S1471068415000265_ref10","first-page":"6","article-title":"A phylogenetic supertree of the hammerhead sharks (Carcharhiniformes, Sphyrnidae)","volume":"46","author":"Cavalcanti","year":"2007","journal-title":"Zoological Studies"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068415000265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:12:40Z","timestamp":1599520360000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068415000265\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":42,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["S1471068415000265"],"URL":"https:\/\/doi.org\/10.1017\/s1471068415000265","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}