{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:20Z","timestamp":1725846800265},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"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-662-49192-8_25","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"302-313","source":"Crossref","is-referenced-by-count":1,"title":["Compacting a Dynamic Edit Distance Table by RLE Compression"],"prefix":"10.1007","author":[{"given":"Heikki","family":"Hyyr\u00f6","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0020-0190(02)00215-6","volume":"83","author":"O Arbell","year":"2002","unstructured":"Arbell, O., Landau, G.M., Mitchell, J.S.: Edit distance of run-length encoded strings. Inf. Process. Lett. 83(6), 307\u2013314 (2002)","journal-title":"Inf. Process. Lett."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-319-15579-1_6","volume-title":"Language and Automata Theory and Applications","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Average-case optimal approximate circular string matching. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 85\u201396. Springer, Heidelberg (2015)"},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1142\/S0129054110007647","volume":"21","author":"P Hsu","year":"2010","unstructured":"Hsu, P., Chen, K., Chao, K.: Finding all approximate gapped palindromes. Int. J. Found. Comput. Sci. 21(6), 925\u2013939 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2015.05.007","volume":"34","author":"H Hyyr\u00f6","year":"2015","unstructured":"Hyyr\u00f6, H., Narisawa, K., Inenaga, S.: Dynamic edit distance table under a general weighted cost function. J. Disc. Algorithms 34, 2\u201317 (2015)","journal-title":"J. Disc. Algorithms"},{"key":"25_CR5","first-page":"302","volume":"2","author":"SR Kim","year":"2004","unstructured":"Kim, S.R., Park, K.: A dynamic edit distance table. J. Disc. Algorithms 2, 302\u2013312 (2004)","journal-title":"J. Disc. Algorithms"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"GM Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comp. 27(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"JP Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application in finding all approximate repeats in strings. SIAM J. Comp. 27(4), 972\u2013992 (1998)","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:07:35Z","timestamp":1559365655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}