{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:39:22Z","timestamp":1742380762097},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290087"},{"type":"electronic","value":"9783540318125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557067_11","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:02:33Z","timestamp":1129802553000},"page":"128-139","source":"Crossref","is-referenced-by-count":53,"title":["On the Complexity of Several Haplotyping Problems"],"prefix":"10.1007","author":[{"given":"Rudi","family":"Cilibrasi","sequence":"first","affiliation":[]},{"given":"Leo","family":"van Iersel","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jagm.1999.1024","volume":"33","author":"N. Alon","year":"1999","unstructured":"Alon, N., Sudakov, B.: On Two Segmentation Problems. Journal of Algorithms\u00a033, 173\u2013184 (1999)","journal-title":"Journal of Algorithms"},{"key":"11_CR2","volume-title":"Complexity and Approximation - Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation - Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bafna, V., Istrail, S., Lancia, G., Rizzi, R.: Polynomial and APX-hard cases of the individual haplotyping problem. Theoretical Computer Science (2004)","DOI":"10.1016\/j.tcs.2004.12.017"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/BF02945456","volume":"18","author":"P. Bonizzoni","year":"2003","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The Haplotyping Problem: An Overview of Computational Models and Solutions. Journal of Computer Science and Technology\u00a018(6), 675\u2013688 (2003)","journal-title":"Journal of Computer Science and Technology"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P. Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in large graphs via Singular Value Decomposition. Journal of Machine Learning\u00a056, 9\u201333 (2004)","journal-title":"Journal of Machine Learning"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(77)90068-0","volume":"6","author":"F. Gavril","year":"1977","unstructured":"Gavril, F.: Testing for equality between maximum matching and minimum node covering. Information processing letters\u00a06, 199\u2013202 (1977)","journal-title":"Information processing letters"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/ijoc.1040.0073","volume":"16","author":"H.J. Greenberg","year":"2004","unstructured":"Greenberg, H.J., Hart, W.E., Lancia, G.: Opportunities for Combinatorial Optimisation in Computational Biology. INFORMS Journal on Computing\u00a016(3), 211\u2013231 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-24719-7_3","volume-title":"Computational Methods for SNPs and Haplotype Inference","author":"B.V. Halldorsson","year":"2004","unstructured":"Halldorsson, B.V., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., Istrail, S.: A Survey of Computational Methods for Determining Haplotypes. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS\/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol.\u00a02983, pp. 26\u201347. Springer, Heidelberg (2004)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-27801-6_10","volume-title":"Combinatorial Pattern Matching","author":"Y. Jiao","year":"2004","unstructured":"Jiao, Y., Xu, J., Li, M.: On the k-Closest Substring and k-Consensus Pattern Problems. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 130\u2013144. Springer, Heidelberg (2004)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation Problems. In: Proceedings of STOC 1998, pp. 473\u2013482 (1998)","DOI":"10.1145\/276698.276860"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1009726428407","volume":"2","author":"J. Kleinberg","year":"1998","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: A Microeconomic View of Data Mining. Data Mining and Knowledge Discovery\u00a02, 311\u2013324 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"#cr-split#-11_CR13.1","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation Problems. Journal of the ACM\u00a051(2), 263\u2013280 (2004);","DOI":"10.1145\/972639.972644"},{"key":"#cr-split#-11_CR13.2","unstructured":"Note: this paper is somewhat different to the 1998 version"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs Problems, Complexity and Algorithms. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 182\u2013193 (2001)","DOI":"10.1007\/3-540-44676-1_15"},{"issue":"4","key":"11_CR15","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 Journal on Computing\u00a016(4), 348\u2013359 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR16","unstructured":"Lancia, G., Rizzi, R.: A polynomial solution to a special case of the parsimony haplotyping problem, to appear in Operations Research Letters"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/506147.506149","volume":"49","author":"R. Ostrovsky","year":"2002","unstructured":"Ostrovsky, R., Rabani, Y.: Polynomial-Time Approximation Schemes for Geometric Min-Sum Median Clustering. Journal of the ACM\u00a049(2), 139\u2013156 (2002)","journal-title":"Journal of the ACM"},{"key":"11_CR18","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-30219-3_23","volume-title":"Algorithms in Bioinformatics","author":"A. Panconesi","year":"2004","unstructured":"Panconesi, A., Sozio, M.: Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 266\u2013277. Springer, Heidelberg (2004)"},{"key":"11_CR19","unstructured":"Personal communication with Christos H. Papadimitriou (June 2005)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-45784-4_3","volume-title":"Algorithms in Bioinformatics","author":"R. Rizzi","year":"2002","unstructured":"Rizzi, R., Bafna, V., Istrail, S., Lancia, G.: Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 29\u201343. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557067_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T07:07:24Z","timestamp":1586502444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557067_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290087","9783540318125"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11557067_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}