{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:03:18Z","timestamp":1753437798737,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100004318","name":"Microsoft","doi-asserted-by":"publisher","award":["MRA11EG01"],"award-info":[{"award-number":["MRA11EG01"]}],"id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472505","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:46:04Z","timestamp":1633459564000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Accelerating Sequence-to-Graph Alignment on Heterogeneous Processors"],"prefix":"10.1145","author":[{"given":"Zonghao","family":"Feng","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong"}]},{"given":"Qiong","family":"Luo","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Optimal Sequence Alignment Using Affine Gap Costs. Bulletin of mathematical biology 48, 5-6","author":"Altschul F.","year":"1986","unstructured":"Stephen\u00a0 F. Altschul and Bruce\u00a0 W. Erickson . 1986. Optimal Sequence Alignment Using Affine Gap Costs. Bulletin of mathematical biology 48, 5-6 ( 1986 ), 603\u2013616. Stephen\u00a0F. Altschul and Bruce\u00a0W. Erickson. 1986. Optimal Sequence Alignment Using Affine Gap Costs. Bulletin of mathematical biology 48, 5-6 (1986), 603\u2013616."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa265"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng.3257"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337918"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty279"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4227"},{"key":"e_1_3_2_1_7_1","volume-title":"AStarix: Fast and Optimal Sequence-to-Graph Alignment. In 24th Annual International Conference on Research in Computational Molecular Biology(RECOMB","author":"Ivanov Pesho","year":"2020","unstructured":"Pesho Ivanov , Benjamin Bichsel , Harun Mustafa , Andr\u00e9 Kahles , Gunnar R\u00e4tsch , and Martin Vechev . 2020 . AStarix: Fast and Optimal Sequence-to-Graph Alignment. In 24th Annual International Conference on Research in Computational Molecular Biology(RECOMB 2020). Springer, 104\u2013119. Pesho Ivanov, Benjamin Bichsel, Harun Mustafa, Andr\u00e9 Kahles, Gunnar R\u00e4tsch, and Martin Vechev. 2020. AStarix: Fast and Optimal Sequence-to-Graph Alignment. In 24th Annual International Conference on Research in Computational Molecular Biology(RECOMB 2020). Springer, 104\u2013119."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00055"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0066"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbq015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz102"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-117"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00333-3"},{"key":"e_1_3_2_1_14_1","volume-title":"bioRxiv","author":"Novak M.","year":"2017","unstructured":"Adam\u00a0 M. Novak , Glenn Hickey , Erik Garrison , Sean Blum , Abram Connelly , Alexander Dilthey , Jordan Eizenga , M.\u00a0A.\u00a0 Saleh Elmohamed , Sally Guthrie , Andr\u00e9 Kahles , Stephen Keenan , Jerome Kelleher , Deniz Kural , Heng Li , Michael\u00a0 F. Lin , Karen Miga , Nancy Ouyang , Goran Rakocevic , Maciek Smuga-Otto , Alexander\u00a0Wait Zaranek , Richard Durbin , Gil McVean , David Haussler , and Benedict Paten . 2017. Genome Graphs . bioRxiv ( 2017 ), 101378. Adam\u00a0M. Novak, Glenn Hickey, Erik Garrison, Sean Blum, Abram Connelly, Alexander Dilthey, Jordan Eizenga, M.\u00a0A.\u00a0Saleh Elmohamed, Sally Guthrie, Andr\u00e9 Kahles, Stephen Keenan, Jerome Kelleher, Deniz Kural, Heng Li, Michael\u00a0F. Lin, Karen Miga, Nancy Ouyang, Goran Rakocevic, Maciek Smuga-Otto, Alexander\u00a0Wait Zaranek, Richard Durbin, Gil McVean, David Haussler, and Benedict Paten. 2017. Genome Graphs. bioRxiv (2017), 101378."},{"key":"e_1_3_2_1_15_1","volume-title":"Memory-Efficient and SNP-Aware Short Read Alignment Tool. In 2019 IEEE International Conference on Bioinformatics and Biomedicine(BIBM","author":"Quan Wei","year":"2019","unstructured":"Wei Quan , Bo Liu , and Yadong Wang . 2019 . SALT: A Fast , Memory-Efficient and SNP-Aware Short Read Alignment Tool. In 2019 IEEE International Conference on Bioinformatics and Biomedicine(BIBM 2019). IEEE, 1774\u20131779. Wei Quan, Bo Liu, and Yadong Wang. 2019. SALT: A Fast, Memory-Efficient and SNP-Aware Short Read Alignment Tool. In 2019 IEEE International Conference on Bioinformatics and Biomedicine(BIBM 2019). IEEE, 1774\u20131779."},{"key":"e_1_3_2_1_16_1","volume-title":"GraphAligner: Rapid and Versatile Sequence-to-Graph Alignment. bioRxiv","author":"Rautiainen Mikko","year":"2019","unstructured":"Mikko Rautiainen and Tobias Marschall . 2019. GraphAligner: Rapid and Versatile Sequence-to-Graph Alignment. bioRxiv ( 2019 ). Mikko Rautiainen and Tobias Marschall. 2019. GraphAligner: Rapid and Versatile Sequence-to-Graph Alignment. bioRxiv (2019)."},{"volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Yousef","key":"e_1_3_2_1_17_1","unstructured":"Yousef Saad . 2003. Iterative Methods for Sparse Linear Systems ( second ed.). SIAM. Yousef Saad. 2003. Iterative Methods for Sparse Linear Systems (second ed.). SIAM."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2014-8"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:12Z","timestamp":1750193292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":19,"alternative-id":["10.1145\/3472456.3472505","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472505","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}