{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:02:18Z","timestamp":1742940138238,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298139"},{"type":"electronic","value":"9783319298146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29814-6_35","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:04:46Z","timestamp":1457341486000},"page":"414-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Suffix Type String Matching Algorithms Based on Multi-windows and Integer Comparison"],"prefix":"10.1007","author":[{"given":"Hongbo","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shupeng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,5]]},"reference":[{"issue":"8","key":"35_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"MS Daniel","year":"1990","unstructured":"Daniel, M.S.: A very fast substring search algorithm. Commun. ACM 33(8), 132\u2013142 (1990)","journal-title":"Commun. ACM"},{"issue":"11","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"H Andrew","year":"1991","unstructured":"Andrew, H.: Fast string searching. Softw. Pract. Exp. 21(11), 1221\u20131248 (1991)","journal-title":"Softw. Pract. Exp."},{"key":"35_CR3","first-page":"417","volume-title":"BIRD 2008","author":"P Kalsi","year":"2008","unstructured":"Kalsi, P., Hannu, P., Jorma, T.: Comparison of exact string matching algorithms for biological sequences. BIRD 2008, pp. 417\u2013426. Springer, Berlin (2008)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6","key":"35_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"RN Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Exp. 10(6), 501\u2013506 (1980)","journal-title":"Softw. Pract. Exp."},{"key":"35_CR6","unstructured":"SMART: string matching research tools. http:\/\/www.dmi.unict.it\/~faro\/smart\/"},{"issue":"2","key":"35_CR7","first-page":"13:1","volume":"45","author":"F Simone","year":"2013","unstructured":"Simone, F., Simone, F., Thierry, L.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv. 45(2), 13:1\u201313:42 (2013)","journal-title":"ACM Comput. Surv."},{"key":"35_CR8","unstructured":"The large canterbury corpus. http:\/\/corpus.canterbury.ac.nz\/descriptions\/"},{"key":"35_CR9","unstructured":"Hannu, P., Jorma, T.: Variations of forward-SBNDM. In: PSC2011, pp. 3\u201314. Czech Technical University, Prague (2011)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-1-4614-7010-6_29","volume-title":"Emerging Technologies for Information Systems, Computing, and Management","author":"Wenqing Wu","year":"2013","unstructured":"Wu, W., Fan, H., Liu, L., Huang, Q.: Fast string matching algorithm based on the skip algorithm. ICM 2012. LNEE, vol. 236, pp. 247\u2013257. Springer, New York (2013)"},{"key":"35_CR12","doi-asserted-by":"publisher","unstructured":"Lv, Z., Fan, H., Liu, L., Huang, Q., et al.: Fast single pattern string matching algorithms based on multi-windows and integer comparison. In: IET International Conference on ICISCE 2012, pp. 1\u20135 (2012). doi:10.1049\/cp.2012.2326)","DOI":"10.1049\/cp.2012.2326"},{"key":"35_CR13","first-page":"965","volume-title":"Lecture Notes in Electrical Engineering","author":"Hongbo Fan","year":"2012","unstructured":"Fan, H., Yao, N.: Tuning the EBOM algorithm with suffix jump. ICITSE 2012. LNEE, vol. 211, pp. 965\u2013973 (2013)"},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Chen, Z., Liu, L., Fan, H., Huang, Q., et al..: A fast exact string matching algorithms based on greedy jump and QF. ICISCE 2012. In: IET International Conference (2012). doi:10.1049\/cp.2012.2320","DOI":"10.1049\/cp.2012.2320"},{"key":"35_CR15","first-page":"453","volume-title":"Lecture Notes in Electrical Engineering","author":"Hongbo Fan","year":"2012","unstructured":"Fan, H., Yao, N.: Q-gram variation for EBOM. In: Proceedings of the 2012 International Conference on Information Technology and Software Engineering. LNEE, vol. 211, pp. 453\u2013460 (2013)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Branislav, D., Jan, H., Hannu, P., Jorna T.: Tuning BNDM with q-grams. In: ALENEX 2009, pp. 29\u201337. SIAM, New York (2009)","DOI":"10.1137\/1.9781611972894.3"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29814-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T06:17:37Z","timestamp":1623824257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-29814-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298139","9783319298146"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29814-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}