{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:24Z","timestamp":1725565224910},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_23","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T08:51:46Z","timestamp":1284108706000},"page":"274-287","source":"Crossref","is-referenced-by-count":3,"title":["Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data"],"prefix":"10.1007","author":[{"given":"Kristian","family":"Stevens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S0097539793244587","volume":"23","author":"R. Agarwala","year":"1994","unstructured":"Agarwala, R., Fernandez-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal on Computing\u00a023(6), 1216\u20131224 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"23_CR2","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1080\/10635150802434394","volume":"57","author":"A.V. Alekseyenko","year":"2008","unstructured":"Alekseyenko, A.V., Lee, C.J., Suchard, M.A.: Wagner and dollo: a stochastic duet by composing two parsimonious solos. Syst. Biol.\u00a057(5), 772\u2013784 (2008)","journal-title":"Syst. Biol."},{"unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. Mathematics in the archaeological and historical sciences, 387\u2013395 (1971)","key":"23_CR3"},{"key":"23_CR4","volume-title":"Steiner Trees in Industries","author":"D. Fern\u00e1ndez-Baca","year":"2001","unstructured":"Fern\u00e1ndez-Baca, D.: The perfect phylogeny problem. In: Du, D.Z., Cheng, X. (eds.) Steiner Trees in Industries. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks\u00a021(1), 19\u201328 (1991)","journal-title":"Networks"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-02008-7_18","volume-title":"Research in Computational Molecular Biology","author":"D. Gusfield","year":"2009","unstructured":"Gusfield, D.: The multi-state perfect phylogeny problem with missing and removable data: Solutions via integer-programming and chordal graph theory. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 236\u2013252. Springer, Heidelberg (2009)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-73545-8_8","volume-title":"Computing and Combinatorics","author":"D. Gusfield","year":"2007","unstructured":"Gusfield, D., Frid, Y., Brown, D.: Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, p. 51. Springer, Heidelberg (2007)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-13078-6_8","volume-title":"Bioinformatics Research and Applications","author":"R. Gysel","year":"2010","unstructured":"Gysel, R., Gusfield, D.: Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds.) Bioinformatics Research and Applications. LNCS, vol.\u00a06053, pp. 52\u201360. Springer, Heidelberg (2010)"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/974614.974617","volume-title":"Proceedings of the eighth annual international conference on Resaerch in computational molecular biology","author":"E. Halperin","year":"2004","unstructured":"Halperin, E., Karp, R.: Perfect phylogeny and haplotype assignment. In: Proceedings of the eighth annual international conference on Resaerch in computational molecular biology, pp. 10\u201319. ACM, New York (2004)"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"R. Hudson","year":"2002","unstructured":"Hudson, R.: Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics\u00a018(2), 337\u2013338 (2002)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Kannan, S., Warnow, T.: Inferring evolutionary history from DNA sequences. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, pp. 362\u2013371 (1990)","key":"23_CR11","DOI":"10.1109\/FSCS.1990.89555"},{"key":"23_CR12","first-page":"595","volume-title":"Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms","author":"S. Kannan","year":"1995","unstructured":"Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. In: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pp. 595\u2013603. Society for Industrial and Applied Mathematics, Philadelphia (1995)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1046\/j.1420-9101.1991.4010009.x","volume":"4","author":"D. Lloyd","year":"2002","unstructured":"Lloyd, D.: Multi-residue gaps, a class of molecular characters with exceptional reliability for phylogenetic analyses. Journal of Evolutionary Biology\u00a04(1), 9\u201321 (2002)","journal-title":"Journal of Evolutionary Biology"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539702406510","volume":"33","author":"I. Pe\u2019er","year":"2004","unstructured":"Pe\u2019er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM Journal on Computing\u00a033(3), 590\u2013607 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TCBB.2007.70218","volume":"5","author":"R. Satya","year":"2008","unstructured":"Satya, R., Mukherjee, A.: The undirected incomplete perfect phylogeny problem. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a05(4), 618\u2013629 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"23_CR16","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 University Press, USA (2003)"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1093\/sysbio\/49.2.369","volume":"49","author":"M. Simmons","year":"2000","unstructured":"Simmons, M., Ochoterena, H.: Gaps as characters in sequence-based phylogenetic analyses. Systematic Biology\u00a049(2), 369\u2013381 (2000)","journal-title":"Systematic Biology"},{"issue":"1","key":"23_CR18","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"}],"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-15294-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T08:10:22Z","timestamp":1711786222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}