{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:03Z","timestamp":1725557583845},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_17","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T05:19:57Z","timestamp":1277183997000},"page":"177-189","source":"Crossref","is-referenced-by-count":2,"title":["Phylogeny- and Parsimony-Based Haplotype\u00a0Inference\u00a0with\u00a0Constraints"],"prefix":"10.1007","author":[{"given":"Michael","family":"Elberfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Tantau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1089\/cmb.2004.11.858","volume":"11","author":"V. Bafna","year":"2004","unstructured":"Bafna, V., Gusfield, D., Hannenhalli, S., Yooseph, S.: A note on efficient computation of haplotypes via perfect phylogeny. J. Comput. Biol.\u00a011(5), 858\u2013866 (2004)","journal-title":"J. Comput. Biol."},{"issue":"3\u20134","key":"17_CR2","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. of Comput. Biol.\u00a010(3\u20134), 323\u2013340 (2003)","journal-title":"J. of Comput. Biol."},{"issue":"3","key":"17_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":"17_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TCBB.2006.24","volume":"3","author":"D.G. Brown","year":"2006","unstructured":"Brown, D.G., Harrower, I.M.: Integer programming approaches to haplotype inference by pure parsimony. IEEE\/ACM T. on Comput. Biol. and Bioinf.\u00a03(2), 141\u2013154 (2006)","journal-title":"IEEE\/ACM T. on Comput. Biol. and Bioinf."},{"issue":"2","key":"17_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":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"17_CR7","unstructured":"Elberfeld, M.: Perfect phylogeny haplotyping is complete for logspace. Computing Research Repository (CoRR), abs\/0905.0602 (2009)"},{"key":"17_CR8","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)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Tantau, T.: Phylogeny- and parsimony-based haplotype inference with constraints. Technical Report SIIM-TR-A-10-01, Universit\u00e4t zu L\u00fcbeck (2010)","DOI":"10.1007\/978-3-642-13509-5_17"},{"issue":"1","key":"17_CR10","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. Bioinf. and Comput. Biol.\u00a01(1), 1\u201320 (2003)","journal-title":"J. Bioinf. and Comput. Biol."},{"issue":"5","key":"17_CR11","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":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-02441-2_30","volume-title":"Combinatorial Pattern Matching","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hartman, T., Hermelin, D., Landau, G.M., Rosamond, F.A., Rozenberg, L.: Haplotype inference constrained by plausible haplotype data. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 339\u2013352. Springer, Heidelberg (2009)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/565196.565218","volume-title":"Proc. of RECOMB 2002","author":"D. Gusfield","year":"2002","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Proc. of RECOMB 2002, pp. 166\u2013175. ACM Press, New York (2002)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44888-8_11","volume-title":"Combinatorial Pattern Matching","author":"D. Gusfield","year":"2003","unstructured":"Gusfield, D.: Haplotype inference by pure parsimony. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 144\u2013155. Springer, Heidelberg (2003)"},{"issue":"10","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1089\/cmb.2005.12.1261","volume":"12","author":"Y.-T. Huang","year":"2005","unstructured":"Huang, Y.-T., Chao, K.-M., Chen, T.: An approximation algorithm for haplotype inference by maximum parsimony. J. Comput. Biol.\u00a012(10), 1261\u20131274 (2005)","journal-title":"J. Comput. Biol."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-04128-0_31","volume-title":"Algorithms - ESA 2009","author":"G. Jager","year":"2009","unstructured":"Jager, G., Climer, S., Zhang, W.: Complete parsimony haplotype inference problem and algorithms. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 337\u2013348. Springer, Heidelberg (2009)"},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1287\/ijoc.1040.0085","volume":"16","author":"G. Lancia","year":"2004","unstructured":"Lancia, G., Pinotti, M.C., Rizzi, R.: Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms. INFORMS J. on Comput.\u00a016(4), 348\u2013359 (2004)","journal-title":"INFORMS J. on Comput."},{"key":"17_CR18","first-page":"173","volume-title":"Proc. Int. Conf. Adv. in Bioinf. 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 Bioinf. and Appl., pp. 173\u2013184. World Scientific, Singapore (2005)"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1089\/cmb.2006.13.897","volume":"13","author":"R.V. Satya","year":"2006","unstructured":"Satya, R.V., Mukherjee, A.: An optimal algorithm for perfect phylogeny haplotyping. J. Comput. Biol.\u00a013(4), 897\u2013928 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TCBB.2006.40","volume":"3","author":"R. Sharan","year":"2006","unstructured":"Sharan, R., Halld\u00f3rsson, B.V., Istrail, S.: Islands of tractability for parsimony haplotyping. IEEE\/ACM T. Comput. Biol. and Bioinf.\u00a03(3), 303\u2013311 (2006)","journal-title":"IEEE\/ACM T. Comput. Biol. and Bioinf."},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCBB.2007.70232","volume":"5","author":"L. Iersel van","year":"2008","unstructured":"van Iersel, L., Keijsper, J., Kelk, S., Stougie, L.: Shorelines of islands of tractability: Algorithms for parsimony and minimum perfect phylogeny haplotyping problems. IEEE\/ACM T. Comput. Biol. and Bioinf.\u00a05(2), 301\u2013312 (2008)","journal-title":"IEEE\/ACM T. Comput. Biol. and Bioinf."},{"issue":"14","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1093\/bioinformatics\/btg239","volume":"19","author":"L. Wang","year":"2003","unstructured":"Wang, L., Xu, Y.: Haplotype inference by maximum parsimony. Bioinformatics\u00a019(14), 1773\u20131780 (2003)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:08Z","timestamp":1606167548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}