{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:23:13Z","timestamp":1725549793745},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252078"},{"type":"electronic","value":"9783540318491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31849-1_84","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:33:04Z","timestamp":1268400784000},"page":"875-884","source":"Crossref","is-referenced-by-count":2,"title":["An Indexing Method for Two-D Pattern Matching with Applications to Digital Image Searches"],"prefix":"10.1007","author":[{"given":"Fei","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"AlShibli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G., Farach, M.: Alphabet Independent Twodimensional Matching. In: Proc. the 24th annual ACM Symposium on Theory of Computing, pp. 59\u201368 (1992)","DOI":"10.1145\/129712.129719"},{"issue":"6","key":"84_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"84_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"Amir, A., Landau, G.: Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science\u00a081, 97\u2013115 (1991)","journal-title":"Theoretical Computer Science"},{"key":"84_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0207043","volume":"7","author":"T.J. Baker","year":"1978","unstructured":"Baker, T.J.: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. SIAM J. on Computing\u00a07, 533\u2013541 (1978)","journal-title":"SIAM J. on Computing"},{"issue":"5","key":"84_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"R.S. Bird","year":"1977","unstructured":"Bird, R.S.: Two Dimensional Pattern Matching. Information Processing Letters\u00a06(5), 168\u2013170 (1977)","journal-title":"Information Processing Letters"},{"key":"84_CR6","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast matching algorithm. Commun. ACM\u00a020, 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"84_CR7","unstructured":"Giancarlo, R.: The Suffix of a Square Matrix, with Applications. In: Proc. Fourth Symposium on Discrete Algorithms. ACM-SIAM, pp. 402\u2013411 (1993)"},{"key":"84_CR8","first-page":"293","volume-title":"Pattern Matching Algorithms","author":"R. Giancarlo","year":"1997","unstructured":"Giancarlo, R., Grossi, R.: Suffix Tree Data Structures for Matrices. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 293\u2013340. Oxford University Press, Oxford (1997)"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Galil, Z., Park, K.: Truly Alphabet-Independent Two-dimensional Pattern Matching. In: Proc. 33th Symposium on Foundations of Computer Science, IEEE, pp. 247\u2013256 (1992)","DOI":"10.1109\/SFCS.1992.267767"},{"key":"84_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morries, J.H., Pratt, V.B.: Fast pattern matching in strings. SIAM J. on Computing\u00a06, 189\u2013195 (1977)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"84_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"Karp, R., Rabin, M.: Efficient Randomized Pattern Matching Algorithms. IBM J. Res. Develop.\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Develop."},{"key":"84_CR12","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing\u00a022, 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"84_CR13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J.B. Rosser","year":"1962","unstructured":"Rosser, J.B., Schoenfeld, L.: Approximate Formulas for Some Functions of Prime Numbers. Illinois J. Math\u00a06, 64\u201394 (1962)","journal-title":"Illinois J. Math"},{"key":"84_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0027775","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security","author":"F. Shi","year":"1996","unstructured":"Shi, F.: Suffix arrays for multiple strings: a method for on-line multiple string searches. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol.\u00a01179. Springer, Heidelberg (1996)"},{"issue":"9","key":"84_CR15","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1145\/66451.66459","volume":"32","author":"R.F. Zhu","year":"1989","unstructured":"Zhu, R.F., Takaoka, T.: A Technique for Two-Dimensional Pattern Matching. Communications of the ACM\u00a032(9), 1110\u20131120 (1989)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Web Technologies Research and Development - APWeb 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31849-1_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:29:09Z","timestamp":1605760149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31849-1_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252078","9783540318491"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31849-1_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}