{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:38Z","timestamp":1725455018950},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_8","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"93-105","source":"Crossref","is-referenced-by-count":4,"title":["Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Rob","family":"Gysel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristian","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM Journal on Computing\u00a010, 751\u2013771 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering Treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR3","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"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BF01581045","volume":"22","author":"R. Chandrasekaran","year":"1982","unstructured":"Chandrasekaran, R., Tamir, A.: Polynomially bounded algorithms for locating p-centers on a tree. Mathematical Programming\u00a022(3), 304\u2013315 (1982)","journal-title":"Mathematical Programming"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. In: SODA 2012 Proceedings, pp. 1737\u20131746 (2012)","DOI":"10.1137\/1.9781611973099.138"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory\u00a016(1), 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/0196-6774(87)90053-8","volume":"8","author":"F. Gavril","year":"1987","unstructured":"Gavril, F.: Generating the maximum spanning trees of a weighted graph. Journal of Algorithms\u00a08, 592\u2013597 (1987)","journal-title":"Journal of Algorithms"},{"key":"8_CR9","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. Elsevier, Amsterdam (2004)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: The multi-state perfect phylogeny problem with missing and removable data. Journal of Computational Biology, 383\u2013399 (2010)","DOI":"10.1089\/cmb.2009.0200"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/TCBB.2011.27","volume":"8","author":"R. Gysel","year":"2011","unstructured":"Gysel, R., Gusfield, D.: Extensions and improvements to the chordal graph approach to the multistate perfect phylogeny problem. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a08(4), 912\u2013917 (2011)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Gysel, R., Lam, F., Gusfield, D.: Constructing perfect phylogenies and proper triangulations for three-state characters. In: Przytycka and Sagot [16], pp. 104\u2013115","DOI":"10.1007\/978-3-642-23038-7_10"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.disc.2005.12.003","volume":"306","author":"P. Heggernes","year":"2006","unstructured":"Heggernes, P.: Minimal triangulation of graphs: a survey. Discrete Mathematics\u00a0306(3), 297\u2013317 (2006)","journal-title":"Discrete Mathematics"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-13073-1_12","volume-title":"Algorithms and Complexity","author":"P. Heggernes","year":"2010","unstructured":"Heggernes, P., Mancini, F., Nederlof, J., Villanger, Y.: A Parameterized Algorithm for Chordal Sandwich. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 120\u2013130. Springer, Heidelberg (2010)"},{"key":"8_CR15","unstructured":"Hemminger, R.L., Beineke, L.W.: Line graphs and line digraphs. Academic Press Inc. (1978)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms in Bioinformatics","year":"2011","unstructured":"Przytycka, T.M., Sagot, M.-F. (eds.): WABI 2011. LNCS, vol.\u00a06833. Springer, Heidelberg (2011)"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications\u00a032(3), 597\u2013609 (1970)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR18","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2003)"},{"issue":"1","key":"8_CR19","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)","journal-title":"Journal of Classification"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Stevens, K., Kirkpatrick, B.: Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values. In: Przytycka and Sagot [16], pp. 282\u2013297","DOI":"10.1007\/978-3-642-23038-7_24"},{"issue":"5","key":"8_CR21","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"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"J.R. Walter","year":"1978","unstructured":"Walter, J.R.: Representations of chordal graphs as subtrees of a tree. Journal of Graph Theory\u00a02, 265\u2013267 (1978)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T19:26:31Z","timestamp":1714332391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}