{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:07:42Z","timestamp":1782968862137,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607094","type":"proceedings-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:47:06Z","timestamp":1699998426000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Space Efficient Sequence Alignment for SRAM-Based Computing: X-Drop on the Graphcore IPU"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8019-7047","authenticated-orcid":false,"given":"Luk","family":"Burchard","sequence":"first","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7259-1901","authenticated-orcid":false,"given":"Max Xiaohang","family":"Zhao","sequence":"additional","affiliation":[{"name":"Charit\u00e9 Universit\u00e4tsmedizin Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4200-511X","authenticated-orcid":false,"given":"Johannes","family":"Langguth","sequence":"additional","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway"},{"name":"University of Bergen, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7253-9038","authenticated-orcid":false,"given":"Ayd\u0131n","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, United States of America"},{"name":"University of California, Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8925-3239","authenticated-orcid":false,"given":"Giulia","family":"Guidi","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-021-02443-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-1935-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1998.5.173"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-020-03720-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2023.979699"},{"key":"e_1_3_2_1_7_1","volume-title":"Konstantin Pogorelov, and Johannes Langguth.","author":"Burchard Luk","year":"2021","unstructured":"Luk Burchard , Johannes Moe , Daniel Thilo Schroeder , Konstantin Pogorelov, and Johannes Langguth. 2021 . Ipug : Accelerating Breadth-First Graph Traversals Using Manycore Graphcore Ipus. In High Performance Computing: 36th International Conference, ISC High Performance 2021, Virtual Event, June 24--July 2, 2021, Proceedings. Springer , 291--309. Luk Burchard, Johannes Moe, Daniel Thilo Schroeder, Konstantin Pogorelov, and Johannes Langguth. 2021. Ipug: Accelerating Breadth-First Graph Traversals Using Manycore Graphcore Ipus. In High Performance Computing: 36th International Conference, ISC High Performance 2021, Virtual Event, June 24--July 2, 2021, Proceedings. Springer, 291--309."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2009.07692"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_10_1","first-page":"29","article-title":"An Algorithm for Syntactical Analysis","volume":"3","author":"D\u00f6m\u00f6lki B\u00e1lint","year":"1964","unstructured":"B\u00e1lint D\u00f6m\u00f6lki . 1964 . An Algorithm for Syntactical Analysis . Computational Linguistics 3 , 29 -- 46 (1964), 151. B\u00e1lint D\u00f6m\u00f6lki. 1964. An Algorithm for Syntactical Analysis. Computational Linguistics 3, 29--46 (1964), 151.","journal-title":"Computational Linguistics"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337918"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(82)90398-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2013.68"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545050"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Giulia Guidi Oguz Selvitopi Marquita Ellis Leonid Oliker Katherine Yelick and Aydin Buluc. 2020. Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly. arXiv:arXiv:2010.10055  Giulia Guidi Oguz Selvitopi Marquita Ellis Leonid Oliker Katherine Yelick and Aydin Buluc. 2020. Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly. arXiv:arXiv:2010.10055","DOI":"10.1109\/IPDPS49936.2021.00060"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2019.8824830"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.89.22.10915"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1912.03413"},{"key":"e_1_3_2_1_20_1","volume-title":"Graphcore. In 2021 IEEE Hot Chips 33 Symposium (HCS). IEEE, 1--25","author":"Knowles Simon","year":"2021","unstructured":"Simon Knowles . 2021 . Graphcore. In 2021 IEEE Hot Chips 33 Symposium (HCS). IEEE, 1--25 . Simon Knowles. 2021. Graphcore. In 2021 IEEE Hot Chips 33 Symposium (HCS). IEEE, 1--25."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3112025"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1816021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty191"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad151"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2010.04.053"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts061"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-117"},{"key":"e_1_3_2_1_28_1","volume-title":"Using the Graphcore IPU for Traditional HPC Applications. In 3rd Workshop on Accelerated Machine Learning (AccML).","author":"Louw Thorben","year":"2021","unstructured":"Thorben Louw and Simon McIntosh-Smith . 2021 . Using the Graphcore IPU for Traditional HPC Applications. In 3rd Workshop on Accelerated Machine Learning (AccML). Thorben Louw and Simon McIntosh-Smith. 2021. Using the Graphcore IPU for Traditional HPC Applications. In 3rd Workshop on Accelerated Machine Learning (AccML)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Hans Meuer Erich Strohmaier Jack Dongarra and Horst Simon. 2001. Top500 supercomputer sites.  Hans Meuer Erich Strohmaier Jack Dongarra and Horst Simon. 2001. Top500 supercomputer sites.","DOI":"10.2172\/843058"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2021.102276"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532376"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Onur Mutlu Saugata Ghose Juan G\u00f3mez-Luna and Rachata Ausavarungnirun. 2022. A Modern Primer on Processing in Memory. arXiv:arXiv:2012.03112  Onur Mutlu Saugata Ghose Juan G\u00f3mez-Luna and Rachata Ausavarungnirun. 2022. A Modern Primer on Processing in Memory. arXiv:arXiv:2012.03112","DOI":"10.1007\/978-981-16-7487-7_7"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/4.1.11"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.abj6987"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty380"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbiotec.2017.07.017"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/3433701.3433800"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-022-01539-7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3088396"},{"key":"e_1_3_2_1_41_1","volume-title":"Clustering huge protein sequence sets in linear time. Nature communications 9, 1","author":"Steinegger Martin","year":"2018","unstructured":"Martin Steinegger and Johannes S\u00f6ding . 2018. Clustering huge protein sequence sets in linear time. Nature communications 9, 1 ( 2018 ), 2542. Martin Steinegger and Johannes S\u00f6ding. 2018. Clustering huge protein sequence sets in linear time. Nature communications 9, 1 (2018), 2542."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2014-8"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2014.6927483"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq644"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3239537"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw769"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM51124.2021.00023"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00055"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1998.5.197"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1089\/10665270050081478"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2018.2854700"}],"event":{"name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver CO USA","acronym":"SC '23","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607094","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":52,"alternative-id":["10.1145\/3581784.3607094","10.1145\/3581784"],"URL":"https:\/\/doi.org\/10.1145\/3581784.3607094","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}