{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:44Z","timestamp":1725795944457},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_24","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T23:50:31Z","timestamp":1402530631000},"page":"232-241","source":"Crossref","is-referenced-by-count":3,"title":["String Range Matching"],"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":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California (1994)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(92)90134-2","volume":"92","author":"M. Crochemore","year":"1992","unstructured":"Crochemore, M.: String-matching on ordered alphabets. Theor. Comp. Sci.\u00a092, 33\u201347 (1992)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., Perrin, D.: Two-way string matching. J. ACM\u00a038(3), 651\u2013675 (1991)","journal-title":"J. ACM"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica\u00a013(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S. Faro","year":"2013","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: A review of the most recent results. ACM Comp. Surv.\u00a045(2), 13 (2013)","journal-title":"ACM Comp. Surv."},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P. Ferragina","year":"2012","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica\u00a063(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc.\u00a016(1), 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1137\/0209032","volume":"9","author":"Z. Galil","year":"1980","unstructured":"Galil, Z., Seiferas, J.: Saving space in fast string-matching. SIAM J. Comp.\u00a09(2), 417\u2013438 (1980)","journal-title":"SIAM J. Comp."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.: Time-space optimal string matching. J. Comp. Sys. Sci.\u00a026, 280\u2013294 (1983)","journal-title":"J. Comp. Sys. Sci."},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2007.07.018","volume":"387","author":"J. K\u00e4rkk\u00e4inen","year":"2007","unstructured":"K\u00e4rkk\u00e4inen, J.: Fast BWT in small space by blockwise suffix sorting. Theor. Comp. Sci.\u00a0387(3), 249\u2013257 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"24_CR11","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Crochemore\u2019s string matching algorithm: Simplification, extensions, applications. In: Proc. PSC 2013, pp. 168\u2013175. Czech Technical University (2013)"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J.H., Pratt, V.: Fast pattern matching in strings. SIAM J. Comp.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comp."},{"issue":"5","key":"24_CR13","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.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:07:03Z","timestamp":1558908423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}