{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:17Z","timestamp":1725860777816},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_5","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"53-64","source":"Crossref","is-referenced-by-count":1,"title":["Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees"],"prefix":"10.1007","author":[{"given":"Julien","family":"Baste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celine","family":"Scornavacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"crossref","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":"5_CR2","series-title":"Computational Biology","volume-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life","year":"2004","unstructured":"Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology, vol. 4. Springer, Netherlands (2004)"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1146\/annurev.ecolsys.33.010802.150511","volume":"33","author":"OR Bininda-Emonds","year":"2002","unstructured":"Bininda-Emonds, O.R., Gittleman, J.L., Steel, M.A.: The (super) tree of life: procedures, problems, and prospects. Ann. Rev. Ecol. Syst. 33, 265\u2013289 (2002)","journal-title":"Ann. Rev. Ecol. Syst."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: An $$O(c^k n)$$ O ( c k n ) 5-approximation algorithm for treewidth. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 499\u2013508 (2013)","DOI":"10.1109\/FOCS.2013.60"},{"issue":"3","key":"5_CR5","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 351(3), 296\u2013302 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 150\u2013159 (2011)","DOI":"10.1109\/FOCS.2011.23"},{"issue":"5","key":"5_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1038\/nrg1603","volume":"6","author":"F Delsuc","year":"2005","unstructured":"Delsuc, F., Brinkmann, H., Philippe, H.: Phylogenomics and the reconstruction of the tree of life. Nat. Rev. Genet. 6(5), 361\u2013375 (2005)","journal-title":"Nat. Rev. Genet."},{"key":"5_CR8","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"5_CR9","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Incorporated, Sunderland (2004)"},{"issue":"1\u20133","key":"5_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130(1\u20133), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"5_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01894195","volume":"3","author":"AD Gordon","year":"1986","unstructured":"Gordon, A.D.: Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves. J. Classif. 3(2), 335\u2013348 (1986)","journal-title":"J. Classif."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"key":"5_CR13","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"issue":"4","key":"5_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1111\/j.1096-0031.1989.tb00569.x","volume":"5","author":"W Maddison","year":"1989","unstructured":"Maddison, W.: Reconstructing character evolution on polytomous cladograms. Cladistics 5(4), 365\u2013377 (1989)","journal-title":"Cladistics"},{"issue":"1\u20132","key":"5_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M Ng","year":"1996","unstructured":"Ng, M., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"key":"5_CR16","unstructured":"Scornavacca, C.: Supertree methods for phylogenomics. Ph.D. thesis, Universit\u00e9 Montpellier II-Sciences et Techniques du Languedoc (2009)"},{"issue":"3","key":"5_CR17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.7155\/jgaa.00327","volume":"18","author":"C Scornavacca","year":"2014","unstructured":"Scornavacca, C., van Iersel, L., Kelk, S., Bryant, D.: The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18(3), 385\u2013392 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR18","doi-asserted-by":"crossref","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. J. Classif. 9, 91\u2013116 (1992)","journal-title":"J. Classif."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T16:44:17Z","timestamp":1568133857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}