{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:35:28Z","timestamp":1761989728614},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2109988"],"award-info":[{"award-number":["CCF-2109988"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,25]]},"DOI":"10.1109\/hpec58863.2023.10363472","type":"proceedings-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T19:39:57Z","timestamp":1703533197000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Longest Common SubSequence Analysis In Chapel"],"prefix":"10.1109","author":[{"given":"Soroush","family":"Vahidi","sequence":"first","affiliation":[{"name":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Computer Science,Newark,NJ,USA"}]},{"given":"Zhihui","family":"Du","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"}]}],"member":"263","reference":[{"journal-title":"Improved approximation for longest common subsequence over small alphabets","year":"2021","author":"Akmal","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1216-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.1997.634481"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.1998.712980"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"ref6","first-page":"143","article-title":"Parallel computing the longest common subsequence (LCS) on GPUs: Efficiency and language suitability","volume-title":"The 1st International Conference on Advanced Communications and Computation (INFOCOMP)","author":"Dhraief","year":"2011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106499"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2003.1183610"},{"key":"ref9","article-title":"Parallel Longest Common Subsequence using Graphics Hardware","volume-title":"Eurographics Symposium on Parallel Graphics and Visualization. The Eurographics Association","author":"Kloetzli","year":"2008"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.79"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/71.298210"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3329722.3330148"},{"volume-title":"GPU Gems 3, chapter 39","year":"2007","author":"Nguyen","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00071"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102598"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"},{"key":"ref17","article-title":"An efficient parallel algorithm for longest common subsequence problem on GPU s","volume-title":"In World Congress on Engineering (WCE)","author":"Yang","year":"2010"}],"event":{"name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2023,9,25]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,9,29]]}},"container-title":["2023 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10363430\/10363422\/10363472.pdf?arnumber=10363472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T20:34:04Z","timestamp":1705091644000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10363472\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/hpec58863.2023.10363472","relation":{},"subject":[],"published":{"date-parts":[[2023,9,25]]}}}