{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:09:34Z","timestamp":1756994974374,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872391"],"award-info":[{"award-number":["61872391"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Science and Technology Program","award":["201802010011"],"award-info":[{"award-number":["201802010011"]}]},{"name":"Foundation for Young Talents in Higher Education of Guangdong","award":["2019KQNCX031"],"award-info":[{"award-number":["2019KQNCX031"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11227-021-04165-w","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T11:03:44Z","timestamp":1636369424000},"page":"7278-7303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Succinct parallel Lempel\u2013Ziv factorization on a multicore computer"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7779-5057","authenticated-orcid":false,"given":"Ling Bo","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4017-0357","authenticated-orcid":false,"given":"Bin","family":"Lao","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Nong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"4165_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans Inf Theory 23:337\u2013343. https:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"4165_CR2","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1007\/s10664-020-09822-x","volume":"25","author":"K Yao","year":"2020","unstructured":"Yao K, Li H, Shang W et al (2020) A study of the performance of general compressors on log files. Empir Softw Eng 25(5):3043\u20133085","journal-title":"Empir Softw Eng"},{"key":"4165_CR3","doi-asserted-by":"crossref","unstructured":"Puglisi SJ, Zhukova B (2020) Relative Lempel-Ziv compression of suffix arrays. In: Boucher C, Thankachan SV (eds). The 27th International Symposium on String Processing and Information Retrieval. Springer, pp 89\u201396","DOI":"10.1007\/978-3-030-59212-7_7"},{"key":"4165_CR4","doi-asserted-by":"crossref","unstructured":"Sun X, Wu D, Mo D, et al (2021) Accelerating Knuth\u2013Morris\u2013Pratt string matching over LZ77 compressed text. In: Bilgin A, Marcellin M W, Serra-Sagrist\u00e0 J, Storer J A (eds). 2021 Data Compression Conference. IEEE, pp 372","DOI":"10.1109\/DCC50243.2021.00070"},{"issue":"2","key":"4165_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.3390\/a14020044","volume":"14","author":"D K\u00f6ppl","year":"2021","unstructured":"K\u00f6ppl D (2021) Non-overlapping LZ77 factorization and LZ78 substring compression queries with suffix trees. Algorithms 14(2):44. https:\/\/doi.org\/10.3390\/a14020044","journal-title":"Algorithms"},{"key":"4165_CR6","unstructured":"Bannai H, Gagie T, Tomohiro I (2018) Online LZ77 parsing and matching statistics with RLBWTs. In: Navarro\u00a0G, Sankoff\u00a0D, Zhu\u00a0B (eds). Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1\u20137:12"},{"issue":"21","key":"4165_CR7","doi-asserted-by":"publisher","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","volume":"27","author":"S Deorowicz","year":"2011","unstructured":"Deorowicz S, Grabowski S (2011) Robust relative compression of genomes with random access. Bioinform 27(21):2979\u20132986. https:\/\/doi.org\/10.1093\/bioinformatics\/btr505","journal-title":"Bioinform"},{"issue":"9","key":"4165_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 et al (2016) Improving a lightweight LZ77 computation algorithm for running faster. Softw Pract Exp 46(9):1201\u20131217. https:\/\/doi.org\/10.1002\/spe.2377","journal-title":"Softw Pract Exp"},{"key":"4165_CR9","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J, Kempa D, Puglisi S J (2016) Lazy Lempel-Ziv factorization algorithms. ACM J Exp Algorithmics 21(1):2.4:1\u20132.4:19. https:\/\/doi.org\/10.1145\/2699876","DOI":"10.1145\/2699876"},{"key":"4165_CR10","doi-asserted-by":"crossref","unstructured":"Goto K, Bannai H (2014) Space efficient linear time Lempel-Ziv factorization for small alphabets. In: Bilgin A, Marcellin M W, Serra-Sagrist\u00e0 J, Storer J A (eds) 2014 Data Compression Conference. IEEE, pp 163\u2013172","DOI":"10.1109\/DCC.2014.62"},{"key":"4165_CR11","unstructured":"Shun J, Zhao J (2013) Practical parallel Lempel-Ziv factorization. In: Bilgin A, Marcellin M W, Serra-Sagrist\u00e0 J, Storer J A (eds) 2013 Data Compression Conference. IEEE, pp 123\u2013132"},{"key":"4165_CR12","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1007\/s00453-017-0333-1","volume":"80","author":"J Fisher","year":"2018","unstructured":"Fisher J, I T, K\u00f6ppl D et al (2018) Lempel-Ziv factorization powered by space efficient suffix trees. Algorithmica 80:2048\u20132081. https:\/\/doi.org\/10.1007\/s00453-017-0333-1","journal-title":"Algorithmica"},{"issue":"6","key":"4165_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.3390\/a14060161","volume":"14","author":"D K\u00f6ppl","year":"2021","unstructured":"K\u00f6ppl D (2021) Reversed Lempel-Ziv Factorization with suffix trees. Algorithms 14(6):161. https:\/\/doi.org\/10.3390\/a14060161","journal-title":"Algorithms"},{"key":"4165_CR14","doi-asserted-by":"crossref","unstructured":"Golnaz Badkobeh G, Crochemore M et al (2012) Computing the Maximal-Exponent repeats of an overlap-free string in linear time. In: Calder\u00f3n-Benavides L, Gonz\u00e1lez-Caro CN, Ch\u00e1vez E, Ziviani N (eds) The 19th International Symposium on String Processing and Information Retrieval. Springer, pp 61\u201372","DOI":"10.1007\/978-3-642-34109-0_8"},{"issue":"5","key":"4165_CR15","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. https:\/\/doi.org\/10.1137\/0222058","journal-title":"SIAM J Comput"},{"issue":"3","key":"4165_CR16","doi-asserted-by":"publisher","first-page":"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):1\u201315. https:\/\/doi.org\/10.1145\/2493175.2493180","journal-title":"ACM Trans Inf Syst"},{"issue":"11","key":"4165_CR17","doi-asserted-by":"publisher","first-page":"3195","DOI":"10.1007\/s00453-020-00722-6","volume":"82","author":"D Kosolobov","year":"2020","unstructured":"Kosolobov D, Valenzuela D, K\u00f6ppl D et al (2020) Lempel-Ziv-Like parsing in small space. Algorithmica 82(11):3195\u20133215. https:\/\/doi.org\/10.1007\/s00453-020-00722-6","journal-title":"Algorithmica"},{"key":"4165_CR18","doi-asserted-by":"crossref","unstructured":"Fischer j, Gagie T, Gawrychowski P, et al (2015) Approximating LZ77 via small-space multiple-pattern matching. In: Nikhil Bansal N, Finocchi I (eds) Proceedings of the 23rd Annual European Symposium on Algorithms. Springer, pp 533\u2013544","DOI":"10.1007\/978-3-662-48350-3_45"},{"key":"4165_CR19","doi-asserted-by":"crossref","unstructured":"Gagie T, Navarro G, Prezza N, et al (2018) On the approximation ratio of Lempel-Ziv parsing. In: Bender M A, Farach-ColtonM, Mosteiro M A (eds) Proceedings of the 13th Latin American Symposium on Theoretical Informatics (LATIN). Springer, pp 490\u2013503","DOI":"10.1007\/978-3-319-77404-6_36"},{"key":"4165_CR20","doi-asserted-by":"crossref","unstructured":"Gagie G, Navarro G, Prezza N (2018) Optimal-time text indexing in BWT-runs bounded space. In: Czumaj A (eds) Proceedings of the Twenty-Ninth Symposium on Discrete Algorithms. SIAM, pp 1459\u20131477","DOI":"10.1137\/1.9781611975031.96"},{"issue":"12","key":"4165_CR21","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1109\/TC.2018.2842050","volume":"67","author":"B Lao","year":"2018","unstructured":"Lao B, Nong G, Chan WH et al (2018) Fast in-place suffix sorting on a multicore computer. IEEE Trans Computers 67(12):1737\u20131749. https:\/\/doi.org\/10.1109\/TC.2018.2842050","journal-title":"IEEE Trans Computers"},{"issue":"2","key":"4165_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M Crochemore","year":"2008","unstructured":"Crochemore M, Ilie L (2008) Computing longest previous factor in linear time and applications. Inf Process Lett 106(2):75\u201380. https:\/\/doi.org\/10.1016\/j.ipl.2007.10.006","journal-title":"Inf Process Lett"},{"key":"4165_CR23","doi-asserted-by":"crossref","unstructured":"Liu WJ, Nong G, Chan WH et al (2015) Induced sorting suffixes in external memory with better design and less space. In: Iliopoulos CS, Puglisi SJ, Yilmaz E (eds) International Symposium on String Processing and Information Retrieval. Springer, pp 83\u201394","DOI":"10.1007\/978-3-319-23826-5_9"},{"issue":"1","key":"4165_CR24","doi-asserted-by":"publisher","first-page":"2.3:1","DOI":"10.1145\/2975593","volume":"21","author":"T Bingmann","year":"2016","unstructured":"Bingmann T, Fischer J, Osipov V (2016) Inducing suffix and LCP arrays in external memory. ACM J Exp Algorithmics 21(1):2.3:1-2.3:27. https:\/\/doi.org\/10.1145\/2975593","journal-title":"ACM J Exp Algorithmics"},{"key":"4165_CR25","doi-asserted-by":"crossref","unstructured":"Kempa D, Puglisi S J (2013) Lempel-Ziv factorization: simple, fast, practical. In: Sanders\u00a0P, Zeh\u00a0N (eds) Proceedings of the 15th Meeting on Algorithm Engineering and Experiments. SIAM, pp 103\u2013112","DOI":"10.1137\/1.9781611972931.9"},{"key":"4165_CR26","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J, Kempa D, Puglisi SJ (2013) Lightweight Lempel-Ziv parsing. In: Bonifaci V, Demetrescu C, Marchetti-Spaccamela A (eds) International Symposium on Experimental Algorithms. Springer, pp 139\u2013150","DOI":"10.1007\/978-3-642-38527-8_14"},{"issue":"7","key":"4165_CR27","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1007\/s11227-018-2395-5","volume":"74","author":"B Lao","year":"2018","unstructured":"Lao B, Nong G, Chan WH et al (2018) Fast induced sorting suffixes on a multicore machine. J SuperComput 74(7):3468\u20133485. https:\/\/doi.org\/10.1007\/s11227-018-2395-5","journal-title":"J SuperComput"},{"issue":"10","key":"4165_CR28","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TC.2017.2702642","volume":"66","author":"Y Wu","year":"2017","unstructured":"Wu Y, Nong G, Chan WH, Han LB (2017) Checking big suffix and LCP arrays by probabilistic methods. IEEE Trans Computers 66(10):1667\u20131675. https:\/\/doi.org\/10.1109\/TC.2017.2702642","journal-title":"IEEE Trans Computers"},{"key":"4165_CR29","doi-asserted-by":"publisher","unstructured":"Lao B, Nong G, Chan W H (2021) Building and checking suffix array simultaneously by induced sorting method. IEEE Trans Computers. doi: https:\/\/doi.org\/10.1109\/TC.2021.3061709","DOI":"10.1109\/TC.2021.3061709"},{"issue":"2","key":"4165_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp RM, Rabin MO (1987) Efficient randomized pattern-matching algorithms. IBMJ Res Dev 31(2):249\u2013260. https:\/\/doi.org\/10.1147\/rd.312.0249","journal-title":"IBMJ Res Dev"},{"key":"4165_CR31","unstructured":"Uzgalis R (1996) Hashing concepts and the java programming language. Technical Report, University of Auckland, New Zealand"},{"key":"4165_CR32","doi-asserted-by":"crossref","unstructured":"Shun J, Blelloch G E, Fineman J T, et al (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"},{"key":"4165_CR33","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J, Sanders P (2003) Simple linear work suffix array construction. In: Proceedings of the 30th International Conference on Automata, Languages and Programming. Springer, pp 943\u2013955","DOI":"10.1007\/3-540-45061-0_73"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04165-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04165-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04165-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T16:37:24Z","timestamp":1647621444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04165-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["4165"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04165-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"15 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}