{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:11Z","timestamp":1742617211297,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:37Z","timestamp":1330290277000},"page":"605-616","source":"Crossref","is-referenced-by-count":0,"title":["Hypothesis testing in perfect phylogeny for a bounded number of characters"],"prefix":"10.1007","author":[{"given":"Jens","family":"Lagergren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"R. Agarwala and D. Fern\u00e1ndez-Baca. A polynomial time algorithm for the perfect phylogeny problem when the number of character states is fixed. In 34:th FOCS, pages 140\u2013146, 1993.","DOI":"10.1109\/SFCS.1993.366873"},{"key":"49_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8:277\u2013284, 1987.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"H. Bodlaender and B. L. E. de Fluiter. Intervalizing k-colored graphs. In 22:nd ICALP, pages 87\u201398, 1995.","DOI":"10.1007\/3-540-60084-1_65"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, M. Fellows, and M. Hallet. Beyond NP-completeness for problems of bounded witdh: Hardness for the W hierarchy. In 26 STOC, pages 449\u2013458, 1994.","DOI":"10.1145\/195058.195229"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, M. Fellows, and T. Warnow. Two strikes against perfect phylogeny. In 19:th ICALP, pages 273\u2013283, 1992.","DOI":"10.1007\/3-540-55719-9_80"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/jagm.1993.1035","volume":"15","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender and T. Kloks. A simple linear time algorithm for triangulating three-colored graphs. Journal of Algorithms, 15:160\u2013172, 1993.","journal-title":"Journal of Algorithms"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1146\/annurev.es.16.110185.002243","volume":"16","author":"G.F. Estabrook","year":"1985","unstructured":"G.F. Estabrook and C. Meacham. Compatibility methods in systematics. Ann. Rev. Ecol. Syst., 16:431\u2013446, 1985.","journal-title":"Ann. Rev. Ecol. Syst."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0405019","volume":"5","author":"S. Kannan","year":"1992","unstructured":"S. Kannan and T. Warnow. Triangulating three colored graphs. SIAM J. on Discrete Mathematics, 5:249\u2013258, 1992.","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"49_CR9","unstructured":"S. Kannan and T. Warnow. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. In 6:th SODA, pages 595\u2013603, 1995."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"F.R. McMorris, T. J. Warnow, and T. Wimer. Triangulating vertex-colored graphs. SIAM J. Discrete Math., pages 296\u2013306, 1994.","DOI":"10.1137\/S0895480192229273"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"M.A. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, pages 91\u2013116, 1992.","DOI":"10.1007\/BF02618470"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:40Z","timestamp":1742598640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}