{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:30Z","timestamp":1725456270560},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620310"},{"type":"electronic","value":"9783540496267"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0027775","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T01:33:16Z","timestamp":1132623196000},"page":"11-22","source":"Crossref","is-referenced-by-count":16,"title":["Suffix arrays for multiple strings: A method for on-line multiple string searches"],"prefix":"10.1007","author":[{"given":"Fei","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson and M. Farach, Alphabet Independent Two-dimensional Matching. Proc. the 24th annual ACM Symposium on Theory of Computing, 1992, 59\u201368.","DOI":"10.1145\/129712.129719"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","volume":"31","author":"A. Apostolico","year":"1985","unstructured":"A. Apostolico and F.P. Preparata, Structural properties of the string statistics problem, Journal of computer and System science 31 (1985), pp. 394\u2013411.","journal-title":"Journal of computer and System science"},{"issue":"1","key":"2_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/nar\/14.1.141","volume":"4","author":"B. Clift","year":"1986","unstructured":"B. Clift, D. Haussler, R. McConnell, T.D. Schneider and G.D. Stomo, Sequence landscapes, Nucleic Acids Research 4, 1 (1986), pp. 141\u2013158.","journal-title":"Nucleic Acids Research"},{"key":"2_CR4","first-page":"116","volume-title":"Proc. 31st FOCS","author":"W. Chang","year":"1990","unstructured":"W. Chang and E. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. 31st FOCS, St. Louis, MO, Oct. 1990, IEEE, pp. 116\u2013124."},{"key":"2_CR5","unstructured":"T. Cormen, C. Leiserson and R. Rivest, Algorithms. The MIT Press, 1990."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM journal on Computing 13 (1984), pp. 338\u2013355.","journal-title":"SIAM journal on Computing"},{"key":"2_CR7","unstructured":"L.C.K. Hui, Color set size problem with applications to string matching, Proc. CPM'92, LNCS 644 (1992), Springer-Verlag, pp. 230\u2013243."},{"issue":"No.2","key":"2_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"R. Karp and M. Rabin, Efficient Randomized Pattern Matching Algorithms. IBM J. Res. Develop. Vol. 31, No. 2, March 1987, pp. 249\u2013260.","journal-title":"IBM J. Res. Develop"},{"key":"2_CR9","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. Journal of the ACM 23 (1976), 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"2_CR10","unstructured":"U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches. Proc. the 1st ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 319\u2013327."},{"key":"2_CR11","unstructured":"Fei Shi, An algorithm for two-dimensional pattern matching, Proceedings of the 2nd South American Workshop on String Processing, Valpariso, Chile, (eds.) U. Manber, R. Baeza-Yates, 1995, pp. 101\u2013116."},{"key":"2_CR12","first-page":"257","volume-title":"Fast approximate string matching with q-blocks sequences","author":"F. Shi","year":"1996","unstructured":"Fei Shi, Fast approximate string matching with q-blocks sequences, in Proceedings of the third South American Workshop on String Processing, Carleton University Press, Ottawa, Canada, 1996, pp. 257\u2013271."},{"key":"2_CR13","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: Simplification and parallelization, SIAM Journal on computing 17 (December 1988), pp. 1253\u20131262.","journal-title":"SIAM Journal on computing"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear Pattern Matching Algorithm, Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Concurrency and Parallelism, Programming, Networking, and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T01:44:56Z","timestamp":1549331096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620310","9783540496267"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0027775","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}