{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:38Z","timestamp":1726409678092},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460482"},{"type":"electronic","value":"9783319460499"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46049-9_15","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T15:02:06Z","timestamp":1474383726000},"page":"153-159","source":"Crossref","is-referenced-by-count":0,"title":["Bookmarks in Grammar-Compressed Strings"],"prefix":"10.1007","author":[{"given":"Patrick Hagge","family":"Cording","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-662-48350-3_13","volume-title":"Algorithms - ESA 2015","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cording, P.H., Puglisi, S.J., Tabei, Y.: Access, rank, and select in grammar-compressed strings. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 142\u2013154. Springer, Heidelberg (2015)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Ord\u00f3nez, A., Puglisi, S.J., Tabei, Y.: Queries on LZ-bounded encodings. In: DCC, pp. 83\u201392 (2014)","DOI":"10.1109\/DCC.2015.69"},{"key":"15_CR3","unstructured":"Bille, P., Christiansen, A.R., Cording, P.H., G\u00f8rtz, I.L.: Finger search in grammar-compressed strings (2015). CoRR arXiv:1507.02853"},{"issue":"3","key":"15_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"15_CR5","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theor. 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 8392, pp. 731\u2013742. Springer, Heidelberg (2014)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-642-34109-0_24","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2012","unstructured":"Gawrychowski, P.: Faster algorithm for computing the edit distance between SLP-compressed strings. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 229\u2013236. Springer, Heidelberg (2012)"},{"issue":"4271","key":"15_CR8","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1126\/science.194.4271.1235","volume":"194","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: Mathematics and computer science: coping with finiteness. Science (New York, NY) 194(4271), 1235\u20131242 (1976)","journal-title":"Science (New York, NY)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. In: DCC, vol. 88, no. 11, pp. 1722\u20131732 (2000)","DOI":"10.1109\/5.892708"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-63220-4_45","volume-title":"Combinatorial Pattern Matching","author":"M Miyazaki","year":"1997","unstructured":"Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Apostolico, A., Hein, J. (eds.) CPM 97. LNCS, vol. 1264, pp. 1\u201311. Springer, Heidelberg (1997)"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"CG Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artif. Intell. Res. (JAIR) 7, 67\u201382 (1997)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"1","key":"15_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"17","key":"15_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"6","author":"TA Welch","year":"1984","unstructured":"Welch, T.A.: A technique for high-performance data compression. Computer 6(17), 8\u201319 (1984)","journal-title":"Computer"},{"issue":"3","key":"15_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"15_CR15","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46049-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T20:14:07Z","timestamp":1568405647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46049-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460482","9783319460499"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46049-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}