{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:24:18Z","timestamp":1743150258529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_15","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"193-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resolving Unresolved Resolved and\u00a0Unresolved Triplets Consistency Problems"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Harvey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miko\u0142aj","family":"Marciniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukihiro","family":"Murakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1038\/nature07347","volume":"456","author":"ORP Bininda-Emonds","year":"2008","unstructured":"Bininda-Emonds, O.R.P., et al.: The delayed rise of present-day mammals. Nature 456, 274 (2008)","journal-title":"Nature"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tree.2004.03.015","volume":"19","author":"ORP Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: The evolution of supertrees. Trends Ecol. Evol. 19(6), 315\u2013322 (2004)","journal-title":"Trends Ecol. Evol."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three taxon ML trees with variable rates across sites. Discrete Appl. Math. 155(6), 750\u2013758 (2007). Computational Molecular Biology Series, Issue V","DOI":"10.1016\/j.dam.2005.05.043"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01202270","volume":"12","author":"M Constantinescu","year":"1995","unstructured":"Constantinescu, M., Sankoff, D.: An efficient algorithm for supertrees. J. Classif. 12, 101\u2013112 (1995)","journal-title":"J. Classif."},{"key":"15_CR6","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer (2003)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TCBB.2010.77","volume":"8","author":"S Guillemot","year":"2009","unstructured":"Guillemot, S., Jansson, J., Sung, W.-K.: Computing a smallest multi-labeled phylogenetic tree from rooted triplets. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8, 1141\u20131147 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0219720006001709","volume":"4","author":"Y-J He","year":"2006","unstructured":"He, Y.-J., Huynh, T.N.D., Jansson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. J. Bioinform. Comput. Biol. 4, 59\u201374 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-015-0069-8","volume":"77","author":"K Huber","year":"2014","unstructured":"Huber, K., van Iersel, L., Moulton, V., Scornavacca, C., Wu, T.: Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. Algorithmica 77, 173\u2013200 (2014)","journal-title":"Algorithmica"},{"issue":"7","key":"15_CR10","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1089\/cmb.2017.0256","volume":"25","author":"J Jansson","year":"2018","unstructured":"Jansson, J., Lingas, A., Rajaby, R., Sung, W.-K.: Determining the consistency of resolved triplets and fan triplets. J. Comput. Biol. 25(7), 740\u2013754 (2018). PMID: 29451395","journal-title":"J. Comput. Biol."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J Jansson","year":"2006","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J. Comput. 35, 1098\u20131121 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"15_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"MP Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0166-218X(02)00250-0","volume":"127","author":"C Semple","year":"2003","unstructured":"Semple, C.: Reconstructing minimal rooted trees. Discrete Appl. Math. 127(3), 489\u2013503 (2003)","journal-title":"Discrete Appl. Math."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1093\/bioinformatics\/bth246","volume":"20","author":"C Semple","year":"2004","unstructured":"Semple, C., Daniel, P., Hordijk, W., Page, R., Steel, M.: Supertree algorithms for ancestral divergence dates and nested taxa. Bioinformatics 20, 2355\u20132360 (2004)","journal-title":"Bioinformatics"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S Snir","year":"2006","unstructured":"Snir, S., Rao, S.: Using max cut to enhance rooted trees consistency. IEEE\/ACM Trans. Comput. Biol. Bioinf. 3, 323\u2013333 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Sung, W.-K.: Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC (2009)","DOI":"10.1201\/9781420070347"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.bulm.2004.04.006","volume":"66","author":"S Willson","year":"2004","unstructured":"Willson, S.: Constructing rooted supertrees using distances. Bull. Math. Biol. 66, 1755\u20131783 (2004)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:12:48Z","timestamp":1718975568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}