{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:37Z","timestamp":1725484297610},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_5","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"42-52","source":"Crossref","is-referenced-by-count":12,"title":["String Matching with Stopper Encoding and Code Splitting"],"prefix":"10.1007","author":[{"given":"Jussi","family":"Rautio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jani","family":"Tanninen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. DCC\u201992, pages 279\u2013288, 1992.","DOI":"10.1109\/DCC.1992.227453"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jcss.1996.0023","volume":"52","author":"A. Amir","year":"1996","unstructured":"A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. J. of Comp. and Sys. Sciences, 52(2):299\u2013307, 1996.","journal-title":"J. of Comp. and Sys. Sciences"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"R. Arnold and T. Bell. A corpus for the evaluation of lossless compression algorithms. In Proc. DCC\u2019 97, Data Compression Conference. IEEE, 1997.","DOI":"10.1109\/DCC.1997.582019"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"R. Baeza-Yates. Improved string searching. Software-Practice and Experience, 19(3):257\u2013271, 1989.","journal-title":"Software-Practice and Experience"},{"issue":"10","key":"5_CR5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"R. S. Boyer and J. S. Moore. A fast string searching algorithm. CACM, 20(10):762\u2013772, 1977.","journal-title":"CACM"},{"key":"5_CR6","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"5_CR7","unstructured":"P. Gage. A new algorithm for data compression. C\/C++ Users Journal, 12(2), 1994."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. N. Horspool","year":"1980","unstructured":"R. N. Horspool. Practical fast searching in strings. Software Practice and Experience, 10:501\u2013506, 1980.","journal-title":"Software Practice and Experience"},{"issue":"9","key":"5_CR9","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"D. Huffman. A method for the construction of minimum-redundancy codes. Proc. of the I. R. E., 40(9):1090\u20131101, 1952.","journal-title":"Proc. of the I. R. E."},{"issue":"11","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"A. Hume and D. Sunday. Fast string searching. Software-Practice and Experience, 21(11):1221\u20131248, 1991.","journal-title":"Software-Practice and Experience"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/248625.248639","volume":"15","author":"U. Manber","year":"1997","unstructured":"U. Manber. A text compression scheme that allows fast searching directly in the compressed file. ACM Trans. on Information Systems, 15(2):124\u2013136, 1997.","journal-title":"ACM Trans. on Information Systems"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Moura","year":"2000","unstructured":"E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Trans. on Information Systems, 18(2):113\u2013139, 2000.","journal-title":"ACM Trans. on Information Systems"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Faster approximate string matching over compressed text. In Proc. 11th IEEE Data Compression Conference (DCC\u201901), pages 459\u2013468, 2001.","DOI":"10.1109\/DCC.2001.917177"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5, 2000.","DOI":"10.1145\/351827.384246"},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45123-4_16","volume-title":"Proc. 11st Annual Symposium on Combinatorial Pattern Matching (CPM 2000)","author":"G. Navarro","year":"2000","unstructured":"G. Navarro and J. Tarhio. Boyer-Moore string matching over Ziv-Lempel compressed text. In Proc. 11st Annual Symposium on Combinatorial Pattern Matching (CPM 2000), LNCS 1848, pages 166\u2013180, 2000."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1002\/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D","volume":"27","author":"H. Peltola","year":"1997","unstructured":"H. Peltola and J. Tarhio. String matching in the DNA alphabet. Software-Practice and Experience, 27:851\u2013861, 1997.","journal-title":"Software-Practice and Experience"},{"key":"5_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45123-4_17","volume-title":"Proc. 11st Annual Symposium on Combinatorial Pattern Matching (CPM 2000)","author":"Y. Shibata","year":"2000","unstructured":"Y. Shibata, T. Matsumoto, M. Takeda, A. Shiohara, and S. Arikawa. A Boyer-Moore type algorithm for compressed pattern matching. In Proc. 11st Annual Symposium on Combinatorial Pattern Matching (CPM 2000), LNCS 1848, pages 181\u2013194, 2000."},{"key":"5_CR18","unstructured":"S. Wu and U. Manber. Agrep-a fast approximate pattern-matching tool. In Proc. USENIX Technical Conference, pages 153\u2013162, Berkeley, CA, USA, 1992."},{"key":"5_CR19","first-page":"173","volume":"10","author":"R. Zhu","year":"1987","unstructured":"R. Zhu and T. Takaoka. On improving the average case of Boyer-Moore string matching algorithm. Journal of Information Processing, 10:173\u2013177, 1987.","journal-title":"Journal of Information Processing"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, 23:337\u2013343, 1977.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel. Compression of individual sequences via variable length coding. IEEE Trans. Inf. Theory, 24:530\u2013536, 1978.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:10:59Z","timestamp":1550322659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}