{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:16Z","timestamp":1760202676540},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_29","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"338-350","source":"Crossref","is-referenced-by-count":14,"title":["Improved ESP-index: A Practical Self-index for Highly Repetitive Texts"],"prefix":"10.1007","author":[{"given":"Yoshimasa","family":"Takabatake","sequence":"first","affiliation":[]},{"given":"Yasuo","family":"Tabei","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2013.10.019","volume":"513","author":"J. Barbay","year":"2013","unstructured":"Barbay, J., Navarro, G.: On compressing permutations and adaptive sorting. Theor. Comp. Sci.\u00a0513, 109\u2013123 (2013)","journal-title":"Theor. Comp. Sci."},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FI-2011-565","volume":"111","author":"F. Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundam. Inform.\u00a0111, 313\u2013337 (2010)","journal-title":"Fundam. Inform."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-34109-0_19","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2012","unstructured":"Claude, F., Navarro, G.: Improved grammar-based compressed indexes. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 180\u2013192. Springer, Heidelberg (2012)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. TALG\u00a03, 2:1\u20132:19 (2007)","DOI":"10.1145\/1219944.1219947"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11764298_12","volume-title":"Experimental Algorithms","author":"O. Delpratt","year":"2006","unstructured":"Delpratt, O., Rahman, N., Raman, R.: Engineering the louds succinct tree representation. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 134\u2013145. Springer, Heidelberg (2006)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T. Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 240\u2013251. Springer, Heidelberg (2012)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-642-54423-1_63","volume-title":"LATIN 2014: Theoretical Informatics","author":"T. Gagie","year":"2014","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol.\u00a08392, pp. 731\u2013742. Springer, Heidelberg (2014)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"29_CR9","first-page":"89","volume":"18","author":"K. Goto","year":"2013","unstructured":"Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram mining on SLP compressed strings. JDA\u00a018, 89\u201399 (2013)","journal-title":"JDA"},{"key":"29_CR10","unstructured":"Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: STACS, pp. 529\u2013540 (2009)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. In: DCC, pp. 296\u2013305 (1999)","DOI":"10.1109\/DCC.1999.755679"},{"key":"29_CR13","first-page":"100","volume":"18","author":"S. Maruyama","year":"2013","unstructured":"Maruyama, S., Nakahara, M., Kishiue, N., Sakamoto, H.: ESP-Index: A compressed index based on edit-sensitive parsing. JDA\u00a018, 100\u2013112 (2013)","journal-title":"JDA"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-45061-0_29","volume-title":"Automata, Languages and Programming","author":"J.I. Munro","year":"2003","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 345\u2013356. Springer, Heidelberg (2003)"},{"key":"29_CR15","first-page":"87","volume":"2","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the ziv-lempel trie. JDA\u00a02, 87\u2013114 (2004)","journal-title":"JDA"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. TALG\u00a03 (2007)","DOI":"10.1145\/1290672.1290680"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Sakamoto, H., Maruyama, S., Kida, T., Shimozono, S.: A space-saving approximation algorithm for grammar-based compression. IEICE Trans. Inf. Syst. E92-D, 158\u2013165 (2009)","DOI":"10.1587\/transinf.E92.D.158"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-21458-5_27","volume-title":"Combinatorial Pattern Matching","author":"T. Yamamoto","year":"2011","unstructured":"Yamamoto, T., Bannai, H., Inenaga, S., Takeda, M.: Faster subsequence and don\u2019t-care pattern matching on compressed texts. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 309\u2013322. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T20:45:25Z","timestamp":1597956325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}