{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:22:43Z","timestamp":1725524563467},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422716"},{"type":"electronic","value":"9783540481942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48194-x_14","type":"book-chapter","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T19:24:31Z","timestamp":1233689071000},"page":"152-156","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Asaka","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"H. Arimura, J. Abe, R. Fujino, H. Sakamoto, S. Shimozono, S. Arikawa, Text Data Mining: Discovery of Important Keywords in the Cyberspace, In Proc. IEEE Kyoto Int\u2019l Conf. Digital Library, 2001. (to appear)","DOI":"10.1109\/DLRP.2000.942178"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"H. Arimura","year":"2000","unstructured":"H. Arimura, S. Arikawa, S. Shimozono, Efficient discovery of optimal word-association patterns in large text databases, New Generation Computing, Special issue on Discovery Science, 18, 49\u201360, 2000.","journal-title":"New Generation Computing"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Arimura, H., Wataki, A., Fujino, R., Arikawa, S., A fast algorithm for discovering optimal string patterns in large text databases, In Proc. the 9th Int. Workshop on Algorithmic Learning Theory (ALT\u201998), LNAI 1501, 247\u2013261, 1998.","DOI":"10.1007\/3-540-49730-7_19"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gyorfi, G. Lugosi, A Probablistic Theory of Pattern Recognition, Springer-Verlag,1996.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"14_CR5","unstructured":"G. Gonnet, R. Baeza-Yates and T. Snider, New indices for text: Pat trees and pat arrays, In William Frakes and Ricardo Baeza-Yates (eds.), Information Retrieval: Data Structures and Algorithms, 66\u201382, 1992."},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997."},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CPM\u201901","author":"T. Kasai","year":"2001","unstructured":"T. Kasai, G. Lee, H. Arimura, S. Arikawa, K. Park, Linear-time longest-common-prefix computation in suffix arrays and its applications, In Proc. CPM\u201901, LNCS, Springer-Verlag, 2000 (this volumn). (A part of this work is also available as: T. Kasai, H. Arimura, S. Arikawa, Efficient substring traversal with suffix arrays, DOI-TR 185, 2001, ftp:\/\/ftp.i.kyushu-u.ac.jp\/pub\/tr\/trcs185.ps.gz. )"},{"issue":"2-3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00993468","volume":"17","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns, R.E. Shapire, L.M. Sellie, Toward efficient agnostic learning. Machine Learning, 17(2-3), 115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"14_CR9","unstructured":"D. Lewis, Reuters-2157-8 text categorization test collection, Distribution 1.0, AT&T Labs-Research, http:\/\/www.research.att.com\/~lewis\/ , 1997."},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight, A space-economical suffix tree construction algorithm, JACM, 23(2):262\u2013272, 1976.","journal-title":"JACM"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"U. Manber and R. Baeza-Yates, An algorithm for string matching with a sequence of don\u2019t cares. IPL 37, 1991.","DOI":"10.1016\/0020-0190(91)90032-D"},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Computing, 22(5), 935\u2013948 (1993).","journal-title":"SIAM J. Computing"},{"key":"14_CR13","unstructured":"S. Morishita, On classification and regression, In Proc. Discovery Science\u2019 98, LNAI 1532, 49\u201359, 1998."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, On finding lowest common ancestors: simplifications an parallelization, SIAM J. Computing, 17, 1253\u20131262, 1988.","journal-title":"SIAM J. Computing"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, G.W. Chirn, T.G. Marr, B. Shapiro, D. Shasha and K. Zhang, In Proc. SIGMOD\u201994, 115\u2013125, 1994.","DOI":"10.1145\/191843.191863"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48194-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:41:08Z","timestamp":1558122068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48194-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422716","9783540481942"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48194-x_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}