{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:31:34Z","timestamp":1725532294253},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020162"},{"type":"electronic","value":"9783642020179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02017-9_23","type":"book-chapter","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T11:38:06Z","timestamp":1242041886000},"page":"201-210","source":"Crossref","is-referenced-by-count":1,"title":["Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data"],"prefix":"10.1007","author":[{"given":"Michael","family":"Elberfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilka","family":"Schnoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Tantau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3\u20134","key":"23_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/10665270360688048","volume":"10","author":"V. Bafna","year":"2003","unstructured":"Bafna, V., Gusfield, D., Lancia, G., Yooseph, S.: Haplotyping as perfect phylogeny: A direct approach. J. Comput. Biol.\u00a010(3\u20134), 323\u2013340 (2003)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1089\/cmb.1995.2.515","volume":"2","author":"C.J. Benham","year":"1995","unstructured":"Benham, C.J., Kannan, S., Paterson, M., Warnow, T.: Hen\u2019s teeth and whale\u2019s feet: Generalized characters and their compatibility. J. Comput. Biol.\u00a02(4), 515\u2013525 (1995)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00453-007-0094-3","volume":"48","author":"P. Bonizzoni","year":"2007","unstructured":"Bonizzoni, P.: A linear-time algorithm for the perfect phylogeny haplotype problem. Algorithmica\u00a048(3), 267\u2013285 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"23_CR4","first-page":"111","volume":"7","author":"A.G. Clark","year":"1990","unstructured":"Clark, A.G.: Inference of haplotypes from PCR-amplified samples of diploid populations. J. of Mol. Biol. and Evol.\u00a07(2), 111\u2013122 (1990)","journal-title":"J. of Mol. Biol. and Evol."},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1089\/cmb.2006.13.522","volume":"13","author":"Z. Ding","year":"2006","unstructured":"Ding, Z., Filkov, V., Gusfield, D.: A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem. J. Comput. Biol.\u00a013(2), 522\u2013553 (2006)","journal-title":"J. Comput. Biol."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Schnoor, I., Tantau, T.: Influence of tree topology restrictions on the complexity of haplotyping with missing data. Tech. Rep. SIIM-TR-A-08-05, Universit\u00e4t zu L\u00fcbeck (2008)","DOI":"10.1007\/978-3-642-02017-9_23"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-85238-4_24","volume-title":"Mathematical Foundations of Computer Science 2008","author":"M. Elberfeld","year":"2008","unstructured":"Elberfeld, M., Tantau, T.: Computational complexity of perfect-phylogeny-related haplotyping problems. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 299\u2013310. Springer, Heidelberg (2008)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219720003000174","volume":"1","author":"E. Eskin","year":"2003","unstructured":"Eskin, E., Halperin, E., Karp, R.M.: Efficient reconstruction of haplotype structure via perfect phylogeny. J. of Bioinform. and Comput. Biol.\u00a01(1), 1\u201320 (2003)","journal-title":"J. of Bioinform. and Comput. Biol."},{"issue":"5","key":"23_CR9","first-page":"921","volume":"12","author":"L. Excoffier","year":"1995","unstructured":"Excoffier, L., Slatkin, M.: Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population. Mol. Biol. and Evol.\u00a012(5), 921\u2013927 (1995)","journal-title":"Mol. Biol. and Evol."},{"key":"23_CR10","unstructured":"Gramm, J., Hartman, T., Nierhoff, T., Sharan, R., Tantau, T.: On the complexity of SNP block partitioning under the perfect phylogeny model. Discrete Math. (2008) (to appear), doi:010.1016\/j.disc.2008.04.002"},{"issue":"6-7","key":"23_CR11","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.dam.2005.09.020","volume":"155","author":"J. Gramm","year":"2007","unstructured":"Gramm, J., Nierhoff, T., Sharan, R., Tantau, T.: Haplotyping with missing data via perfect path phylogenies. Discrete and Appl. Math.\u00a0155(6-7), 788\u2013805 (2007)","journal-title":"Discrete and Appl. Math."},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1089\/10665270152530863","volume":"8","author":"D. Gusfield","year":"2001","unstructured":"Gusfield, D.: Inference of haplotypes from samples of diploid populations: Complexity and algorithms. J. Comput. Biol.\u00a08(3), 305\u2013323 (2001)","journal-title":"J. Comput. Biol."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/565196.565218","volume-title":"Proc. RECOMB 2002","author":"D. Gusfield","year":"2002","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Proc. RECOMB 2002, pp. 166\u2013175. ACM Press, New York (2002)"},{"key":"23_CR14","first-page":"10","volume-title":"Proc. RECOMB 2002","author":"E. Halperin","year":"2004","unstructured":"Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype assignment. In: Proc. RECOMB 2002, pp. 10\u201319. ACM Press, New York (2004)"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0219720005001090","volume":"3","author":"G. Kimmel","year":"2005","unstructured":"Kimmel, G., Shamir, R.: The incomplete perfect phylogeny haplotype problem. J. Bioinform. and Comput. Biol.\u00a03(2), 359\u2013384 (2005)","journal-title":"J. Bioinform. and Comput. Biol."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/9789812702098_0016","volume-title":"Proc. Int. Conf. Adv. in Bioinform. and Appl.","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Zhang, C.-Q.: A linear solution for haplotype perfect phylogeny problem. In: Proc. Int. Conf. Adv. in Bioinform. and Appl., pp. 173\u2013184. World Scientific, Singapore (2005)"},{"issue":"3","key":"23_CR17","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 J. Comput.\u00a033(3), 590\u2013607 (2004)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1089\/cmb.2006.13.897","volume":"13","author":"R. Vijaya Satya","year":"2006","unstructured":"Vijaya Satya, R., Mukherjee, A.: An optimal algorithm for perfect phylogeny haplotyping. J. Comput. Biol.\u00a013(4), 897\u2013928 (2006)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TCBB.2007.70218","volume":"5","author":"R. Vijaya Satya","year":"2008","unstructured":"Vijaya Satya, R., Mukherjee, A.: The undirected incomplete perfect phylogeny problem. IEEE\/ACM T. Comput. Biol. and Bioinform.\u00a05(4), 618\u2013629 (2008)","journal-title":"IEEE\/ACM T. Comput. Biol. and Bioinform."},{"issue":"1","key":"23_CR20","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. J. Classif.\u00a09(1), 91\u2013116 (1992)","journal-title":"J. Classif."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02017-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T22:52:02Z","timestamp":1684968722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02017-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020162","9783642020179"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02017-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}