{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:00:23Z","timestamp":1770490823284,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319199283","type":"print"},{"value":"9783319199290","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_27","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T09:09:49Z","timestamp":1434359389000},"page":"316-328","source":"Crossref","is-referenced-by-count":1,"title":["Tighter Bounds for the Sum of Irreducible LCP Values"],"prefix":"10.1007","author":[{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Kempa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"27_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation, Palo Alto, California (1994)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.tcs.2012.07.019","volume":"457","author":"PM Higgins","year":"2012","unstructured":"Higgins, P.M.: Burrows-Wheeler transformations and de Bruijn words. Theor. Comput. Sci. 457, 128\u2013136 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/978-3-319-07959-2_35","volume-title":"Experimental Algorithms","author":"J K\u00e4rkk\u00e4inen","year":"2014","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D.: LCP array construction in external memory. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 412\u2013423. Springer, Heidelberg (2014)"},{"key":"27_CR6","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)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comp. Biol. 17(3), 281\u2013308 (2010)","journal-title":"J. Comp. Biol."},{"issue":"5","key":"27_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comp. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comp."},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler transform. Theor. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Algorithm Theory - SWAT 2004","author":"G Manzini","year":"2004","unstructured":"Manzini, G.: Two space saving tricks for linear time LCP array computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 372\u2013383. Springer, Heidelberg (2004)"},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1), 1\u201361 (2007)","journal-title":"ACM Comput. Surv."},{"key":"27_CR12","unstructured":"Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag, Bremen, Germany (2013)"},{"key":"27_CR13","unstructured":"Ruskey, F.: Combinatorial generation, working version (1j-CSC 425\/520) (2003)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-13509-5_21","volume-title":"Combinatorial Pattern Matching","author":"J Sir\u00e9n","year":"2010","unstructured":"Sir\u00e9n, J.: Sampled longest common prefix array. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 227\u2013237. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T01:44:22Z","timestamp":1559180662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}