{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:11Z","timestamp":1750219991383,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CCF-2008422"],"award-info":[{"award-number":["CCF-2008422"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591078","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"249-259","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4961-763X","authenticated-orcid":false,"given":"Nairen","family":"Cao","sequence":"first","affiliation":[{"name":"Boston College, Boston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9799-0981","authenticated-orcid":false,"given":"Shang-En","family":"Huang","sequence":"additional","affiliation":[{"name":"Boston College, Boston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7970-9604","authenticated-orcid":false,"given":"Hsin-Hao","family":"Su","sequence":"additional","affiliation":[{"name":"Boston College, Boston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321922"},{"key":"e_1_3_2_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225173"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00307-0"},{"key":"e_1_3_2_3_5_1","doi-asserted-by":"publisher","DOI":"10.1105\/tpc.112.103010"},{"key":"e_1_3_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250877"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402007"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.04.003"},{"key":"e_1_3_2_3_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar"},{"key":"e_1_3_2_3_10_1","volume-title":"Using MUMmer to identify similar regions in large sequence sets. Current protocols in bioinformatics 1","author":"Delcher Arthur L","year":"2003","unstructured":"Arthur L Delcher, Steven L Salzberg, and Adam M Phillippy. 2003. Using MUMmer to identify similar regions in large sequence sets. Current protocols in bioinformatics 1 (2003), 10--3."},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90103-X"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-013-9376-1"},{"key":"e_1_3_2_3_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1053"},{"key":"e_1_3_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378756"},{"key":"e_1_3_2_3_15_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2208.09809"},{"key":"e_1_3_2_3_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.09.001"},{"key":"e_1_3_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2016.09.001"},{"key":"e_1_3_2_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055460"},{"key":"e_1_3_2_3_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_49"},{"key":"e_1_3_2_3_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--14390--8_19"},{"key":"e_1_3_2_3_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810521"},{"key":"e_1_3_2_3_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.298210"},{"key":"e_1_3_2_3_23_1","volume-title":"Mohamed Abdur Rahman, and Saleh M. Basalamah.","author":"Madkour Amgad","year":"2017","unstructured":"Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, and Saleh M. Basalamah. 2017. A Survey of Shortest-Path Algorithms. CoRR, Vol. abs\/1705.02044 (2017). [arXiv]1705.02044 http:\/\/arxiv.org\/abs\/1705.02044"},{"key":"e_1_3_2_3_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626406002459"},{"key":"e_1_3_2_3_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3138860.3138869"},{"key":"e_1_3_2_3_26_1","first-page":"165","article-title":"Evolutionary analysis of regulatory sequences (EARS) in plants","volume":"64","author":"Picot Emma","year":"2010","unstructured":"Emma Picot, Peter Krusche, Alexander Tiskin, Isabelle Carr\u00e9, and Sascha Ott. 2010. Evolutionary analysis of regulatory sequences (EARS) in plants. The Plant Journal, Vol. 64, 1 (2010), 165--176.","journal-title":"The Plant Journal"},{"key":"e_1_3_2_3_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207169708804607"},{"key":"e_1_3_2_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00968--2"},{"key":"e_1_3_2_3_29_1","volume-title":"Reading","author":"Sankoff David","year":"1983","unstructured":"David Sankoff. 1983. Time warps, string edits, and macromolecules. The Theory and Practice of Sequence Comparison, Reading (1983)."},{"key":"e_1_3_2_3_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11751649_2"},{"key":"e_1_3_2_3_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538574"},{"key":"e_1_3_2_3_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.13"},{"key":"e_1_3_2_3_33_1","doi-asserted-by":"publisher","unstructured":"Alexander Tiskin. 2007. Semi-local string comparison: algorithmic techniques and applications. (2007). https:\/\/doi.org\/10.48550\/ARXIV.0707.3619","DOI":"10.48550\/ARXIV.0707.3619"},{"key":"e_1_3_2_3_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.07.001"},{"key":"e_1_3_2_3_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.103"},{"key":"e_1_3_2_3_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9830-z"},{"key":"e_1_3_2_3_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90031-X"},{"key":"e_1_3_2_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Orlando FL USA","acronym":"SPAA '23"},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591078","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591078","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:33Z","timestamp":1750182573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":38,"alternative-id":["10.1145\/3558481.3591078","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591078","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}