{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:50:09Z","timestamp":1770479409824,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642024405","type":"print"},{"value":"9783642024412","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_11","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"116-126","source":"Crossref","is-referenced-by-count":6,"title":["Fast Searching in Packed Strings"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proceedings of the 2nd Data Compression Conference, pp. 279\u2013288 (1992)","DOI":"10.1109\/DCC.1992.227453"},{"key":"11_CR2","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity and its applications. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 440\u2013452 (1992)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jcss.1996.0023","volume":"52","author":"A. Amir","year":"1996","unstructured":"Amir, A., Benson, G., Farach, M.: Let sleeping files lie: pattern matching in Z-compressed files. J. Comput. System Sci.\u00a052(2), 299\u2013307 (1996)","journal-title":"J. Comput. System Sci."},{"key":"11_CR4","first-page":"1209","volume":"11","author":"V.L. Arlazarov","year":"1975","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph (in russian). english translation in soviet math. dokl.\u00a011, 1209\u20131210 (1975); Dokl. Acad. Nauk. 194, 487\u2013488 (1970)","journal-title":"english translation in soviet math. dokl."},{"issue":"10","key":"11_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R.A. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R.A.: Improved string searching. Softw. Pract. Exper.\u00a019(3), 257\u2013271 (1989)","journal-title":"Softw. Pract. Exper."},{"issue":"10","key":"11_CR7","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 string searching algorithm. Commun. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"11_CR8","unstructured":"Faro, S., Lecroq, T.: Efficient pattern matching on binary strings. In: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (2009)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45735-6_5","volume-title":"String Processing and Information Retrieval","author":"K. Fredriksson","year":"2002","unstructured":"Fredriksson, K.: Faster string matching with super-alphabets. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 44\u201357. Springer, Heidelberg (2002)"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(03)00296-5","volume":"87","author":"K. Fredriksson","year":"2003","unstructured":"Fredriksson, K.: Shift-or string matching with super-alphabets. Inf. Process. Lett.\u00a087(4), 201\u2013204 (2003)","journal-title":"Inf. Process. Lett."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-76336-9_14","volume-title":"Implementation and Application of Automata","author":"S.T. Klein","year":"2007","unstructured":"Klein, S.T., Ben-Nissan, M.: Accelerating Boyer Moore searches on binary texts. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 130\u2013143. Springer, Heidelberg (2007)"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., James, J., Morris, H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. Masek","year":"1980","unstructured":"Masek, W., Paterson, M.: A faster algorithm for computing string edit distances. J. Comput. System Sci.\u00a020, 18\u201331 (1980)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/128749.128755","volume":"39","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W.: A four-russian algorithm for regular expression pattern matching. J. ACM\u00a039(2), 430\u2013448 (1992)","journal-title":"J. ACM"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences, 280 pages. Cambridge University Press, Cambridge (2002)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-47849-3_3","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"W. Rytter","year":"1999","unstructured":"Rytter, W.: Algorithms on compressed strings and arrays. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 48\u201365. Springer, Heidelberg (1999)"},{"key":"11_CR19","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":"J. Tarhio","year":"1997","unstructured":"Tarhio, J., Peltola, H.: String matching in the DNA alphabet. Softw. Pract. Exp.\u00a027, 851\u2013861 (1997)","journal-title":"Softw. Pract. Exp."},{"issue":"6","key":"11_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T.A. Welch","year":"1984","unstructured":"Welch, T.A.: A technique for high-performance data compression. IEEE Computer\u00a017(6), 8\u201319 (1984)","journal-title":"IEEE Computer"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jagm.1995.1041","volume":"19","author":"S. Wu","year":"1995","unstructured":"Wu, S., Manber, U., Myers, E.W.: A subquadratic algorithm for approximate regular expression matching. J. Algorithms\u00a019(3), 346\u2013360 (1995)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T15:44:04Z","timestamp":1552059844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}