{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:36:21Z","timestamp":1778585781143,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Guangzhou Science and Technology Program","award":["201707010165"],"award-info":[{"award-number":["201707010165"]}]},{"name":"Guangdong Science and Technology Program","award":["2017A050506025"],"award-info":[{"award-number":["2017A050506025"]}]},{"name":"General Research Fund","award":["18300215"],"award-info":[{"award-number":["18300215"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11227-018-2395-5","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T09:48:36Z","timestamp":1525254516000},"page":"3468-3485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Fast induced sorting suffixes on a multicore machine"],"prefix":"10.1007","volume":"74","author":[{"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"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"issue":"3","key":"2395_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1467-8659.1986.tb00296.x","volume":"5","author":"HR Arabnia","year":"1986","unstructured":"Arabnia HR, Oliver MA (1986) Fast operations on raster images with SIMD machine architectures. Comput Graph Forum 5(3):179\u2013188","journal-title":"Comput Graph Forum"},{"key":"2395_CR2","first-page":"1","volume":"124","author":"M Burrows","year":"1994","unstructured":"Burrows M, Wheeler DJ (1994) A block-sorting lossless data compression algorithm. SRC Res Rep 124:1\u201324","journal-title":"SRC Res Rep"},{"key":"2395_CR3","unstructured":"Ferragina P, Navarro G (2005) Pizza&Chili Corpus, compressed indexes and their testbeds. \n                    http:\/\/pizzachili.dcc.uchile.cl"},{"key":"2395_CR4","doi-asserted-by":"crossref","unstructured":"Fischer J (2011) Inducing the LCP-array. In: Proceedings of the 12th International Symposium on Algorithms and Data Structures. Springer, pp 374\u2013385","DOI":"10.1007\/978-3-642-22300-6_32"},{"key":"2395_CR5","unstructured":"Intel Corporation (2017) Intel TBB, a widely used C++ template library for task parallelism. \n                    https:\/\/www.threadingbuildingblocks.org"},{"key":"2395_CR6","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J, Kempa D, Puglisi SJ, Zhukova B (2017) Engineering external memory induced suffix sorting. In: Proceedings of the 19th Workshop on Algorithm Engineering and Experiments. SIAM, pp 98\u2013108","DOI":"10.1137\/1.9781611974768.8"},{"issue":"1","key":"2395_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2017.04.001","volume":"43","author":"J Labeit","year":"2017","unstructured":"Labeit J, Shun J, Blelloch GE (2017) Parallel lightweight wavelet tree, suffix array and FM-index construction. J Discrete Algorithms 43(1):2\u201317","journal-title":"J Discrete Algorithms"},{"issue":"9","key":"2395_CR8","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1002\/spe.2377","volume":"46","author":"WJ Liu","year":"2016","unstructured":"Liu WJ, Nong G, Chan WH, Wu Y (2016) Improving a lightweight LZ77 computation algorithm for running faster. Softw Pract Exp 46(9):1201\u20131217","journal-title":"Softw Pract Exp"},{"issue":"5","key":"2395_CR9","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber U, Myers G (1993) Suffix arrays: a new method for on-line string searches. SIAM J Comput 22(5):935\u2013948","journal-title":"SIAM J Comput"},{"key":"2395_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.apnum.2014.12.008","volume":"104","author":"PD Michailidis","year":"2016","unstructured":"Michailidis PD, Margaritis KG (2016) Scientific computations on multi-core systems using different programming frameworks. Appl Numer Math 104:62\u201380","journal-title":"Appl Numer Math"},{"key":"2395_CR11","unstructured":"Mori Y (2010) sais-lite-2.4.1, an optimized implementation of the induced sorting algorithm. \n                    https:\/\/sites.google.com\/site\/yuta256\/sais\/"},{"key":"2395_CR12","unstructured":"Mori Y (2015) Libdivsufsort, a software library that implements a lightweight suffix array construction algorithm. \n                    https:\/\/github.com\/y-256\/libdivsufsort"},{"key":"2395_CR13","unstructured":"Nawaz MS, Lali MI, Saleem S, Ali H (2014) Comparison of multi-core parallel programming models for divide and conquer algorithms. NED University Journal of Research, pp 1\u20138"},{"issue":"3","key":"2395_CR14","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2493175.2493180","volume":"31","author":"G Nong","year":"2013","unstructured":"Nong G (2013) Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACM Trans Inf Syst 31(3):15:1\u201315:15","journal-title":"ACM Trans Inf Syst"},{"issue":"10","key":"2395_CR15","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G Nong","year":"2011","unstructured":"Nong G, Zhang S, Chan WH (2011) Two efficient algorithms for linear time suffix array construction. IEEE Trans Comput 60(10):1471\u20131484","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"2395_CR16","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1242471.1242472","volume":"39","author":"SJ Puglisi","year":"2007","unstructured":"Puglisi SJ, Smyth WF, Turpin AH (2007) A taxonomy of suffix array construction algorithms. ACM Comput Surv 39(2):4:1\u20134:31","journal-title":"ACM Comput Surv"},{"issue":"3","key":"2395_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00354-013-0301-5","volume":"31","author":"LM Sanchez","year":"2013","unstructured":"Sanchez LM, Fernandez J, Sotomayor R, Escolar S, Garcia JD (2013) A comparative study and evaluation of parallel programming models for shared-memory parallel architectures. New Gener Comput 31(3):139\u2013161","journal-title":"New Gener Comput"},{"issue":"2","key":"2395_CR18","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1093\/bib\/bbt081","volume":"15","author":"AMS Shrestha","year":"2014","unstructured":"Shrestha AMS, Frith MC, Horton P (2014) A bioinformatician\u2019s guide to the forefront of suffix array construction algorithms. Brief Bioinform 15(2):138\u2013154","journal-title":"Brief Bioinform"},{"issue":"1","key":"2395_CR19","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2661653","volume":"1","author":"J Shun","year":"2014","unstructured":"Shun J, Blelloch GE (2014) A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. ACM Trans Parallel Comput 1(1):8:1\u20138:20","journal-title":"ACM Trans Parallel Comput"},{"key":"2395_CR20","doi-asserted-by":"crossref","unstructured":"Shun J, Blelloch GE, Fineman JT, Gibbons PB, Kyrola A, Simhadri HV, Tangwongsan K (2012) Brief announcement: the problem based benchmark suite. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, pp 68\u201370","DOI":"10.1145\/2312005.2312018"},{"issue":"4","key":"2395_CR21","first-page":"465","volume":"12","author":"H Valafar","year":"2004","unstructured":"Valafar H, Arabnia HR, Williams G (2004) Distributed global optimization and its development on the multiring network. Neural Parallel Sci Comput 12(4):465\u2013490","journal-title":"Neural Parallel Sci Comput"},{"issue":"12","key":"2395_CR22","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1002\/cpe.3867","volume":"28","author":"L Wang","year":"2016","unstructured":"Wang L, Baxter S, Owens JD (2016) Fast parallel skew and prefix-doubling suffix array construction on the GPU. Concurr Comput Pract Exp 28(12):3466\u20133484","journal-title":"Concurr Comput Pract Exp"},{"issue":"1","key":"2395_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1022804606389","volume":"25","author":"MA Wani","year":"2003","unstructured":"Wani MA, Arabnia HR (2003) Parallel edge-region-based segmentation algorithm targeted at reconfigurable multiring network. J Supercomput 25(1):43\u201362","journal-title":"J Supercomput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2395-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2395-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2395-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:26:44Z","timestamp":1556738804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2395-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,2]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["2395"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2395-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,2]]},"assertion":[{"value":"2 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}