{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:06:58Z","timestamp":1743044818376,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206429"},{"type":"electronic","value":"9783031206436"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20643-6_3","type":"book-chapter","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:09Z","timestamp":1667222289000},"page":"24-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Algorithms for\u00a0Finding Distinct Substrings with\u00a0Length and\u00a0Multiple Prefix and\u00a0Suffix Conditions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-7033","authenticated-orcid":false,"given":"Laurentius","family":"Leonard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Amir, A., Levy, A., Porat, E., Shalom, B.R.: Online recognition of dictionary with one gap. Inf. Comput. 275, 104633 (2020)","key":"3_CR1","DOI":"10.1016\/j.ic.2020.104633"},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"RA Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: Fast text searching for regular expressions or automaton searching on tries. J. ACM (JACM) 43(6), 915\u2013936 (1996)","journal-title":"J. ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Choi, Y.H., Jung, M.Y., Seo, S.W.: L+ 1-mwm: a fast pattern matching algorithm for high-speed packet filtering. In: IEEE INFOCOM 2008-The 27th Conference on Computer Communications, pp. 2288\u20132296. IEEE (2008)","key":"3_CR3","DOI":"10.1109\/INFOCOM.2008.297"},{"unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Maxime Crochemore (1994)","key":"3_CR4"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11496656_15","volume-title":"Combinatorial Pattern Matching","author":"S Dori","year":"2005","unstructured":"Dori, S., Landau, G.M.: Construction of Aho Corasick automaton in linear time for integer alphabets. In: Apostolico, A., Crochemore, M., Park, K. (eds.) Combinatorial Pattern Matching, pp. 168\u2013177. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496656_15"},{"doi-asserted-by":"publisher","unstructured":"Fuchino, T., Harada, T., Tanaka, K., Mikawa, K.: Acceleration of packet classification using adjacency list of rules. In: 2019 28th International Conference on Computer Communication and Networks (ICCCN) (2019). https:\/\/doi.org\/10.1109\/icccn.2019.8846923","key":"3_CR6","DOI":"10.1109\/icccn.2019.8846923"},{"doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/cbo9780511574931","key":"3_CR7","DOI":"10.1017\/cbo9780511574931"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM (JACM) 53(6), 918\u2013936 (2006)","journal-title":"J. ACM (JACM)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A. (ed.) CPM 2001. LNCS, vol. 2089, pp. 181\u2013192. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48194-X_17"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jda.2004.08.019","volume":"3","author":"DK Kim","year":"2005","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2), 126\u2013142 (2005). https:\/\/doi.org\/10.1016\/j.jda.2004.08.019","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"publisher","unstructured":"Leonard, L., Tanaka, K.: Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems (2022). https:\/\/doi.org\/10.48550\/ARXIV.2203.16908","key":"3_CR11","DOI":"10.48550\/ARXIV.2203.16908"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.tcs.2020.09.016","volume":"845","author":"A Levy","year":"2020","unstructured":"Levy, A., Shalom, B.R.: Online parameterized dictionary matching with one gap. Theoret. Comput. Sci. 845, 208\u2013229 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.09.016","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139940023","volume-title":"Genome-Scale Algorithm Design","author":"V Makinen","year":"2015","unstructured":"Makinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press, Cambridge, England (May (2015)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","volume":"37","author":"U Manber","year":"1991","unstructured":"Manber, U., Baeza-Yates, R.: An algorithm for string matching with a sequence of don\u2019t cares. Inf. Process. Lett. 37(3), 133\u2013136 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90032-D","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"3_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993). https:\/\/doi.org\/10.1137\/0222058","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1587\/transinf.2013EDP7087","volume":"E98.D","author":"K Mikawa","year":"2015","unstructured":"Mikawa, K., Tanaka, K.: Run-based trie involving the structure of arbitrary bitmask rules. IEICE Trans. Inf. Syst. E98.D(6), 1206\u20131212 (2015). https:\/\/doi.org\/10.1587\/transinf.2013EDP7087","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10994-006-9505-y","volume":"65","author":"R Pampapathi","year":"2006","unstructured":"Pampapathi, R., Mirkin, B., Levene, M.: A suffix tree approach to anti-spam email filtering. Mach. Learn. 65(1), 309\u2013338 (2006). https:\/\/doi.org\/10.1007\/s10994-006-9505-y","journal-title":"Mach. Learn."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BFb0054072","volume-title":"Grammatical Inference","author":"J Ruiz","year":"1998","unstructured":"Ruiz, J., Espa\u00f1a, S., Garc\u00eda, P.: Locally threshold testable languages in strict sense: application to the inference problem. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 150\u2013161. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054072"},{"doi-asserted-by":"publisher","unstructured":"Sen, S., Spatscheck, O., Wang, D.: Accurate, scalable in-network identification of p2p traffic using application signatures. In: Proceedings of the 13th International Conference on World Wide Web, pp. 512\u2013521. WWW 2004, Association for Computing Machinery, New York, NY, USA (2004). https:\/\/doi.org\/10.1145\/988672.988742","key":"3_CR19","DOI":"10.1145\/988672.988742"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.11.017","volume":"854","author":"BR Shalom","year":"2021","unstructured":"Shalom, B.R.: Parameterized dictionary matching and recognition with one gap. Theoret. Comput. Sci. 854, 1\u201316 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.11.017","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Tongaonkar, A.S.: Fast pattern-matching techniques for packet filtering. Ph.D. thesis, Stony Brook University (2004)","key":"3_CR21"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995). https:\/\/doi.org\/10.1007\/BF01206331","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20643-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:45Z","timestamp":1667222325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20643-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206429","9783031206436"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20643-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2022.inf.udec.cl\/","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":"43","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":"23","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":"0","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":"53% - 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.62","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)"}}]}}