{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T05:15:34Z","timestamp":1789708534601,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Office of Science of the DOE","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545050","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributed-Memory Parallel Contig Generation for De Novo Long-Read Genome Assembly"],"prefix":"10.1145","author":[{"given":"Giulia","family":"Guidi","sequence":"first","affiliation":[{"name":"University of California, Berkeley, United States and Lawrence Berkeley National Laboratory, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriel","family":"Raulet","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Rokhsar","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, United States and DOE Joint Genome Institute, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid","family":"Oliker","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katherine","family":"Yelick","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, United States of America and Lawrence Berkeley National Laboratory, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aydin","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, United States of America and Lawrence Berkeley National Laboratory, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-020-03720-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"e_1_3_2_1_3_1","volume-title":"LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). ACM New York, NY, USA.","author":"Azad Ariful","year":"2019","unstructured":"Ariful Azad and Ayd\u0131n Bulu\u00e7. 2019. LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). ACM New York, NY, USA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3094091"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00104"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3238"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00118"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1\u201312","author":"Bulu\u00e7 Ayd\u0131n","year":"2011","unstructured":"Ayd\u0131n Bulu\u00e7 and Kamesh Madduri. 2011. Parallel breadth-first search on distributed memory systems. In Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis (SC). 1\u201312."},{"key":"e_1_3_2_1_11_1","volume-title":"Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm. Nature methods 18, 2","author":"Cheng Haoyu","year":"2021","unstructured":"Haoyu Cheng, Gregory\u00a0T Concepcion, Xiaowen Feng, Haowen Zhang, and Heng Li. 2021. Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm. Nature methods 18, 2 (2021), 170\u2013175."},{"key":"e_1_3_2_1_12_1","volume-title":"Phased diploid genome assembly with single-molecule real-time sequencing. Nature methods 13, 12","author":"Chin Chen-Shan","year":"2016","unstructured":"Chen-Shan Chin, Paul Peluso, Fritz\u00a0J Sedlazeck, Maria Nattestad, Gregory\u00a0T Concepcion, Alicia Clum, Christopher Dunn, Ronan O\u2019Malley, Rosa Figueroa-Balderas, Abraham Morales-Cruz, 2016. Phased diploid genome assembly with single-molecule real-time sequencing. Nature methods 13, 12 (2016), 1050\u20131054."},{"key":"e_1_3_2_1_13_1","volume-title":"Matching: A well-solved class of integer linear programs. In Combinatorial Optimization\u2014Eureka, You Shrink!Springer, 27\u201330.","author":"Edmonds Jack","year":"2003","unstructured":"Jack Edmonds and Ellis\u00a0L Johnson. 2003. Matching: A well-solved class of integer linear programs. In Combinatorial Optimization\u2014Eureka, You Shrink!Springer, 27\u201330."},{"key":"e_1_3_2_1_14_1","volume-title":"Real-time DNA sequencing from single polymerase molecules. Science 323, 5910","author":"Eid John","year":"2009","unstructured":"John Eid, Adrian Fehr, Jeremy Gray, Khai Luong, John Lyle, Geoff Otto, Paul Peluso, David Rank, Primo Baybayan, Brad Bettman, 2009. Real-time DNA sequencing from single polymerase molecules. Science 323, 5910 (2009), 133\u2013138."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-017-0097-9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807664"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00013"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3043241"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.191395.115"},{"key":"e_1_3_2_1_20_1","volume-title":"Bounds for certain multiprocessing anomalies. Bell system technical journal 45, 9","author":"Graham L","year":"1966","unstructured":"Ronald\u00a0L Graham. 1966. Bounds for certain multiprocessing anomalies. Bell system technical journal 45, 9 (1966), 1563\u20131581."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447545.3451183"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976830.12"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00060"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt086"},{"key":"e_1_3_2_1_26_1","volume-title":"Terabase-scale metagenome coassembly with MetaHipMer. Scientific reports 10, 1","author":"Hofmeyr Steven","year":"2020","unstructured":"Steven Hofmeyr, Rob Egan, Evangelos Georganas, Alex\u00a0C Copeland, Robert Riley, Alicia Clum, Emiley Eloe-Fadrosh, Simon Roux, Eugene Goltsman, Ayd\u0131n Bulu\u00e7, 2020. Terabase-scale metagenome coassembly with MetaHipMer. Scientific reports 10, 1 (2020), 1\u201311."},{"key":"e_1_3_2_1_27_1","volume-title":"Highly accurate long-read HiFi sequencing data for five complex genomes. Scientific data 7, 1","author":"Hon Ting","year":"2020","unstructured":"Ting Hon, Kristin Mars, Greg Young, Yu-Chih Tsai, Joseph\u00a0W Karalius, Jane\u00a0M Landolin, Nicholas Maurer, David Kudrna, Michael\u00a0A Hardigan, Cynthia\u00a0C Steiner, 2020. Highly accurate long-read HiFi sequencing data for five complex genomes. Scientific data 7, 1 (2020), 1\u201311."},{"key":"e_1_3_2_1_28_1","volume-title":"Assembly of long, error-prone reads using repeat graphs. Nature biotechnology 37, 5","author":"Kolmogorov Mikhail","year":"2019","unstructured":"Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin, and Pavel\u00a0A Pevzner. 2019. Assembly of long, error-prone reads using repeat graphs. Nature biotechnology 37, 5 (2019), 540\u2013546."},{"key":"e_1_3_2_1_29_1","volume-title":"Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation. Genome research 27, 5","author":"Koren Sergey","year":"2017","unstructured":"Sergey Koren, Brian\u00a0P Walenz, Konstantin Berlin, Jason\u00a0R Miller, Nicholas\u00a0H Bergman, and Adam\u00a0M Phillippy. 2017. Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation. Genome research 27, 5 (2017), 722\u2013736."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw152"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74126-8_27"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2019.2941702"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1520805.1520818"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0005"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00061"},{"key":"e_1_3_2_1_36_1","volume-title":"HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads. Genome research 30, 9","author":"Nurk Sergey","year":"2020","unstructured":"Sergey Nurk, Brian\u00a0P Walenz, Arang Rhie, Mitchell\u00a0R Vollger, Glennis\u00a0A Logsdon, Robert Grothe, Karen\u00a0H Miga, Evan\u00a0E Eichler, Adam\u00a0M Phillippy, and Sergey Koren. 2020. HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads. Genome research 30, 9 (2020), 1291\u20131305."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2008-9-3-r55"},{"key":"e_1_3_2_1_38_1","unstructured":"Daniel Reed Dennis Gannon and Jack Dongarra. 2022. Reinventing High Performance Computing: Challenges and Opportunities. arXiv preprint arXiv:2203.02544(2022)."},{"key":"e_1_3_2_1_39_1","volume-title":"Distributed Many-to-Many Protein Sequence Alignment Using Sparse Matrices. The International Conference for High Performance Computing, Networking, Storage and Analysis (SC)(2020)","author":"Selvitopi Oguz","year":"2020","unstructured":"Oguz Selvitopi, Saliya Ekanayake, Giulia Guidi, Georgios Pavlopoulos, Ariful Azad, and Ayd\u0131n Bulu\u00e7. 2020. Distributed Many-to-Many Protein Sequence Alignment Using Sparse Matrices. The International Conference for High Performance Computing, Networking, Storage and Analysis (SC)(2020)."},{"key":"e_1_3_2_1_40_1","volume-title":"Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes. Nature biotechnology 38, 9","author":"Shafin Kishwar","year":"2020","unstructured":"Kishwar Shafin, Trevor Pesout, Ryan Lorig-Roach, Marina Haukness, Hugh\u00a0E Olsen, Colleen Bosworth, Joel Armstrong, Kristof Tigyi, Nicholas Maurer, Sergey Koren, 2020. Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes. Nature biotechnology 38, 9 (2020), 1044\u20131053."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00055"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0017915"}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","location":"Bordeaux France","acronym":"ICPP '22"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:44Z","timestamp":1750186964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":41,"alternative-id":["10.1145\/3545008.3545050","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545050","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}