{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:07Z","timestamp":1725795607600},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079523"},{"type":"electronic","value":"9783319079530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07953-0_6","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:58:08Z","timestamp":1402419488000},"page":"71-82","source":"Crossref","is-referenced-by-count":1,"title":["On Low Treewidth Graphs and Supertrees"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nela","family":"Leki\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A. Aho","year":"1981","unstructured":"Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Bininda-Emonds, O.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Kluwer Academic Publishers (2004)","key":"6_CR2","DOI":"10.1007\/978-1-4020-2330-9"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Information and Computation\u00a0208(3), 259\u2013275 (2010)","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.tcs.2005.10.033","volume":"351","author":"D. Bryant","year":"2006","unstructured":"Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theoretical Computer Science\u00a0351(3), 296\u2013302 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: he monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation\u00a085(1), 12\u201375 (1990)","journal-title":"Information and Computation"},{"unstructured":"Diestel, R.: Graph Theory. Springer-Verlag Berlin and Heidelberg GmbH & Company KG (2000)","key":"6_CR6"},{"doi-asserted-by":"crossref","unstructured":"Dress, A., Huber, K.T., Koolen, J.: Basic Phylogenetic Combinatorics. Cambridge University Press (2012)","key":"6_CR7","DOI":"10.1017\/CBO9781139019767"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45753-4_12","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"G. Ganapathy","year":"2002","unstructured":"Ganapathy, G., Warnow, T.J.: Approximating the complement of the maximum compatible subset of leaves of k trees. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 122\u2013134. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Gr\u00fcnewald, S., Humphries, P.J., Semple, C.: Quartet compatibility and the quartet graph. Electronic Journal of Combinatorics\u00a015(1) (2008)","key":"6_CR9","DOI":"10.37236\/827"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-33122-0_8","volume-title":"Algorithms in Bioinformatics","author":"R. Gysel","year":"2012","unstructured":"Gysel, R., Stevens, K., Gusfield, D.: Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 93\u2013105. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press (2003)","key":"6_CR11","DOI":"10.1093\/oso\/9780198509424.001.0001"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification\u00a09(1), 91\u2013116 (1992), doi:10.1007\/BF02618470","journal-title":"Journal of Classification"},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.aml.2010.12.015","volume":"24","author":"S. Vakati","year":"2011","unstructured":"Vakati, S., Fern\u00e1ndez-Baca, D.: Graph triangulations and the compatibility of unrooted phylogenetic trees. Applied Mathematics Letters\u00a024(5), 719\u2013723 (2011)","journal-title":"Applied Mathematics Letters"},{"doi-asserted-by":"crossref","unstructured":"Vakati, S., Fern\u00e1ndez-Baca, D.: Characterizing compatibility and agreement of unrooted trees via cuts in graphs. CoRR abs\/1307.7828 (2013)","key":"6_CR14","DOI":"10.1007\/978-3-642-40453-5_15"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07953-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T16:18:37Z","timestamp":1716826717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07953-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079523","9783319079530"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07953-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}