{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:54:12Z","timestamp":1742388852226},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_21","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T05:19:57Z","timestamp":1277183997000},"page":"227-237","source":"Crossref","is-referenced-by-count":28,"title":["Sampled Longest Common Prefix Array"],"prefix":"10.1007","author":[{"given":"Jouni","family":"Sir\u00e9n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal on Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"Journal on Discrete Algorithms"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: Directly addressable variable-length codes. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 122\u2013130. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03784-9_12"},{"key":"21_CR3","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"C\u00e1novas, R., Navarro, G.: Practical compressed suffix trees. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 94\u2013105. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13193-6_9"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory\u00a021(2), 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Fayolle, J., Ward, M.D.: Analysis of the average depth in a suffix tree under a Markov model. In: Proc. 2005 International Conference on Analysis of Algorithms, DMTCS Proceedings, vol.\u00a0AD, pp. 95\u2013104. DMTCS (2005)","DOI":"10.46298\/dmtcs.3371"},{"key":"21_CR7","first-page":"1","volume":"13","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. Journal of Experimental Algorithms\u00a013, 1.12 (2009)","journal-title":"Journal of Experimental Algorithms"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"Journal of the ACM"},{"key":"21_CR9","first-page":"690","volume-title":"SODA 2007","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. In: SODA 2007, pp. 690\u2013696. SIAM, Philadelphia (2007)"},{"key":"21_CR10","unstructured":"Fischer, J.: Wee LCP. arXiv:0910.3123v1 [cs.DS] (2009)"},{"issue":"51","key":"21_CR11","doi-asserted-by":"publisher","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","volume":"410","author":"J. Fischer","year":"2009","unstructured":"Fischer, J., M\u00e4kinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theoretical Computer Science\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R. Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing\u00a035(2), 378\u2013407 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"21_CR13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.tcs.2007.07.042","volume":"387","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed data structures: dictionaries and data-aware measures. Theoretical Computer Science\u00a0387(3), 313\u2013331 (2007)","journal-title":"Theoretical Computer Science"},{"key":"21_CR14","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.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"21_CR16","unstructured":"Khmelev, D.: Program lcp version 0.1.9 (2004), http:\/\/www.math.toronto.edu\/dkhmelev\/PROGS\/misc\/lcp-eng.html"},{"issue":"13","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirement of suffix trees. Software: Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software: Practice and Experience"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-02008-7_9","volume-title":"Research in Computational Molecular Biology","author":"V. M\u00e4kinen","year":"2009","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of individual genomes. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 121\u2013137. Springer, Heidelberg (2009)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G. Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1), 2 (2007)","journal-title":"ACM Computing Surveys"},{"key":"21_CR20","first-page":"233","volume-title":"SODA 2002","author":"R. Raman","year":"2002","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA 2002, pp. 233\u2013242. SIAM, Philadelphia (2002)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-78773-0_32","volume-title":"LATIN 2008: Theoretical Informatics","author":"L. Russo","year":"2008","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 362\u2013373. Springer, Heidelberg (2008)"},{"issue":"4","key":"21_CR22","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\u00a041(4), 589\u2013607 (2007)","journal-title":"Theory of Computing Systems"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Sir\u00e9n, J.: Compressed suffix arrays for massive data. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 63\u201374. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03784-9_7"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Sir\u00e9n, J.: Sampled longest common prefix array. arXiv:1001.2101v2 [cs.DS] (2010)","DOI":"10.1007\/978-3-642-13509-5_21"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T18:58:56Z","timestamp":1635533936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}