{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:42:23Z","timestamp":1742928143247,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304415"},{"type":"electronic","value":"9783031304422"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30442-2_6","type":"book-chapter","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T10:02:09Z","timestamp":1682589729000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Suffix Sorting for\u00a0Large String Analytics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8435-1611","authenticated-orcid":false,"given":"Zhihui","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0173-5362","authenticated-orcid":false,"given":"Sen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7380-5876","authenticated-orcid":false,"given":"David A.","family":"Bader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44888-8_5","volume-title":"Combinatorial Pattern Matching","author":"S Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 55\u201369. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44888-8_5"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Deo, M., Keely, S.: Parallel suffix array and least common prefix for the GPU. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 197\u2013206 (2013). https:\/\/doi.org\/10.1145\/2442516.2442536","DOI":"10.1145\/2442516.2442536"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Flick, P., Aluru, S.: Parallel distributed memory construction of suffix and longest common prefix arrays. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310 (2015)","DOI":"10.1145\/2807591.2807609"},{"key":"6_CR4","unstructured":"Futamura, N., Aluru, S., Kurtz, S.: Parallel suffix sorting. Electrical Engineering and Computer Science - All Scholarship 64 (2001). https:\/\/surface.syr.edu\/eecs\/64"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Helman, D.R., J\u00e1J\u00e1, J., Bader, D.A.: A new deterministic parallel sorting algorithm with an experimental evaluation. J. Exp. Algorithmics (JEA) 3, 4-es (1998). https:\/\/doi.org\/10.1145\/297096.297128","DOI":"10.1145\/297096.297128"},{"issue":"8","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1093\/bioinformatics\/btp112","volume":"25","author":"R Homann","year":"2009","unstructured":"Homann, R., Fleer, D., Giegerich, R., Rehmsmeier, M.: mkESA: enhanced suffix array construction tool. Bioinformatics 25(8), 1084\u20131085 (2009). https:\/\/doi.org\/10.1093\/bioinformatics\/btp112","journal-title":"Bioinformatics"},{"key":"6_CR7","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms, vol. 10, p. 133889. Addison-Wesley, Reading (1992)"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2007.07.018","volume":"387","author":"J K\u00e4rkk\u00e4inen","year":"2007","unstructured":"K\u00e4rkk\u00e4inen, J.: Fast BWT in small space by blockwise suffix sorting. Theoret. Comput. Sci. 387(3), 249\u2013257 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.018","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943\u2013955. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_73"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM (JACM) 53(6), 918\u2013936 (2006). https:\/\/doi.org\/10.1145\/1217856.1217858","journal-title":"J. ACM (JACM)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"DK Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186\u2013199. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44888-8_14"},{"issue":"2\u20134","key":"6_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discret. Algorithms 3(2\u20134), 143\u2013156 (2005). https:\/\/doi.org\/10.1016\/j.jda.2004.08.002","journal-title":"J. Discret. Algorithms"},{"issue":"9","key":"6_CR13","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.parco.2007.06.004","volume":"33","author":"F Kulla","year":"2007","unstructured":"Kulla, F., Sanders, P.: Scalable parallel suffix array construction. Parallel Comput. 33(9), 605\u2013612 (2007)","journal-title":"Parallel Comput."},{"issue":"7","key":"6_CR14","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, W.H., Pan, Y.: Fast induced sorting suffixes on a multicore machine. J. Supercomput. 74(7), 3468\u20133485 (2018). https:\/\/doi.org\/10.1007\/s11227-018-2395-5","journal-title":"J. Supercomput."},{"issue":"12","key":"6_CR15","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, W.H., Xie, J.Y.: Fast in-place suffix sorting on a multicore computer. IEEE Trans. Comput. 67(12), 1737\u20131749 (2018). https:\/\/doi.org\/10.1109\/TC.2018.2842050","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2007.07.017","volume":"387","author":"NJ Larsson","year":"2007","unstructured":"Larsson, N.J., Sadakane, K.: Faster suffix sorting. Theoret. Comput. Sci. 387(3), 258\u2013272 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.017","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104818","volume":"285","author":"Z Li","year":"2022","unstructured":"Li, Z., Li, J., Huo, H.: Optimal in-place suffix sorting. Inf. Comput. 285, 104818 (2022)","journal-title":"Inf. Comput."},{"issue":"5","key":"6_CR18","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993). https:\/\/doi.org\/10.1137\/0222058","journal-title":"SIAM J. Comput."},{"key":"6_CR19","unstructured":"Maniscalco, M.A., Puglisi, S.J.: Faster lightweight suffix array construction. In: Proceedings of International Workshop on Combinatorial Algorithms (IWOCA), pp. 16\u201329 (2006)"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40(1), 33\u201350 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1094-1","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM (JACM) 23(2), 262\u2013272 (1976). https:\/\/doi.org\/10.1145\/321941.321946","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2493175.2493180","volume":"31","author":"G Nong","year":"2013","unstructured":"Nong, G.: Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACM Trans. Inf. Syst. (TOIS) 31(3), 1\u201315 (2013). https:\/\/doi.org\/10.1145\/2493175.2493180","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-34109-0_40","volume-title":"String Processing and Information Retrieval","author":"V Osipov","year":"2012","unstructured":"Osipov, V.: Parallel suffix array construction for shared memory architectures. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 379\u2013384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34109-0_40"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. (CSUR) 39(2), 4-es (2007). https:\/\/doi.org\/10.1145\/1242471.1242472","DOI":"10.1145\/1242471.1242472"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Shun, J.: Fast parallel computation of longest common prefixes. In: SC 2014: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 387\u2013398. IEEE (2014). https:\/\/doi.org\/10.1109\/SC.2014.37","DOI":"10.1109\/SC.2014.37"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Shun, J., et al.: Brief announcement: the problem based benchmark suite. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 68\u201370 (2012). https:\/\/doi.org\/10.1145\/2312005.2312018","DOI":"10.1145\/2312005.2312018"},{"issue":"12","key":"6_CR27","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, J.D.: Fast parallel skew and prefix-doubling suffix array construction on the GPU. Concurr. Comput. Pract. Exp. 28(12), 3466\u20133484 (2016). https:\/\/doi.org\/10.1002\/cpe.3867","journal-title":"Concurr. Comput. Pract. Exp."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30442-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T10:03:07Z","timestamp":1682589787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30442-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304415","9783031304422"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30442-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gdansk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"132","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}