{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:40:02Z","timestamp":1748608802430,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23826-5_23","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"234-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Construction of Succinct Representations of Suffix Tree Topologies"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Baier","sequence":"first","affiliation":[]},{"given":"Timo","family":"Beller","sequence":"additional","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms 14(3), 344\u2013370 (1993)","journal-title":"Journal of Algorithms"},{"issue":"8","key":"23_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/2517327.2442536","volume":"48","author":"M Deo","year":"2013","unstructured":"Deo, M., Keely, S.: Parallel suffix array and least common prefix for the GPU. ACM SIGPLAN Notices 48(8), 197\u2013206 (2013)","journal-title":"ACM SIGPLAN Notices"},{"issue":"22","key":"23_CR3","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1016\/j.tcs.2011.01.036","volume":"412","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Combined data structure for previous- and next-smaller-values. Theoretical Computer Science 412(22), 2451\u20132456 (2011)","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","unstructured":"Gog, S.: Compressed Suffix Trees: Design, Construction, and Applications. PhD thesis, University of Ulm, Germany (2011)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45452-7_13","volume-title":"Combinatorial Pattern Matching","author":"W-K Hon","year":"2002","unstructured":"Hon, W.-K., Sadakane, K.: Space-Economical algorithms for finding maximal unique matches. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 144\u2013152. Springer, Heidelberg (2002)"},{"key":"23_CR6","unstructured":"Jaja, J.: Introduction to Parallel Algorithms. Addison-Wesley Professional (1992)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02441-2_17","volume-title":"Combinatorial Pattern Matching","author":"J K\u00e4rkk\u00e4inen","year":"2009","unstructured":"K\u00e4rkk\u00e4inen, J., Manzini, G., Puglisi, S.J.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jda.2011.01.002","volume":"11","author":"M L\u00e9onard","year":"2012","unstructured":"L\u00e9onard, M., Mouchard, L., Salson, M.: On the number of elements to reorder when updating a suffix array. Journal of Discrete Algorithms 11, 87\u201399 (2012)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing 31(3), 762\u2013776 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), Article 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"23_CR11","unstructured":"Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag (2013)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-16321-0_34","volume-title":"String Processing and Information Retrieval","author":"E Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Fischer, J., Gog, S.: CST++. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 322\u2013333. Springer, Heidelberg (2010)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-03784-9_6","volume-title":"String Processing and Information Retrieval","author":"E Ohlebusch","year":"2009","unstructured":"Ohlebusch, E., Gog, S.: A compressed enhanced suffix array supporting fast string matching. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 51\u201362. Springer, Heidelberg (2009)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2), Article 4 (2007)","DOI":"10.1145\/1242471.1242472"},{"key":"23_CR15","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 225\u2013232 (2002)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41, 589\u2013607 (2007)","journal-title":"Theory of Computing Systems"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Shun, J.: Fast parallel computation of longest common prefixes. In: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 387\u2013398. IEEE Press (2014)","DOI":"10.1109\/SC.2014.37"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: A simple parallel Cartesian tree algorithm and its application to suffix tree construction. ACM Transactions on Parallel Computing 1(1), Article 8 (2014)","DOI":"10.1145\/2661653"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Shun, J., Zhao, F.: Practical parallel Lempel-Ziv factorization. In: Proc. 23th Data Compression Conference, pp. 123\u2013132. IEEE Computer Society (2013)","DOI":"10.1109\/DCC.2013.20"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:13:21Z","timestamp":1748607201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}