{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:22:04Z","timestamp":1740547324096,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_36","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"415-426","source":"Crossref","is-referenced-by-count":2,"title":["A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings"],"prefix":"10.1007","author":[{"given":"Kuan-Yu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Park, J.K.: Notes on Searching in Multidimensional Monotone Arrays. In: FOCS 1998, pp. 497\u2013512 (1998)","DOI":"10.1109\/SFCS.1988.21966"},{"issue":"1","key":"36_CR2","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. Journal of Complexity\u00a015(1), 4\u201316 (1999)","journal-title":"Journal of Complexity"},{"issue":"6","key":"36_CR3","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.B.: Edit Distance of Run-Length Encoded Strings. Information Processing Letters\u00a083(6), 307\u2013314 (2002)","journal-title":"Information Processing Letters"},{"issue":"2","key":"36_CR4","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, J.: An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Information Processing Letters\u00a054(2), 93\u201396 (1995)","journal-title":"Information Processing Letters"},{"key":"#cr-split#-36_CR5.1","unstructured":"Chen, K.-Y., Hsu, P.-H., Chao, K.-M.: Approximate Matching for Run-Length Encoded Strings Is 3SUM-Hard. Journal of Complexity (accepted);"},{"key":"#cr-split#-36_CR5.2","unstructured":"A preliminary version appeared in CPM 2009 (2009)"},{"issue":"6","key":"36_CR6","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 Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM Journal on Computing\u00a032(6), 1654\u20131673 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(86)90028-1","volume":"22","author":"H. Gajewska","year":"1986","unstructured":"Gajewska, H., Tarjan, R.E.: Deques with Heap Order. Information Processing Letters\u00a022(4), 197\u2013200 (1986)","journal-title":"Information Processing Letters"},{"key":"36_CR8","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)"},{"issue":"6","key":"36_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A Linear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Communications of the ACM"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-69733-6_32","volume-title":"Computing and Combinatorics","author":"G.-S. Huang","year":"2008","unstructured":"Huang, G.-S., Liu, J.J., Wang, Y.-L.: Sequence Alignment Algorithms for Run-Length-Encoded Strings. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 319\u2013330. Springer, Heidelberg (2008)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ipl.2007.07.006","volume":"105","author":"J.J. Liu","year":"2007","unstructured":"Liu, J.J., Huang, G.-S., Wang, Y.-L., Lee, R.C.-T.: Edit Distance for a Run-Length-Encoded String and an Uncompressed String. Information Processing Letters\u00a0105(1), 12\u201316 (2007)","journal-title":"Information Processing Letters"},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A Faster Algorithm Computing String Edit Distances. Journal of Computer and System Sciences\u00a020(1), 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"36_CR13","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., Ukkonen, E., Navarro, G.: Approximate Matching of Run-Length Compressed Strings. Algorithmica\u00a035(4), 347\u2013369 (2003)","journal-title":"Algorithmica"},{"key":"36_CR14","unstructured":"Mitchell, J.S.B.: A Geometric Shortest Path Problem, with Application to Computing a Longest Common Subsequence in Run-Length Encoded Strings. Technical Report, SUNY Stony Brook (1997)"},{"issue":"4","key":"36_CR15","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. SIAM Journal on Computing\u00a027(4), 972\u2013992 (1998)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:51:38Z","timestamp":1740480698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}