{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:54:42Z","timestamp":1743101682612,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_375","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"843-846","source":"Crossref","is-referenced-by-count":1,"title":["Similarity between Compressed Strings"],"prefix":"10.1007","author":[{"given":"Jin Wook","family":"Kim","sequence":"first","affiliation":[]},{"given":"Amihood","family":"Amir","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"375_CR1_375","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jcom.1998.0493","volume":"15","author":"A. Apostolico","year":"1999","unstructured":"Apostolico, A., Landau, G.M., Skiena, S.: Matching for Run Length Encoded Strings. J.\u00a0Complex. 15(1), 4\u201316 (1999)","journal-title":"J. Complex."},{"issue":"6","key":"375_CR2_375","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.: Edit Distance of Run-Length Encoded Strings. Inf. Proc. Lett. 83(6), 307\u2013314 (2002)","journal-title":"Inf. Proc. Lett."},{"issue":"1","key":"375_CR3_375","first-page":"21","volume":"1","author":"R. Baeza-Yates","year":"2000","unstructured":"Baeza-Yates, R., Navaro, G.: New Models and Algorithms for Multidimensional Approximate Pattern Matching. J.\u00a0Discret. Algorithms 1(1), 21\u201349 (2000)","journal-title":"J. Discret. Algorithms"},{"key":"375_CR4_375","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(95)00005-W","volume":"54","author":"H. Bunke","year":"1995","unstructured":"Bunke, H., Csirik, H.: An Improved Algorithm for Computing the Edit Distance of Run Length Coded Strings. Inf. Proc. Lett. 54, 93\u201396 (1995)","journal-title":"Inf. Proc. Lett."},{"key":"375_CR5_375","first-page":"19","volume-title":"String Algorithmics","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit. In: Iliopoulos, C.S., Lecroq, T. (eds.) String Algorithmics, pp.\u00a019\u201359. King's College London Publications, London (2005)"},{"issue":"6","key":"375_CR6_375","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1137\/S0097539702402007","volume":"32","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A\u00a0Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM J.\u00a0Comput. 32(6), 1654\u20131673 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"375_CR7_375","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2005.06.029","volume":"347","author":"K. Fredriksson","year":"2005","unstructured":"Fredriksson, K., Navarro, G., Ukkonen, E.: Sequential and Indexed Two-Dimensional Combinatorial Template Matching Allowing Rotations. Theor. Comput. Sci. 347(1\u20132), 239\u2013275 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"375_CR8_375","unstructured":"Kim, J.W., Amir, A., Landau, G.M., Park, K.: Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. In: Proc. 12th Symposium on String Processing and Information Retrieval (SPIRE'05). LNCS, vol.\u00a03772, pp. 440\u2013449 (2005)"},{"key":"375_CR9_375","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0255(87)90037-5","volume":"43","author":"K. Krithivasan","year":"1987","unstructured":"Krithivasan, K., Sitalakshmi, R.: Efficient Two-Dimensional Pattern Matching in The Presence of Errors. Inf. Sci. 43, 169\u2013184 (1987)","journal-title":"Inf. Sci."},{"key":"375_CR10_375","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Approximate Matching of Run-Length Compressed Strings. In: Proc. 12th Symposium on Combinatorial Pattern Matching (CPM'01). LNCS, vol.\u00a02089, pp.\u00a031\u201349 (2001)","DOI":"10.1007\/3-540-48194-X_3"},{"key":"375_CR11_375","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00453-002-1005-2","volume":"35","author":"V. M\u00e4kinen","year":"2003","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Approximate Matching of Run-Length Compressed Strings. Algorithmica 35, 347\u2013369 (2003)","journal-title":"Algorithmica"},{"key":"375_CR12_375","unstructured":"Mitchell, J.: A\u00a0Geometric Shortest Path Problem, with Application to Computing a\u00a0Longest Common Subsequence in Run-Length Encoded Strings. Technical Report, Dept. of Applied Mathematics, SUNY Stony Brook (1997)"},{"issue":"1","key":"375_CR13_375","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The String-to-String correction Problem. J.\u00a0ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"5","key":"375_CR14_375","doi-asserted-by":"publisher","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. Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:51:02Z","timestamp":1662169862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_375"}},"subtitle":["2005;\nKim, Amir, Landau, Park"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_375","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}