{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:18:48Z","timestamp":1737436728304,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_5","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"40-51","source":"Crossref","is-referenced-by-count":0,"title":["A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings"],"prefix":"10.1007","author":[{"given":"Abdullah N.","family":"Arslan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-68535-9_36","volume-title":"Computing and Combinatorics","author":"R.A. Baeza-Yates","year":"1998","unstructured":"Baeza-Yates, R.A.: Similarity in two dimensional strings. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol.\u00a01449, pp. 319\u2013328. Springer, Heidelberg (1998)"},{"issue":"12","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1016\/0031-3203(93)90177-X","volume":"26","author":"H. Bunke","year":"1993","unstructured":"Bunke, H., Buhler, U.: Applications of approximate string matching to 2d shape recognition. Pattern Recognition\u00a026(12), 1797\u20131812 (1993)","journal-title":"Pattern Recognition"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bengroth, L., Hakkonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proc. SPIRE, pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. J. SIAM Comp.\u00a04(4), 507\u2013512 (1975)","journal-title":"J. SIAM Comp."},{"key":"5_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Compnay, New York (1979)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matching in bipartite graphs. J. SIAM Comp.\u00a02, 225\u2013231 (1973)","journal-title":"J. SIAM Comp."},{"key":"5_CR7","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 erriors. Information Sciences\u00a043, 169\u2013184 (1987)","journal-title":"Information Sciences"},{"key":"5_CR8","unstructured":"Klein, P.N., Sebastian, T.B., Kimia, B.B.: Shape matching using edi-distance: an implementation. In: Proc. SODA, pp. 781\u2013790 (2001)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-48452-3_18","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"1999","unstructured":"Navarro, G., Baeza-Yates, R.A.: Fast multi-dimensional approximate matching. In: Crochemore, M., Paterson, M.S. (eds.) Combinatorial Pattern Matching. LNCS, vol.\u00a01645, pp. 243\u2013257. Springer, Heidelberg (1999)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. J. of ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"J. of ACM"},{"issue":"7","key":"5_CR11","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/83.772245","volume":"8","author":"W.-Y. Wu","year":"1999","unstructured":"Wu, W.-Y., Wang, M.-J.: Two-dimensional object recognition through two-stage string matching. IEEE Transactions on Image Processing\u00a08(7), 978\u2013981 (1999)","journal-title":"IEEE Transactions on Image Processing"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:27:19Z","timestamp":1737394039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}