{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:17Z","timestamp":1759638197225,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850876"},{"type":"electronic","value":"9783030850883"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_8","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"91-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Range Automaton: An Efficient Approach to Text-Searching"],"prefix":"10.1007","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Scafiti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"issue":"10","key":"8_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"RA Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74\u201382 (1992). https:\/\/doi.org\/10.1145\/135239.135243","journal-title":"Commun. ACM"},{"issue":"10","key":"8_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Strother Moore, J.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977). https:\/\/doi.org\/10.1145\/359842.359859","journal-title":"Commun. ACM"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ic.2011.03.006","volume":"213","author":"D Cantone","year":"2012","unstructured":"Cantone, D., Faro, S., Giaquinta, F.: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213, 3\u201312 (2012). https:\/\/doi.org\/10.1016\/j.ic.2011.03.006","journal-title":"Inf. Comput."},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1..8:1","DOI":"10.1145\/3301295","volume":"24","author":"D Cantone","year":"2019","unstructured":"Cantone, D., Faro, S., Pavone, A.: Linear and efficient string matching algorithms based on weak factor recognition. ACM J. Exp. Algorithmics 24(1), 1..8:1-1.8:20 (2019). https:\/\/doi.org\/10.1145\/3301295","journal-title":"ACM J. Exp. Algorithmics"},{"key":"8_CR5","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M.: Text Algorithms. Oxford University Press, Oxford (1994).http:\/\/www-igm.univ-mlv.fr\/%7Emac\/REC\/B1.html"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-13193-6_12","volume-title":"Experimental Algorithms","author":"B Durian","year":"2010","unstructured":"Durian, B., Peltola, H., Salmela, L., Salmela, J.: Bit-parallel search algorithms for long patterns. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 129\u2013140. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_12"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jda.2014.07.003","volume":"28","author":"S Faro","year":"2014","unstructured":"Faro, S., Oguzhan K\u00fclekci, M.: Fast and flexible packed string matching. J. Discrete Algorithms 28, 61\u201372 (2014)","journal-title":"J. Discrete Algorithms"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_13"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"13:1","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:1-13:42 (2013). https:\/\/doi.org\/10.1145\/2431211.2431212","journal-title":"ACM Comput. Surv"},{"key":"8_CR10","unstructured":"Faro, S., Lecroq, T., Borzi, S., Di Mauro, S., Maggio, A.: The string matching algorithms research tool. In: 2016 Proceedings of the Prague Stringology Conference, pp. 99\u2013111 (2016). http:\/\/www.stringology.org\/event\/2016\/p09.html"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput., 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024","journal-title":"SIAM J. Comput.,"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2007.01.002","volume":"1012","author":"T Lecroq","year":"2007","unstructured":"Lecroq, T.: Fast exact string matching algorithms. Inf. Process. Lett 1012(6), 229\u2013235 (2007). https:\/\/doi.org\/10.1016\/j.ipl.2007.01.002","journal-title":"Inf. Process. Lett"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BFb0030778","volume-title":"Combinatorial Pattern Matching","author":"G Navarro","year":"1998","unstructured":"Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: fast extended string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 14\u201333. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0030778"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 80\u201393. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39984-1_7"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2019.09.031","volume":"812","author":"C Ryu","year":"2020","unstructured":"Ryu, C., Lecroq, T., Park, K.: Fast string matching for DNA sequences. Theor. Comput. Sci. 812, 137\u2013148 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.031","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"8_CR16","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/0306-4573(93)90106-N","volume":"29","author":"N Uratani","year":"1993","unstructured":"Uratani, N., Takeda, M.: A fast string-searching algorithm for multiple patterns. Inf. Process. Manag 29(6), 775\u2013792 (1993). https:\/\/doi.org\/10.1016\/0306-4573(93)90106-N","journal-title":"Inf. Process. Manag"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:47Z","timestamp":1630883027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}