{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:56Z","timestamp":1725533516328},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_15","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"168-179","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard"],"prefix":"10.1007","author":[{"given":"Kuan-Yu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ping-Hui","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized String Matching. SIAM Journal on Computing\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G.: Efficient Two-Dimensional Compressed Matching. In: DCC, pp. 279\u2013288 (1992)","DOI":"10.1109\/DCC.1992.227453"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A. Amir","year":"2004","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster Algorithms for String Matching with k Mismatches. Journal of Algorithms\u00a050(2), 257\u2013275 (2004)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1016\/S0304-3975(02)00041-5","volume":"290","author":"A. Amir","year":"2003","unstructured":"Amir, A., Landau, G.M., Sokol, D.: Inplace Run-Length 2d Compressed Search. Theoretical Computer Science\u00a0290(3), 1361\u20131383 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"15_CR5","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":"15_CR6","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":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00453-007-9036-3","volume":"50","author":"I. Baran","year":"2008","unstructured":"Baran, I., Demaine, E.D., Patrascu, M.: Subquadratic Algorithms for 3SUM. Algorithmica\u00a050(4), 584\u2013596 (2008)","journal-title":"Algorithmica"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1142\/S0218195901000596","volume":"11","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3sum-Hard. International Journal of Computational Geometry and Applications\u00a011(4), 465\u2013474 (2001)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"12","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/83.974563","volume":"10","author":"W. Berghorn","year":"2001","unstructured":"Berghorn, W., Boskamp, T., Lang, M., Peitgen, H.-O.: Fast Variable Run-Length Coding for Embedded Progressive Wavelet-Based Image Compression. IEEE Transactions on Image Processing\u00a010(12), 1781\u20131790 (2001)","journal-title":"IEEE Transactions on Image Processing"},{"issue":"2","key":"15_CR10","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"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ipl.2006.08.002","volume":"101","author":"P. Clifford","year":"2007","unstructured":"Clifford, P., Clifford, R.: Simple Deterministic Wildcard Matching. Information Processing Letters\u00a0101(2), 53\u201354 (2007)","journal-title":"Information Processing Letters"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: From Coding Theory to Efficient Pattern Matching. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.85"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying Candidate Matches in Sparse and Wildcard Matching. In: STOC, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"issue":"6","key":"15_CR14","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"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a Class of O(n\n                2) Problems in Computational Geometry. Computational Geometry\u00a05, 165\u2013185 (1995)","journal-title":"Computational Geometry"},{"key":"15_CR16","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":"2\u20133","key":"15_CR17","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.tcs.2008.01.008","volume":"395","author":"J.W. Kim","year":"2008","unstructured":"Kim, J.W., Amir, A., Landau, G.M., Park, K.: Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. Theoretical Computer Science\u00a0395(2\u20133), 268\u2013282 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern Matching in Strings. SIAM Journal on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR19","unstructured":"Kosaraju, S.R.: Efficient String Matching (manuscript, 1987)"},{"issue":"1","key":"15_CR20","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":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.jco.2007.06.003","volume":"24","author":"J.J. Liu","year":"2008","unstructured":"Liu, J.J., Wang, Y.-L., Lee, R.C.T.: Finding a Longest Common Subsequence between a Run-Length-Encoded String and an Uncompressed String. Journal of Complexity\u00a024(2), 173\u2013184 (2008)","journal-title":"Journal of Complexity"},{"issue":"4","key":"15_CR22","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":"15_CR23","volume-title":"FAX: Digital Facsimile Technology and Applications","author":"D. Bodson","year":"1989","unstructured":"Bodson, D., McConnell, K.R., Schaphorst, R.: FAX: Digital Facsimile Technology and Applications. Artech House, Norwood (1989)"},{"key":"15_CR24","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)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T15:58:56Z","timestamp":1552060736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}