{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:45:06Z","timestamp":1759693506210,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Guangzhou Science and Technology Program","award":["201802010011"],"award-info":[{"award-number":["201802010011"]}]},{"name":"Guangdong Science and Technology Program","award":["2017A050506025"],"award-info":[{"award-number":["2017A050506025"]}]},{"name":"General Research Fund","award":["18300215"],"award-info":[{"award-number":["18300215"]}]},{"name":"Grant Council of the University Grants Committee of Hong Kong SAR"},{"name":"Guangzhou Science and Technology Program","award":["201707010165"],"award-info":[{"award-number":["201707010165"]}]},{"name":"Opening Project of Guangdong Province Key Laboratory of Information Security Technology","award":["2017B030314131"],"award-info":[{"award-number":["2017B030314131"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018,12,1]]},"DOI":"10.1109\/tc.2018.2842050","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T22:43:23Z","timestamp":1528152203000},"page":"1737-1749","source":"Crossref","is-referenced-by-count":17,"title":["Fast In-Place Suffix Sorting on a Multicore Computer"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4017-0357","authenticated-orcid":false,"given":"Bin","family":"Lao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Nong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai Hong","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5027-1517","authenticated-orcid":false,"given":"Jing Yi","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442536"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3867"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-2395-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/BMEI.2014.7002859"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2017.04.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1242471.1242472"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974768.8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_47"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref27","first-page":"148","article-title":"New suffix array algorithms - linear but not fast?","author":"antonitio","year":"2004","journal-title":"Proc 15th Australasian Workshop Combinatorial Algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbt081"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2493175.2493180"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.188"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2699665"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2518175"},{"key":"ref2","first-page":"1","article-title":"A block-sorting lossless data compression algorithm","volume":"124","author":"burrows","year":"1994","journal-title":"SRC Res Report"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34109-0_40"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00065-0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.017"},{"year":"2017","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_73"},{"article-title":"Pizza&Chili Corpus, compressed indexes and their testbeds","year":"2005","author":"ferragina","key":"ref24"},{"article-title":"a software library that implements a lightweight suffix array\n construction algorithm","year":"2015","author":"libdivsufsort","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67428-5_15"},{"key":"ref25","first-page":"26:1","article-title":"On the benefit of merging suffix array intervals for parallel pattern matching","author":"fischer","year":"2016","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8525378\/08371211.pdf?arnumber=8371211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:10:22Z","timestamp":1642003822000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8371211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":27,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2842050","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2018,12,1]]}}}