{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:27Z","timestamp":1725542067211},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_121","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"1205-1214","source":"Crossref","is-referenced-by-count":1,"title":["Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Guillemot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"121_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A.V. 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 Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"121_CR2","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1111\/j.1365-2699.2006.01548.x","volume":"33","author":"G.K. Brown","year":"2006","unstructured":"Brown, G.K., Nelson, G., Ladiges, P.Y.: Historical biogeography of Rhododendron section Vireya and the Malesian Archipelago. Journal of Biogeography\u00a033, 1929\u20131944 (2006)","journal-title":"Journal of Biogeography"},{"key":"121_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-92182-0_44","volume-title":"Algorithms and Computation","author":"J. Byrka","year":"2008","unstructured":"Byrka, J., Guillemot, S., Jansson, J.: New results on optimizing rooted triplets consistency. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 484\u2013495. Springer, Heidelberg (2008)"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem (Article 21). Journal of the ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411511"},{"issue":"2","key":"121_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Journal of Computer and System Sciences\u00a057(2), 187\u2013199 (1998)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"121_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0196-6774(03)00081-6","volume":"49","author":"M. Fellows","year":"2003","unstructured":"Fellows, M., Hallett, M., Stege, U.: Analogs & duals of the MAST problem for sequences & trees. Journal of Algorithms\u00a049(1), 192\u2013216 (2003)","journal-title":"Journal of Algorithms"},{"key":"121_CR7","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"9","key":"121_CR8","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1093\/molbev\/msl045","volume":"23","author":"K.T. Huber","year":"2006","unstructured":"Huber, K.T., Oxelman, B., Lott, M., Moulton, V.: Reconstructing the evolutionary history of polyploids from multilabeled trees. Molecular Biology and Evolution\u00a023(9), 1784\u20131791 (2006)","journal-title":"Molecular Biology and Evolution"},{"issue":"3","key":"121_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V. Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. Journal of Combinatorial Theory, Series\u00a0B\u00a033(3), 265\u2013270 (1982)","journal-title":"Journal of Combinatorial Theory, Series\u00a0B"},{"issue":"9","key":"121_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/S0169-5347(98)01438-4","volume":"13","author":"R.D.M. Page","year":"1998","unstructured":"Page, R.D.M., Charleston, M.A.: Trees within trees: phylogeny and historical associations. Trends in Ecology & Evolution\u00a013(9), 356\u2013359 (1998)","journal-title":"Trends in Ecology & Evolution"},{"key":"121_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-642-00982-2_60","volume-title":"Proc. of the 3rd Int. Conference on Language and Automata Theory and Applications (LATA 2009)","author":"C. Scornavacca","year":"2009","unstructured":"Scornavacca, C., Berry, V., Ranwez, V.: From gene trees to species trees through a supertree approach. In: Proc. of the 3rd Int. Conference on Language and Automata Theory and Applications (LATA 2009). LNCS, vol.\u00a05457, pp. 702\u2013714. Springer, Heidelberg (2009)"},{"issue":"2","key":"121_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P.D. Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica\u00a015(2), 281\u2013288 (1995)","journal-title":"Combinatorica"},{"issue":"1","key":"121_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing\u00a03(1), 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:47Z","timestamp":1619782607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_121","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}