{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:20:10Z","timestamp":1771456810098,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319569697","type":"print"},{"value":"9783319569703","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_8","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T04:43:49Z","timestamp":1491885829000},"page":"117-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Resolving Multicopy Duplications de novo Using Polyploid Phasing"],"prefix":"10.1007","author":[{"given":"Mark J.","family":"Chaisson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipto","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan E.","family":"Eichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"issue":"13","key":"8_CR1","doi-asserted-by":"publisher","first-page":"i352","DOI":"10.1093\/bioinformatics\/btt213","volume":"29","author":"D Aguiar","year":"2013","unstructured":"Aguiar, D., Istrail, S.: Haplotype assembly in polyploid genomes and identical by descent shared tracts. Bioinformatics 29(13), i352\u2013i360 (2013)","journal-title":"Bioinformatics"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM (JACM) 55(5), 23 (2008)","journal-title":"J. ACM (JACM)"},{"issue":"1\u20133","key":"8_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"16","key":"8_CR4","doi-asserted-by":"publisher","first-page":"i153","DOI":"10.1093\/bioinformatics\/btn298","volume":"24","author":"V Bansal","year":"2008","unstructured":"Bansal, V., Bafna, V.: Hapcut: an efficient and accurate algorithm for the haplotype assembly problem. Bioinformatics 24(16), i153\u2013i159 (2008)","journal-title":"Bioinformatics"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"e1003502","DOI":"10.1371\/journal.pcbi.1003502","volume":"10","author":"E Berger","year":"2014","unstructured":"Berger, E., Yorukoglu, D., Peng, J., Berger, B.: Haptree: a novel Bayesian framework for single individual polyplotyping using NGS data. PLoS Comput. Biol. 10(3), e1003502 (2014)","journal-title":"PLoS Comput. Biol."},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1038\/nbt.3238","volume":"33","author":"K Berlin","year":"2015","unstructured":"Berlin, K., Koren, S., Chin, C.-S., Drake, J.P., Landolin, J.M., Phillippy, A.M.: Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nat. Biotechnol. 33(6), 623\u2013630 (2015)","journal-title":"Nat. Biotechnol."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1089\/cmb.2015.0220","volume":"23","author":"P Bonizzoni","year":"2016","unstructured":"Bonizzoni, P., Dondi, R., Klau, G.W., Pirola, Y., Pisanti, N., Zaccaria, S.: On the minimum error correction problem for haplotype assembly in diploid and polyploid genomes. J. Comput. Biol. 23, 718\u2013736 (2016)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/JSTSP.2016.2547860","volume":"10","author":"C Cai","year":"2016","unstructured":"Cai, C., Sanghavi, S., Vikalo, H.: Structured low-rank matrix factorization for haplotype assembly. J. Sel. Top. Sig. Process. 10(4), 647\u2013657 (2016)","journal-title":"J. Sel. Top. Sig. Process."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"EJ Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"key":"8_CR11","unstructured":"Chaisson, M.J.: https:\/\/github.com\/mchaisso\/blasr"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 524\u2013533. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238225"},{"key":"8_CR13","unstructured":"Chen, Y., Kamath, G., Suh, C., Tse, D.: Community recovery in graphs with locality (2016). arXiv preprint arXiv:1602.03828"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s12920-015-0078-0","volume":"16","author":"S Das","year":"2015","unstructured":"Das, S., Vikalo, H.: SDhaP: haplotype assembly for diploids and polyploids via semi-definite programming. BMC Genom. 16(1), 4 (2015)","journal-title":"BMC Genom."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45198-3_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"ED Demaine","year":"2003","unstructured":"Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) APPROX\/RANDOM -2003. LNCS, vol. 2764, pp. 1\u201313. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45198-3_1"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P.: Laird, N, M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. Ser. B (Methodol.) 39, 1\u201338 (1977)","journal-title":"J. Roy. Stat. Soc. Ser. B (Methodol.)"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.cell.2012.03.033","volume":"149","author":"MY Dennis","year":"2012","unstructured":"Dennis, M.Y., Nuttle, X., Sudmant, P.H., Antonacci, F., Graves, T.A., Nefedov, M., Rosenfeld, J.A., Sajjadian, S., Malig, M., Kotkiewicz, H., et al.: Evolution of human-specific neural SRGAP2 genes by incomplete segmental duplication. Cell 149(4), 912\u2013922 (2012)","journal-title":"Cell"},{"issue":"11","key":"8_CR18","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/S0168-9525(01)02492-1","volume":"17","author":"EE Eichler","year":"2001","unstructured":"Eichler, E.E.: Recent duplication, domain accretion and the dynamic mutation of the human genome. Trends Genet. 17(11), 661\u2013669 (2001)","journal-title":"Trends Genet."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-39658-1_21","volume-title":"Algorithms - ESA 2003","author":"D Emanuel","year":"2003","unstructured":"Emanuel, D., Fiat, A.: Correlation clustering \u2013 minimizing disagreements on arbitrary weighted graphs. In: Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 208\u2013220. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-39658-1_21"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"6281","key":"8_CR21","doi-asserted-by":"publisher","first-page":"aae0344","DOI":"10.1126\/science.aae0344","volume":"352","author":"D Gordon","year":"2016","unstructured":"Gordon, D., Huddleston, J., Chaisson, M.J.P., Hill, C.M., Kronenberg, Z.N., Munson, K.M., Malig, M., Raja, A., Fiddes, I., Hillier, L.W., et al.: Long-read sequence assembly of the gorilla genome. Science 352(6281), aae0344 (2016)","journal-title":"Science"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of 45h Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 665\u2013674, ACM, New York (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"11","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1038\/ng.2007.9","volume":"39","author":"Z Jiang","year":"2007","unstructured":"Jiang, Z., Tang, H., Ventura, M., Cardone, M.F., Marques-Bonet, T., She, X., Pevzner, P.A., Eichler, E.E.: Ancestral reconstruction of segmental duplications reveals punctuated cores of human genome evolution. Nat. Genet. 39(11), 1361\u20131368 (2007)","journal-title":"Nat. Genet."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Koren, S., Walenz, B.P., Berlin, K., Miller, J.R., Phillippy, A.M.: Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation. bioRxiv, p. 071282 (2016)","DOI":"10.1101\/071282"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44676-1_15","volume-title":"Algorithms \u2014 ESA 2001","author":"G Lancia","year":"2001","unstructured":"Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs problems, complexity, and algorithms. In: Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 182\u2013193. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44676-1_15"},{"key":"8_CR26","unstructured":"Motahari, A., Ramchandran, K., Tse, D., Ma, N.: Optimal DNA shotgun sequencing: noisy reads are as good as noiseless reads (2013). arXiv preprint arXiv:1304.2798"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","volume":"2","author":"EW Myers","year":"1995","unstructured":"Myers, E.W.: Toward simplifying and accurately formulating fragment assembly. J. Comput. Biol. 2(2), 275\u2013290 (1995)","journal-title":"J. Comput. Biol."},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-662-44753-6_5","volume-title":"Algorithms in Bioinformatics","author":"G Myers","year":"2014","unstructured":"Myers, G.: Efficient local alignment discovery amongst noisy long reads. In: Brown, D., Morgenstern, B. (eds.) WABI 2014. LNCS, vol. 8701, pp. 52\u201367. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44753-6_5"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-05269-4_19","volume-title":"Research in Computational Molecular Biology","author":"M Patterson","year":"2014","unstructured":"Patterson, M., Marschall, T., Pisanti, N., Iersel, L., Stougie, L., Klau, G.W., Sch\u00f6nhuth, A.: WhatsHap: haplotype assembly for future-generation sequencing reads. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 237\u2013249. Springer, Cham (2014). doi: 10.1007\/978-3-319-05269-4_19"},{"issue":"1\u20132","key":"8_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"PA Pevzner","year":"1995","unstructured":"Pevzner, P.A.: Dna physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13(1\u20132), 77\u2013105 (1995)","journal-title":"Algorithmica"},{"issue":"17","key":"8_CR31","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"8_CR32","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TCBB.2015.2462367","volume":"13","author":"Z Puljiz","year":"2016","unstructured":"Puljiz, Z., Vikalo, H.: Decoding genetic variations: communications-inspired haplotype assembly. IEEE\/ACM Trans. Comput. Biol. Bioinform. 13(3), 518\u2013530 (2016)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"1","key":"8_CR34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.4310\/CIS.2010.v10.n1.a2","volume":"10","author":"R Schwartz","year":"2010","unstructured":"Schwartz, R., et al.: Theory and algorithms for the haplotype assembly problem. Commun. Inf. Syst. 10(1), 23\u201338 (2010)","journal-title":"Commun. Inf. Syst."},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1038\/nature20098","volume":"538","author":"J-S Seo","year":"2016","unstructured":"Seo, J.-S., Rhie, A., Lee, S., Sohn, M.-H., Kim, C.-U., Hastie, A., Cao, H., Yun, J.-Y., Kim, J., et al.: De novo assembly and phasing of a Korean human genome. Nature 538, 243 (2016)","journal-title":"Nature"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Si, H., Vikalo, H., Vishwanath, S.: Haplotype assembly: an information theoretic view. In: 2014 IEEE Information Theory Workshop (ITW), pp. 182\u2013186. IEEE (2014)","DOI":"10.1109\/ITW.2014.6970817"},{"issue":"2","key":"8_CR37","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0168-9525(02)02592-1","volume":"18","author":"P Stankiewicz","year":"2002","unstructured":"Stankiewicz, P., Lupski, J.R.: Genome architecture, rearrangements and genomic disorders. Trends Genet. 18(2), 74\u201382 (2002)","journal-title":"Trends Genet."},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Steinberg, K.M., Graves-Lindsay, T., Schneider, V.A., Chaisson, M.J.P., Tomlinson, C., Huddleston, J.L., Minx, P., Kremitzki, M., Albrecht, D., Magrini, V., et al.: High-quality assembly of an individual of Yoruban descent. bioRxiv, p. 067447 (2016)","DOI":"10.1101\/067447"},{"issue":"8","key":"8_CR39","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1038\/ng.3340","volume":"47","author":"CL Usher","year":"2015","unstructured":"Usher, C.L., Handsaker, R.E., Esko, T., Tuke, M.A., Weedon, M.N., Hastie, A.R., Cao, H., Moon, J.E., Kashin, S., Fuchsberger, C., et al.: Structural forms of the human amylase locus and their relationships to SNPs, haplotypes and obesity. Nat. Genet. 47(8), 921\u2013925 (2015)","journal-title":"Nat. Genet."},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Welling, M., Kurihara, K.: Bayesian k-means as a maximization-expectation algorithm (2007)","DOI":"10.1137\/1.9781611972764.43"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:47:13Z","timestamp":1750196833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/groups.csail.mit.edu\/cb\/recomb2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}