{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:33:26Z","timestamp":1766306006566,"version":"3.48.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":266,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.352","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:13Z","timestamp":1762467193000},"page":"2310-2317","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Searching All including Overlapping Matches through Regular Expressions"],"prefix":"10.1016","volume":"270","author":[{"given":"Wojciech","family":"Wieczorek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadiusz","family":"Nowakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.09.352_bib1","doi-asserted-by":"crossref","unstructured":"Ricardo A Baeza-Yates and Gaston H Gonnet. Fast text searching for regular expressions or automaton searching on tries. Journal of the ACM (JACM), 43(6):915\u2013936, 1996.","DOI":"10.1145\/235809.235810"},{"key":"10.1016\/j.procs.2025.09.352_bib2","unstructured":"Maxime Crochemore and Wojciech Rytter. Text algorithms. Oxford University Press, 1994."},{"key":"10.1016\/j.procs.2025.09.352_bib3","doi-asserted-by":"crossref","unstructured":"Amir Goren, Eddo Kim, Maayan Amit, Keren Vaknin, Nir Kfir, Oren Ram, and Gil Ast. Overlapping splicing regulatory motifs\u2014combinatorial effects on splicing. Nucleic acids research, 38(10):3318\u20133327, 2010.","DOI":"10.1093\/nar\/gkq005"},{"key":"10.1016\/j.procs.2025.09.352_bib4","doi-asserted-by":"crossref","unstructured":"Dan Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York, NY, USA, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"10.1016\/j.procs.2025.09.352_bib5","doi-asserted-by":"crossref","unstructured":"J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, second edition, 2001.","DOI":"10.1145\/568438.568455"},{"key":"10.1016\/j.procs.2025.09.352_bib6","doi-asserted-by":"crossref","unstructured":"Edward M McCreight. A space-economical sufx tree construction algorithm. Journal of the ACM (JACM), 23(2):262\u2013272, 1976.","DOI":"10.1145\/321941.321946"},{"key":"10.1016\/j.procs.2025.09.352_bib7","unstructured":"Gahyun Park and Wojciech Szpankowski. Towards a complete characterization of tries. In SODA, volume 5, pages 33\u201342. Citeseer, 2005."},{"key":"10.1016\/j.procs.2025.09.352_bib8","doi-asserted-by":"crossref","unstructured":"Esko Ukkonen. On-line construction of sufx trees. Algorithmica, 14(3):249\u2013260, 1995.","DOI":"10.1007\/BF01206331"},{"key":"10.1016\/j.procs.2025.09.352_bib9","doi-asserted-by":"crossref","unstructured":"Peter Weiner. Linear pattern matching algorithms. In 14th Annual Symposium on Switching and Automata Theory (swat 1973), pages 1\u201311. IEEE, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503025X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:29:22Z","timestamp":1766305762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187705092503025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":9,"alternative-id":["S187705092503025X"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.352","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Searching All including Overlapping Matches through Regular Expressions","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.352","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}