{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:35Z","timestamp":1759638215909,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_6","type":"book-chapter","created":{"date-parts":[[2016,7,3]],"date-time":"2016-07-03T21:26:28Z","timestamp":1467581188000},"page":"65-76","source":"Crossref","is-referenced-by-count":4,"title":["A Very Fast String Matching Algorithm Based on Condensed Alphabets"],"prefix":"10.1007","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-47849-3_18","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"C Allauzen","year":"1999","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Factor oracle: A new structure for pattern matching. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 295\u2013310. Springer, Heidelberg (1999). http:\/\/dx.doi.org\/10.1007\/3-540-47849-3_18"},{"issue":"10","key":"6_CR2","doi-asserted-by":"crossref","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 35(10), 74\u201382 (1992). http:\/\/doi.acm.org\/10.1145\/135239.135243","journal-title":"Commun. ACM"},{"issue":"5\/6","key":"6_CR3","first-page":"589","volume":"10","author":"D Cantone","year":"2005","unstructured":"Cantone, D., Faro, S.: Fast-search algorithms: New efficient variants of the boyer-moore pattern-matching algorithm. J. Automata Lang. Comb. 10(5\/6), 589\u2013608 (2005)","journal-title":"J. Automata Lang. Comb."},{"key":"6_CR4","unstructured":"Cantone, D., Faro, S.: Improved and self-tuned occurrence heuristics. In: Holub, J., Zd\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2\u20134 September 2013, pp. 92\u2013106. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2013). http:\/\/www.stringology.org\/event\/2013\/p09.html"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ic.2011.03.006","volume":"213","author":"D Cantone","year":"2012","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213, 3\u201312 (2012). http:\/\/dx.doi.org\/10.1016\/j.ic.2011.03.006","journal-title":"Inf. Comput."},{"key":"6_CR6","unstructured":"Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. College Publications (2004)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Charras, C., Lecroq, T., Pehoushek, J.D.: A very fast string matching algorithm for small alphabeths and long patterns (extended abstract). In: Farach-Colton [11], pp. 55\u201364. http:\/\/dx.doi.org\/10.1007\/BFb0030780","DOI":"10.1007\/BFb0030780"},{"issue":"4\/5","key":"6_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string-matching algorithms. Algorithmica 12(4\/5), 247\u2013267 (1994). http:\/\/dx.doi.org\/10.1007\/BF01185427","journal-title":"Algorithmica"},{"key":"6_CR9","unstructured":"Durian, B., Chhabra, T., Ghuman, S.S., Hirvola, T., Peltola, H., Tarhio, J.: Improved two-way bit-parallel search. In: Holub, J., Zd\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 1\u20133 September 2014, pp. 71\u201383. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2014)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-13193-6_12","volume-title":"Experimental Algorithms","author":"B D\u030curian","year":"2010","unstructured":"D\u030curian, B., Peltola, H., Salmela, L., Tarhio, J.: Bit-parallel search algorithms for long patterns. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 129\u2013140. Springer, Heidelberg (2010)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Pattern Matching","year":"1998","unstructured":"Farach-Colton, M. (ed.): CPM 1998. LNCS, vol. 1448. Springer, Heidelberg (1998)"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.jda.2014.07.003","volume":"28","author":"S Faro","year":"2014","unstructured":"Faro, S., K\u00fclekci, M.O.: Fast and flexible packed string matching. J. Discrete Algorithms 28, 61\u201372 (2014). http:\/\/dx.doi.org\/10.1016\/j.jda.2014.07.003","journal-title":"J. Discrete Algorithms"},{"key":"6_CR13","unstructured":"Faro, S., Lecroq, T.: Efficient variants of the backward-oracle-matching algorithm. In: Holub, J., \u017dd\u030c\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2008, pp. 146\u2013160. Czech Technical University in Prague, Czech Republic (2008)"},{"key":"6_CR14","unstructured":"Faro, S., Lecroq, T.: The exact string matching problem: a comprehensive experimental evaluation. CoRR abs\/1012.2547 (2010)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-31606-7_13","volume-title":"Implementation and Application of Automata","author":"S Faro","year":"2012","unstructured":"Faro, S., Lecroq, T.: A fast suffix automata based algorithm for exact online string matching. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 149\u2013158. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-31606-7_13"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-642-30850-5_16","volume-title":"Experimental Algorithms","author":"S Faro","year":"2012","unstructured":"Faro, S., Lecroq, T.: A multiple sliding windows approach to speed up string matching algorithms. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 172\u2013183. Springer, Heidelberg (2012)"},{"issue":"2","key":"6_CR17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S Faro","year":"2013","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45(2), 13 (2013). http:\/\/doi.acm.org\/10.1145\/2431211.2431212","journal-title":"ACM Comput. Surv."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/11575832_42","volume-title":"String Processing and Information Retrieval","author":"K Fredriksson","year":"2005","unstructured":"Fredriksson, K., Grabowski, S.: Practical and optimal string matching. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 376\u2013387. Springer, Heidelberg (2005). http:\/\/dx.doi.org\/10.1007\/11575832_42"},{"issue":"2","key":"6_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"6_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(1), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"6_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ipl.2007.01.002","volume":"102","author":"T Lecroq","year":"2007","unstructured":"Lecroq, T.: Fast exact string matching algorithms. Inf. Process. Lett. 102(6), 229\u2013235 (2007). http:\/\/dx.doi.org\/10.1016\/j.ipl.2007.01.002","journal-title":"Inf. Process. Lett."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: Fast extended string matching. In: Farach-Colton [11], pp. 14\u201333. http:\/\/dx.doi.org\/10.1007\/BFb0030778","DOI":"10.1007\/BFb0030778"},{"issue":"3","key":"6_CR23","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"AC Yao","year":"1979","unstructured":"Yao, A.C.: The complexity of pattern matching for a random string. SIAM J. Comput. 8(3), 368\u2013387 (1979). http:\/\/dx.doi.org\/10.1137\/0208029","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:43:58Z","timestamp":1498311838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}