{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:08:59Z","timestamp":1776064139691,"version":"3.50.1"},"reference-count":134,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006470","name":"Aristotle University of Thessaloniki","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006470","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Detecting pattern matches underpins key operations across fields, such as complex event processing (CEP), sequential pattern mining (SPM), string pattern matching, pattern mining from a large sequence, and business process mining. These fields employ various notations and definitions for the detected patterns, posing challenges in recognizing their shared underlying concepts. This work aims to bridge these gaps by proposing a unified notation and terminology and then cataloging various pattern queries and constraints identified in different fields into a comprehensive framework. Our analysis reveals substantial similarities among the various pattern types, suggesting a promising avenue for the transfer of techniques between disciplines. This approach paves the way to leverage existing knowledge efficiently and circumvent the redundancy of \u201creinventing the wheel\u201d.<\/jats:p>","DOI":"10.1007\/s10618-025-01110-w","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T16:53:44Z","timestamp":1749228824000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequential pattern detection: similarities and differences across various fields"],"prefix":"10.1007","volume":"39","author":[{"given":"Ioannis","family":"Mavroudopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Gounaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"1110_CR1","doi-asserted-by":"publisher","unstructured":"Aalst WMP, Carmona J (eds) (2022) Process mining handbook. Lecture notes in business information processing, vol 448. Springer. https:\/\/doi.org\/10.1007\/978-3-031-08848-3","DOI":"10.1007\/978-3-031-08848-3"},{"issue":"2","key":"1110_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/S10115-011-0408-2","volume":"31","author":"A Achar","year":"2012","unstructured":"Achar A, Laxman S, Sastry PS (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31(2):223\u2013250. https:\/\/doi.org\/10.1007\/S10115-011-0408-2","journal-title":"Knowl Inf Syst"},{"key":"1110_CR3","doi-asserted-by":"publisher","unstructured":"Acheli M, Grigori D, Weidlich M (2019) Efficient discovery of compact maximal behavioral patterns from event logs. In: 31st international conference on advanced information systems engineering (CAiSE 2019), Rome, Italy, pp 579\u2013594. https:\/\/doi.org\/10.1007\/978-3-030-21290-2_36. https:\/\/hal.science\/hal-02177689","DOI":"10.1007\/978-3-030-21290-2_36"},{"key":"1110_CR4","unstructured":"Acheli M, Grigori D, Weidlich M (2024) Mining a minimal set of behavioral patterns using incremental evaluation. arXiv:2402.02921"},{"key":"1110_CR5","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Bocca JB, Jarke M, Zaniolo C (eds) VLDB\u201994, proceedings of 20th international conference on very large data bases, September 12\u201315, 1994, Santiago de Chile, Chile, pp 487\u2013499. http:\/\/www.vldb.org\/conf\/1994\/P487.PDF"},{"issue":"7","key":"1110_CR6","first-page":"144","volume":"4","author":"K Al-Khamaiseh","year":"2014","unstructured":"Al-Khamaiseh K, ALShagarin S (2014) A survey of string matching algorithms. Int J Eng Res Appl 4(7):144\u2013156","journal-title":"Int J Eng Res Appl"},{"issue":"5","key":"1110_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/3117809","volume":"50","author":"E Alevizos","year":"2017","unstructured":"Alevizos E, Skarlatidis A, Artikis A, Paliouras G (2017) Probabilistic complex event recognition: a survey. ACM Comput Surv 50(5):71\u201317131. https:\/\/doi.org\/10.1145\/3117809","journal-title":"ACM Comput Surv"},{"key":"1110_CR8","doi-asserted-by":"publisher","unstructured":"Alman A, Ciccio CD, Haas D, Maggi FM, Nolte A (2020) Rule mining with rum. In: Dongen BF, Montali M, Wynn MT (eds) 2nd international conference on process mining, ICPM 2020, Padua, Italy, October 4\u20139, 2020, pp 121\u2013128. https:\/\/doi.org\/10.1109\/ICPM49681.2020.00027","DOI":"10.1109\/ICPM49681.2020.00027"},{"key":"1110_CR9","unstructured":"Augusto A, Awad A, Dumas M (2021) Efficient checking of temporal compliance rules over business process event logs. CoRR arXiv:2112.04623"},{"key":"1110_CR10","doi-asserted-by":"crossref","unstructured":"Balazinska M, Kwon Y, Kuchta N, Lee D (2007) Moirae: history-enhanced monitoring. In: Third biennial conference on innovative data systems research, CIDR 2007, Asilomar, CA, USA, January 7\u201310, 2007, online proceedings, pp 375\u2013386. http:\/\/cidrdb.org\/cidr2007\/papers\/cidr07p43.pdf","DOI":"10.1016\/j.cogsys.2006.05.002"},{"key":"1110_CR11","doi-asserted-by":"publisher","unstructured":"Bonchi F, Lucchese C (2005) Pushing tougher constraints in frequent pattern mining. In: Ho TB, Cheung DW, Liu H (eds) Advances in knowledge discovery and data mining, 9th Pacific-Asia conference, PAKDD 2005, Hanoi, Vietnam, May 18\u201320, 2005, proceedings. Lecture notes in computer science, vol 3518. Springer, pp 114\u2013124. https:\/\/doi.org\/10.1007\/11430919_15","DOI":"10.1007\/11430919_15"},{"key":"1110_CR12","doi-asserted-by":"publisher","unstructured":"Cao H, Cheung DW, Mamoulis N (2004) Discovering partial periodic patterns in discrete data sequences. In: Dai H, Srikant R, Zhang C (eds) Advances in knowledge discovery and data mining, 8th Pacific-Asia conference, PAKDD 2004, Sydney, Australia, May 26\u201328, 2004, proceedings. Lecture notes in computer science, vol 3056. Springer, pp 653\u2013658. https:\/\/doi.org\/10.1007\/978-3-540-24775-3_77","DOI":"10.1007\/978-3-540-24775-3_77"},{"key":"1110_CR13","doi-asserted-by":"publisher","unstructured":"Casas-Garriga G (2003) Discovering unbounded episodes in sequential data. In: Lavrac N, Gamberger D, Blockeel H, Todorovski L (eds) Knowledge discovery in databases: PKDD 2003, 7th European conference on principles and practice of knowledge discovery in databases, Cavtat-Dubrovnik, Croatia, September 22\u201326, 2003, proceedings. Lecture notes in computer science, vol 2838. Springer, pp 83\u201394. https:\/\/doi.org\/10.1007\/978-3-540-39804-2_10","DOI":"10.1007\/978-3-540-39804-2_10"},{"issue":"6","key":"1110_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3422823","volume":"67","author":"D Chakraborty","year":"2020","unstructured":"Chakraborty D, Das D, Goldenberg E, Kouck\u00fd M, Saks ME (2020) Approximating edit distance within constant factor in truly sub-quadratic time. J ACM 67(6):36\u201313622. https:\/\/doi.org\/10.1145\/3422823","journal-title":"J ACM"},{"issue":"3","key":"1110_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.14778\/3494124.3494137","volume":"15","author":"K Chapnik","year":"2021","unstructured":"Chapnik K, Kolchinsky I, Schuster A (2021) DARLING: data-aware load shedding in complex event processing systems. Proc VLDB Endow 15(3):541\u2013554. https:\/\/doi.org\/10.14778\/3494124.3494137","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1110_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"M Chen","year":"1998","unstructured":"Chen M, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2):209\u2013221. https:\/\/doi.org\/10.1109\/69.683753","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1110_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/S10115-006-0016-8","volume":"10","author":"G Chen","year":"2006","unstructured":"Chen G, Wu X, Zhu X, Arslan AN, He Y (2006) Efficient string matching with wildcards and length constraints. Knowl Inf Syst 10(4):399\u2013419. https:\/\/doi.org\/10.1007\/S10115-006-0016-8","journal-title":"Knowl Inf Syst"},{"key":"1110_CR18","unstructured":"Ciccio CD, Schouten MHM, Leoni M, Mendling J (2015) Declarative process discovery with MINERful in ProM. In: Daniel F, Zugal S (eds) Proceedings of the BPM demo session 2015 co-located with the 13th international conference on business process management (BPM 2015), Innsbruck, Austria, September 2, 2015. CEUR Workshop Proceedings, vol 1418, pp 60\u201364. CEUR-WS.org. https:\/\/ceur-ws.org\/Vol-1418\/paper13.pdf"},{"issue":"2","key":"1110_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/J.IPL.2006.08.002","volume":"101","author":"P Clifford","year":"2007","unstructured":"Clifford P, Clifford R (2007) Simple deterministic wildcard matching. Inf Process Lett 101(2):53\u201354. https:\/\/doi.org\/10.1016\/J.IPL.2006.08.002","journal-title":"Inf Process Lett"},{"issue":"1","key":"1110_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/J.JALGOR.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S (2005) An improved data stream summary: the count-min sketch and its applications. J Algorithms 55(1):58\u201375. https:\/\/doi.org\/10.1016\/J.JALGOR.2003.12.001","journal-title":"J Algorithms"},{"issue":"1145\/2187671","key":"1110_CR21","first-page":"2187677","volume":"10","author":"G Cugola","year":"2012","unstructured":"Cugola G, Margara A (2012) Processing flows of information: from data stream to complex event processing. ACM Comput Surv 10(1145\/2187671):2187677","journal-title":"ACM Comput Surv"},{"key":"1110_CR22","doi-asserted-by":"publisher","unstructured":"Das G, Fleischer R, Gasieniec L, Gunopulos D, K\u00e4rkk\u00e4inen J (1997) Episode matching. In: Apostolico A, Hein J (eds) Combinatorial pattern matching, 8th annual symposium, CPM 97, Aarhus, Denmark, June 30\u2013July 2, 1997, proceedings. Lecture notes in computer science, vol 1264. Springer, pp 12\u201327. https:\/\/doi.org\/10.1007\/3-540-63220-4_46","DOI":"10.1007\/3-540-63220-4_46"},{"key":"1110_CR23","doi-asserted-by":"publisher","first-page":"108400","DOI":"10.1109\/ACCESS.2019.2933044","volume":"7","author":"N Deng","year":"2019","unstructured":"Deng N, Chen X, Li D, Xiong C (2019) Frequent patterns mining in DNA sequence. IEEE Access 7:108400\u2013108410. https:\/\/doi.org\/10.1109\/ACCESS.2019.2933044","journal-title":"IEEE Access"},{"issue":"11\u201316","key":"1110_CR24","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/S1389-1286(99)00020-1","volume":"31","author":"A Deutsch","year":"1999","unstructured":"Deutsch A, Fern\u00e1ndez MF, Florescu D, Levy AY, Suciu D (1999) A query language for XML. Comput Netw 31(11\u201316):1155\u20131169. https:\/\/doi.org\/10.1016\/S1389-1286(99)00020-1","journal-title":"Comput Netw"},{"issue":"1","key":"1110_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/S13278-022-00891-Y","volume":"12","author":"I Dimitriadis","year":"2022","unstructured":"Dimitriadis I, Mavroudopoulos I, Kyrama S, Toliopoulos T, Gounaris A, Vakali A, Billis A, Bamidis PD (2022) Scalable real-time health data sensing and analysis enabling collaborative care delivery. Soc Netw Anal Min 12(1):63. https:\/\/doi.org\/10.1007\/S13278-022-00891-Y","journal-title":"Soc Netw Anal Min"},{"key":"1110_CR26","doi-asserted-by":"publisher","unstructured":"Ding B, Lo D, Han J, Khoo S (2009) Efficient mining of closed repetitive gapped subsequences from a sequence database. In: Ioannidis YE, Lee DL, Ng RT (eds) Proceedings of the 25th international conference on data engineering, ICDE 2009, March 29 2009\u2013April 2 2009, Shanghai, China. IEEE Computer Society, pp 1024\u20131035. https:\/\/doi.org\/10.1109\/ICDE.2009.104","DOI":"10.1109\/ICDE.2009.104"},{"key":"1110_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56509-4","volume-title":"Fundamentals of business process management","author":"M Dumas","year":"2018","unstructured":"Dumas M, Rosa ML, Mendling J, Reijers HA (2018) Fundamentals of business process management, second. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-662-56509-4","edition":"second"},{"key":"1110_CR28","doi-asserted-by":"publisher","unstructured":"Dwyer MB, Avrunin GS, Corbett JC (1999) Patterns in property specifications for finite-state verification. In: Boehm BW, Garlan D, Kramer J (eds) Proceedings of the 1999 international conference on software engineering, ICSE\u2019 99, Los Angeles, CA, USA, May 16\u201322, 1999. ACM, pp 411\u2013420. https:\/\/doi.org\/10.1145\/302405.302672","DOI":"10.1145\/302405.302672"},{"key":"1110_CR29","unstructured":"El Gammal AFSA (2012) Towards a comprehensive framework for business process compliance. PhD thesis, Tilburg University"},{"issue":"1","key":"1110_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/S10270-014-0395-3","volume":"15","author":"A Elgammal","year":"2016","unstructured":"Elgammal A, T\u00fcretken O, Heuvel W, Papazoglou MP (2016) Formalizing and appling compliance patterns for business process compliance. Softw Syst Model 15(1):119\u2013146. https:\/\/doi.org\/10.1007\/S10270-014-0395-3","journal-title":"Softw Syst Model"},{"issue":"1\u20132","key":"1110_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/S13740-021-00122-1","volume":"10","author":"S Esser","year":"2021","unstructured":"Esser S, Fahland D (2021) Multi-dimensional event data in graph databases. J Data Semant 10(1\u20132):109\u2013141. https:\/\/doi.org\/10.1007\/S13740-021-00122-1","journal-title":"J Data Semant"},{"key":"1110_CR32","unstructured":"Etzion O, Niblett P (2010) Event processing in action. Manning Publications Company. http:\/\/www.manning.com\/etzion\/"},{"key":"1110_CR33","unstructured":"Foundation AS (2021) FlinkCEP. https:\/\/nightlies.apache.org\/flink\/flink-docs-stable\/. Accessed: 8 Apr 2024"},{"key":"1110_CR34","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Gueniche T, Zida S, Tseng VS (2014) Erminer: sequential rule mining using equivalence classes. In: Blockeel H, Leeuwen M, Vinciotti V (eds) Advances in intelligent data analysis XIII\u201413th international symposium, IDA 2014, Leuven, Belgium, October 30\u2013November 1, 2014. Proceedings. Lecture notes in computer science, vol 8819. Springer, pp 108\u2013119. https:\/\/doi.org\/10.1007\/978-3-319-12571-8_10","DOI":"10.1007\/978-3-319-12571-8_10"},{"issue":"8","key":"1110_CR35","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TKDE.2015.2405509","volume":"27","author":"P Fournier-Viger","year":"2015","unstructured":"Fournier-Viger P, Wu C, Tseng VS, Cao L, Nkambou R (2015) Mining partially-ordered sequential rules common to multiple sequences. IEEE Trans Knowl Data Eng 27(8):2203\u20132216. https:\/\/doi.org\/10.1109\/TKDE.2015.2405509","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1110_CR36","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JC-W, Kiran RU, Koh YS, Thomas R (2017) A survey of sequential pattern mining. Data Sci Pattern Recognit 1(1):54\u201377","journal-title":"Data Sci Pattern Recognit"},{"key":"1110_CR37","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Chun-Wei\u00a0Lin J, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. In: High-utility pattern mining. Springer, Berlin, pp 1\u201345","DOI":"10.1007\/978-3-030-04921-8_1"},{"issue":"4","key":"1110_CR38","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2021","unstructured":"Gan W, Lin JC, Fournier-Viger P, Chao H, Tseng VS, Yu PS (2021) A survey of utility-oriented pattern mining. IEEE Trans Knowl Data Eng 33(4):1306\u20131327. https:\/\/doi.org\/10.1109\/TKDE.2019.2942594","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1110_CR39","unstructured":"Garofalakis MN, Rastogi R, Shim K (1999) SPIRIT: sequential pattern mining with regular expression constraints. In: Atkinson MP, Orlowska ME, Valduriez P, Zdonik SB, Brodie ML (eds) VLDB\u201999, proceedings of 25th international conference on very large data bases, September 7\u201310, 1999, Edinburgh, Scotland, UK. Morgan Kaufmann, pp 223\u2013234. http:\/\/www.vldb.org\/conf\/1999\/P22.pdf"},{"issue":"3","key":"1110_CR40","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TKDE.2002.1000341","volume":"14","author":"MN Garofalakis","year":"2002","unstructured":"Garofalakis MN, Rastogi R, Shim K (2002) Mining sequential patterns with regular expression constraints. IEEE Trans Knowl Data Eng 14(3):530\u2013552. https:\/\/doi.org\/10.1109\/TKDE.2002.1000341","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1110_CR41","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/S00778-019-00557-W","volume":"29","author":"N Giatrakos","year":"2020","unstructured":"Giatrakos N, Alevizos E, Artikis A, Deligiannakis A, Garofalakis MN (2020) Complex event recognition in the big data era: a survey. VLDB J 29(1):313\u2013352. https:\/\/doi.org\/10.1007\/S00778-019-00557-W","journal-title":"VLDB J"},{"issue":"1","key":"1110_CR42","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/S10489-012-0394-4","volume":"39","author":"D Guo","year":"2013","unstructured":"Guo D, Hu X, Xie F, Wu X (2013) Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl Intell 39(1):57\u201374. https:\/\/doi.org\/10.1007\/S10489-012-0394-4","journal-title":"Appl Intell"},{"key":"1110_CR43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences\u2014computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997a) Algorithms on strings, trees, and sequences\u2014computer science and computational biology. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511574931"},{"issue":"4","key":"1110_CR44","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/270563.571472","volume":"28","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997b) Algorithms on stings, trees, and sequences: computer science and computational biology. SIGACT News 28(4):41\u201360. https:\/\/doi.org\/10.1145\/270563.571472","journal-title":"SIGACT News"},{"key":"1110_CR45","doi-asserted-by":"publisher","unstructured":"Hajiaghayi M, Saleh H, Seddighin S, Sun X (2021) String matching with wildcards in the massively parallel computation model. In: Agrawal K, Azar Y (eds) SPAA \u201921: 33rd ACM symposium on parallelism in algorithms and architectures, virtual event, USA, 6\u20138 July, 2021. ACM, pp 275\u2013284. https:\/\/doi.org\/10.1145\/3409964.3461793","DOI":"10.1145\/3409964.3461793"},{"issue":"4","key":"1110_CR46","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/356827.356830","volume":"12","author":"PAV Hall","year":"1980","unstructured":"Hall PAV, Dowling GR (1980) Approximate string matching. ACM Comput Surv 12(4):381\u2013402. https:\/\/doi.org\/10.1145\/356827.356830","journal-title":"ACM Comput Surv"},{"issue":"2","key":"1110_CR47","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/380995.381002","volume":"2","author":"J Han","year":"2000","unstructured":"Han J, Pei J (2000) Mining frequent patterns by pattern-growth: methodology and implications. SIGKDD Explor 2(2):14\u201320. https:\/\/doi.org\/10.1145\/380995.381002","journal-title":"SIGKDD Explor"},{"key":"1110_CR48","unstructured":"Han J, Gong W, Yin Y (1998) Mining segment-wise periodic patterns in time-related databases. In: Agrawal R, Stolorz PE, Piatetsky-Shapiro G (eds) Proceedings of the fourth international conference on knowledge discovery and data mining (KDD-98), New York City, New York, USA, August 27\u201331, 1998. AAAI Press, pp 214\u2013218. http:\/\/www.aaai.org\/Library\/KDD\/1998\/kdd98-036.php"},{"key":"1110_CR49","doi-asserted-by":"crossref","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: Proceedings 15th international conference on data engineering (Cat. No. 99CB36337). IEEE, pp 106\u2013115","DOI":"10.1109\/ICDE.1999.754913"},{"issue":"7","key":"1110_CR50","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/J.ESWA.2011.01.006","volume":"38","author":"T Hong","year":"2011","unstructured":"Hong T, Lee C, Wang S (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265. https:\/\/doi.org\/10.1016\/J.ESWA.2011.01.006","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1110_CR51","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1017\/S0956796802004410","volume":"13","author":"H Hosoya","year":"2003","unstructured":"Hosoya H, Pierce BC (2003) Regular expression pattern matching for XML. J Funct Progr 13(6):961\u20131004. https:\/\/doi.org\/10.1017\/S0956796802004410","journal-title":"J Funct Progr"},{"key":"1110_CR52","doi-asserted-by":"publisher","unstructured":"Hsueh S, Lin M, Chen C (2008) Mining negative sequential patterns for e-commerce recommendations. In: Proceedings of the 3rd IEEE Asia-Pacific services computing conference, APSCC 2008, Yilan, Taiwan, 9\u201312 December 2008. IEEE Computer Society, pp 1213\u20131218. https:\/\/doi.org\/10.1109\/APSCC.2008.183","DOI":"10.1109\/APSCC.2008.183"},{"issue":"6","key":"1110_CR53","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1109\/TKDE.2005.98","volume":"17","author":"K Huang","year":"2005","unstructured":"Huang K, Chang C (2005) SMCA: a general model for mining asynchronous periodic patterns in temporal databases. IEEE Trans Knowl Data Eng 17(6):774\u2013785. https:\/\/doi.org\/10.1109\/TKDE.2005.98","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1110_CR54","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/J.IS.2007.07.003","volume":"33","author":"K Huang","year":"2008","unstructured":"Huang K, Chang C (2008) Efficient mining of frequent episodes from complex sequences. Inf Syst 33(1):96\u2013114. https:\/\/doi.org\/10.1016\/J.IS.2007.07.003","journal-title":"Inf Syst"},{"key":"1110_CR55","doi-asserted-by":"publisher","unstructured":"Huang K, Chang C, Lin K (2004) PROWL: an efficient frequent continuity mining algorithm on event sequences. In: Kambayashi Y, Mohania MK, W\u00f6\u00df W (eds) Data warehousing and knowledge discovery, 6th international conference, DaWaK 2004, Zaragoza, Spain, September 1\u20133, 2004, proceedings. Lecture notes in computer science, vol 3181. Springer, pp 351\u2013360. https:\/\/doi.org\/10.1007\/978-3-540-30076-2_35","DOI":"10.1007\/978-3-540-30076-2_35"},{"issue":"2","key":"1110_CR56","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/3589275","volume":"1","author":"S Huang","year":"2023","unstructured":"Huang S, Zhu E, Chaudhuri S, Spiegelberg L (2023) T-ReX: optimizing pattern search on time series. Proc ACM Manag Data 1(2):130\u2013113026. https:\/\/doi.org\/10.1145\/3589275","journal-title":"Proc ACM Manag Data"},{"key":"1110_CR57","doi-asserted-by":"publisher","unstructured":"Iwanuma K, Takano Y, Nabeshima H (2004) On anti-monotone frequency measures for extracting sequential patterns from a single very-long data sequence. In: IEEE conference on cybernetics and intelligent systems, 2004, vol 1. IEEE, pp 213\u20132171. https:\/\/doi.org\/10.1109\/ICCIS.2004.1460414","DOI":"10.1109\/ICCIS.2004.1460414"},{"key":"1110_CR580","unstructured":"Joshi M, Karypis G, Kumar V (1999) A universal formulation of sequential patterns. Technical Report No. 99-21, University of Minnesota, Minneapolis"},{"key":"1110_CR58","doi-asserted-by":"crossref","unstructured":"Jun C, Chi C (2014) Design of complex event-processing IDs in internet of things. In: 2014 sixth international conference on measuring technology and mechatronics automation. IEEE, pp 226\u2013229","DOI":"10.1109\/ICMTMA.2014.57"},{"key":"1110_CR59","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/J.JSS.2015.10.035","volume":"112","author":"RU Kiran","year":"2016","unstructured":"Kiran RU, Kitsuregawa M, Reddy PK (2016) Efficient discovery of periodic-frequent patterns in very large databases. J Syst Softw 112:110\u2013121. https:\/\/doi.org\/10.1016\/J.JSS.2015.10.035","journal-title":"J Syst Softw"},{"key":"1110_CR60","unstructured":"Kolchinsky I (2020) OpenCEP. https:\/\/github.com\/ilya-kolchinsky\/OpenCEP"},{"issue":"2","key":"1110_CR61","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/1025045","volume":"25","author":"JB Kruskal","year":"1983","unstructured":"Kruskal JB (1983) An overview of sequence comparison: time warps, string edits, and macromolecules. SIAM Rev 25(2):201\u2013237. https:\/\/doi.org\/10.1137\/1025045","journal-title":"SIAM Rev"},{"key":"1110_CR62","unstructured":"Laxman S (2008) Discovering frequent episodes: fast algorithms, connections with HMMs and generalizations. PhD thesis"},{"issue":"11","key":"1110_CR63","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1109\/TKDE.2005.181","volume":"17","author":"S Laxman","year":"2005","unstructured":"Laxman S, Sastry PS, Unnikrishnan KP (2005) Discovering frequent episodes and learning hidden Markov models: a formal connection. IEEE Trans Knowl Data Eng 17(11):1505\u20131517. https:\/\/doi.org\/10.1109\/TKDE.2005.181","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1110_CR64","unstructured":"Levenshtein VI et al (1966) Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady, vol 10. Soviet Union, pp 707\u2013710. https:\/\/nymity.ch\/sybilhunting\/pdf\/Levenshtein1966a.pdf"},{"issue":"4","key":"1110_CR65","doi-asserted-by":"publisher","first-page":"397","DOI":"10.14778\/3025111.3025121","volume":"10","author":"Z Li","year":"2016","unstructured":"Li Z, Ge T (2016) History is a mirror to the future: best-effort approximate complex event matching with insufficient resources. Proc VLDB Endow 10(4):397\u2013408. https:\/\/doi.org\/10.14778\/3025111.3025121","journal-title":"Proc VLDB Endow"},{"key":"1110_CR66","doi-asserted-by":"publisher","unstructured":"Liu M, Rundensteiner EA, Greenfield K, Gupta C, Wang S, Ari I, Mehta A (2011) E-cube: multi-dimensional event sequence analysis using hierarchical pattern query sharing. In: Sellis TK, Miller RJ, Kementsietsidis A, Velegrakis Y (eds) Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2011, Athens, Greece, June 12\u201316, 2011. ACM, pp 889\u2013900. https:\/\/doi.org\/10.1145\/1989323.1989416","DOI":"10.1145\/1989323.1989416"},{"key":"1110_CR67","doi-asserted-by":"publisher","unstructured":"Luo J, Bridges S (2000) Mining fuzzy association rules and fuzzy frequency episodes for intrusion detection. Int J Intell Syst 15(8):687\u2013703. https:\/\/doi.org\/10.1002\/1098-111X(200008)15:8<687::AID-INT1>3.0.CO;2-X","DOI":"10.1002\/1098-111X(200008)15:8<687::AID-INT1>3.0.CO;2-X"},{"key":"1110_CR68","doi-asserted-by":"publisher","unstructured":"Maggi FM, Mooij AJ, Aalst WMP (2011) User-guided discovery of declarative process models. In: Proceedings of the IEEE symposium on computational intelligence and data mining, CIDM 2011, part of the IEEE symposium series on computational intelligence 2011, April 11\u201315, 2011, Paris, France. IEEE, pp 192\u2013199. https:\/\/doi.org\/10.1109\/CIDM.2011.5949297","DOI":"10.1109\/CIDM.2011.5949297"},{"key":"1110_CR69","doi-asserted-by":"publisher","unstructured":"Maggi FM, Bose RPJC, Aalst WMP (2012) Efficient discovery of understandable declarative process models from event logs. In: Ralyt\u00e9 J, Franch X, Brinkkemper S, Wrycza S (eds) Advanced information systems engineering\u201424th international conference, CAiSE 2012, Gdansk, Poland, June 25\u201329, 2012. Proceedings. Lecture notes in computer science, vol 7328. Springer, pp 270\u2013285. https:\/\/doi.org\/10.1007\/978-3-642-31095-9_18","DOI":"10.1007\/978-3-642-31095-9_18"},{"key":"1110_CR70","doi-asserted-by":"publisher","unstructured":"Ma S, Hellerstein JL (2001) Mining partially periodic event patterns with unknown periods. In: Georgakopoulos D, Buchmann A (eds) Proceedings of the 17th international conference on data engineering, April 2\u20136, 2001, Heidelberg, Germany. IEEE Computer Society, pp 205\u2013214. https:\/\/doi.org\/10.1109\/ICDE.2001.914829","DOI":"10.1109\/ICDE.2001.914829"},{"key":"1110_CR71","unstructured":"Mannila H, Toivonen H (1996) Discovering generalized episodes using minimal occurrences. In: Simoudis E, Han J, Fayyad UM (eds) Proceedings of the second international conference on knowledge discovery and data mining (KDD-96), Portland, Oregon, USA. AAAI Press, pp 146\u2013151. http:\/\/www.aaai.org\/Library\/KDD\/1996\/kdd96-024.php"},{"issue":"3","key":"1110_CR72","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1(3):259\u2013289. https:\/\/doi.org\/10.1023\/A:1009748302351","journal-title":"Data Min Knowl Discov"},{"issue":"9","key":"1110_CR73","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/34.232078","volume":"15","author":"A Marzal","year":"1993","unstructured":"Marzal A, Vidal E (1993) Computation of normalized edit distance and applications. IEEE Trans Pattern Anal Mach Intell 15(9):926\u2013932. https:\/\/doi.org\/10.1109\/34.232078","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1110_CR74","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3229092","author":"I Mavroudopoulos","year":"2022","unstructured":"Mavroudopoulos I, Gounaris A (2022) SIESTA: a scalable infrastructure of sequential pattern analysis. IEEE Trans Big Data. https:\/\/doi.org\/10.1109\/TBDATA.2022.3229092","journal-title":"IEEE Trans Big Data"},{"key":"1110_CR75","doi-asserted-by":"publisher","unstructured":"Mavroudopoulos I, Gounaris A (2024) A comprehensive scalable framework for cloud-native pattern detection with enhanced expressiveness. CoRR https:\/\/doi.org\/10.48550\/ARXIV.2401.09960. arXiv:2401.09960","DOI":"10.48550\/ARXIV.2401.09960"},{"key":"1110_CR76","doi-asserted-by":"publisher","unstructured":"Mavroudopoulos I, Toliopoulos T, Bellas C, Kosmatopoulos A, Gounaris A (2021) Sequence detection in event log files. In: Velegrakis Y, Zeinalipour-Yazti D, Chrysanthis PK, Guerra F (eds) Proceedings of the 24th international conference on extending database technology, EDBT 2021, Nicosia, Cyprus, March 23\u201326, 2021. OpenProceedings.org, pp 85\u201396. https:\/\/doi.org\/10.5441\/002\/EDBT.2021.09","DOI":"10.5441\/002\/EDBT.2021.09"},{"key":"1110_CR77","doi-asserted-by":"publisher","unstructured":"Mei Y, Madden S (2009) Zstream: a cost-based query processor for adaptively detecting composite events. In: \u00c7etintemel U, Zdonik SB, Kossmann D, Tatbul N (eds) Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2009, Providence, Rhode Island, USA, June 29\u2013July 2, 2009. ACM, pp 193\u2013206. https:\/\/doi.org\/10.1145\/1559845.1559867","DOI":"10.1145\/1559845.1559867"},{"key":"1110_CR78","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The definition of standard ML: revised","author":"R Milner","year":"1997","unstructured":"Milner R (1997) The definition of standard ML: revised. MIT Press, Cambridge"},{"key":"1110_CR79","unstructured":"Minnila H (1995) Discovering frequent episodes in sequences. In: KDD-95 proceedings. First international conference on knowledge discovery and data mining, pp 210\u2013215"},{"issue":"2","key":"1110_CR80","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2431211.2431218","volume":"45","author":"C Mooney","year":"2013","unstructured":"Mooney C, Roddick JF (2013) Sequential pattern mining\u2014approaches and algorithms. ACM Comput Surv 45(2):19\u201311939. https:\/\/doi.org\/10.1145\/2431211.2431218","journal-title":"ACM Comput Surv"},{"key":"1110_CR81","doi-asserted-by":"publisher","unstructured":"Munoz-Gama J (2016) Conformance checking and diagnosis in process mining\u2014comparing observed and modeled processes. Lecture notes in business information processing, vol 270. https:\/\/doi.org\/10.1007\/978-3-319-49451-7","DOI":"10.1007\/978-3-319-49451-7"},{"issue":"1","key":"1110_CR82","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0092-8240(89)80046-1","volume":"51","author":"EW Myers","year":"1989","unstructured":"Myers EW, Miller W (1989) Approximate matching of regular expressions. Bull Math Biol 51(1):5\u201337. https:\/\/doi.org\/10.1016\/S0092-8240(89)80046-1","journal-title":"Bull Math Biol"},{"issue":"1","key":"1110_CR83","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388. https:\/\/doi.org\/10.1145\/375360.375365","journal-title":"ACM Comput Surv"},{"issue":"3","key":"1110_CR84","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48(3):443\u2013453. https:\/\/doi.org\/10.1016\/0022-2836(70)90057-4","journal-title":"J Mol Biol"},{"key":"1110_CR85","doi-asserted-by":"publisher","unstructured":"Neumann A, Seidl H (1998) Locating matches of tree patterns in forests. In: Arvind V, Ramanujam R (eds) Foundations of Software Technology and theoretical computer science, 18th conference, Chennai, India, December 17\u201319, 1998, Proceedings. Lecture notes in computer science, vol 1530. Springer, pp 134\u2013145. https:\/\/doi.org\/10.1007\/978-3-540-49382-2_12","DOI":"10.1007\/978-3-540-49382-2_12"},{"key":"1110_CR86","doi-asserted-by":"publisher","unstructured":"Ng A, Fu AW (2003) Mining frequent episodes for relating financial events and stock trends. In: Whang K, Jeon J, Shim K, Srivastava J (eds) Advances in knowledge discovery and data mining, 7th Pacific-Asia conference, PAKDD 2003, Seoul, Korea, April 30\u2013May 2, 2003, proceedings. Lecture notes in computer science, vol 2637. Springer, pp 27\u201339. https:\/\/doi.org\/10.1007\/3-540-36175-8_4","DOI":"10.1007\/3-540-36175-8_4"},{"issue":"3","key":"1110_CR87","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0020-0255(86)90061-7","volume":"40","author":"BJ Oommen","year":"1986","unstructured":"Oommen BJ (1986) Constrained string editing. Inf Sci 40(3):267\u2013284. https:\/\/doi.org\/10.1016\/0020-0255(86)90061-7","journal-title":"Inf Sci"},{"key":"1110_CR88","doi-asserted-by":"publisher","DOI":"10.1002\/WIDM.1524","author":"O Ouarem","year":"2024","unstructured":"Ouarem O, Nouioua F, Fournier-Viger P (2024) A survey of episode mining. WIREs Data Min Knowl Discov. https:\/\/doi.org\/10.1002\/WIDM.1524","journal-title":"WIREs Data Min Knowl Discov"},{"key":"1110_CR89","doi-asserted-by":"publisher","unstructured":"Ouyang W, Huang Q, Luo S (2008) Mining positive and negative fuzzy sequential patterns in large transaction databases. In: Ma J, Yin Y, Yu J, Zhou S (eds) Fifth international conference on fuzzy systems and knowledge discovery, FSKD 2008, 18\u201320 October 2008, Jinan, Shandong, China, proceedings, vol 5. IEEE Computer Society, pp 18\u201323. https:\/\/doi.org\/10.1109\/FSKD.2008.245","DOI":"10.1109\/FSKD.2008.245"},{"key":"1110_CR90","doi-asserted-by":"crossref","unstructured":"Ozden B, Ramaswamy S, Silberschatz A (1998) Cyclic association rules. In: Proceedings 14th international conference on data engineering. IEEE, pp 412\u2013421","DOI":"10.1109\/ICDE.1998.655804"},{"key":"1110_CR91","doi-asserted-by":"publisher","unstructured":"Papazoglou MP (2011) Making business processes compliant to standards and regulations. In: Proceedings of the 15th IEEE international enterprise distributed object computing conference, EDOC 2011, Helsinki, Finland, August 29\u2013September 2, 2011. IEEE Computer Society, pp 3\u201313. https:\/\/doi.org\/10.1109\/EDOC.2011.37","DOI":"10.1109\/EDOC.2011.37"},{"key":"1110_CR92","doi-asserted-by":"publisher","unstructured":"Peeva V, Mannel LL, Aalst WMP (2022) From place nets to local process models. In: Bernardinello L, Petrucci L (eds) Application and theory of petri nets and concurrency\u201443rd international conference, PETRI NETS 2022, Bergen, Norway, June 19\u201324, 2022, proceedings. Lecture notes in computer science, vol 13288. Springer, pp 346\u2013368. https:\/\/doi.org\/10.1007\/978-3-031-06653-5_18","DOI":"10.1007\/978-3-031-06653-5_18"},{"key":"1110_CR93","doi-asserted-by":"publisher","unstructured":"Pei J, Han J, Lakshmanan LVS (2001a) Mining frequent itemsets with convertible constraints. In: Proceedings 17th international conference on data engineering, pp 433\u2013442. https:\/\/doi.org\/10.1109\/ICDE.2001.914856","DOI":"10.1109\/ICDE.2001.914856"},{"key":"1110_CR94","doi-asserted-by":"publisher","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001b) PrefixSpan: mining sequential patterns by prefix-projected growth. In: Georgakopoulos D, Buchmann A (eds) Proceedings of the 17th international conference on data engineering, April 2\u20136, 2001, Heidelberg, Germany. IEEE Computer Society, pp 215\u2013224. https:\/\/doi.org\/10.1109\/ICDE.2001.914830","DOI":"10.1109\/ICDE.2001.914830"},{"key":"1110_CR95","doi-asserted-by":"publisher","unstructured":"Pei J, Han J, Wang W (2002) Mining sequential patterns with constraints in large databases. In: Proceedings of the 2002 ACM CIKM international conference on information and knowledge management, McLean, VA, USA, November 4\u20139, 2002. ACM, pp 18\u201325. https:\/\/doi.org\/10.1145\/584792.584799","DOI":"10.1145\/584792.584799"},{"issue":"3","key":"1110_CR96","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4C","volume":"8","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Lakshmanan LVS (2004) Pushing convertible constraints in frequent itemset mining. Data Min Knowl Discov 8(3):227\u2013252. https:\/\/doi.org\/10.1023\/B:DAMI.0000023674.74932.4C","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"1110_CR97","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/S10844-006-0006-Z","volume":"28","author":"J Pei","year":"2007","unstructured":"Pei J, Han J, Wang W (2007) Constraint-based sequential pattern mining: the pattern-growth methods. J Intell Inf Syst 28(2):133\u2013160. https:\/\/doi.org\/10.1007\/S10844-006-0006-Z","journal-title":"J Intell Inf Syst"},{"key":"1110_CR98","doi-asserted-by":"publisher","unstructured":"Pesic M, Aalst WMP (2006) A declarative approach for flexible business processes management. In: Eder J, Dustdar S (eds) Business process management workshops, BPM 2006 international workshops, BPD, BPI, ENEI, GPWW, DPM, Semantics4ws, Vienna, Austria, September 4\u20137, 2006, proceedings. Lecture notes in computer science, vol 4103. Springer, pp 169\u2013180. https:\/\/doi.org\/10.1007\/11837862_18","DOI":"10.1007\/11837862_18"},{"key":"1110_CR99","doi-asserted-by":"publisher","unstructured":"Pesic M, Schonenberg H, Aalst WMP (2007) DECLARE: full support for loosely-structured processes. In: 11th IEEE international enterprise distributed object computing conference (EDOC 2007), 15\u201319 October 2007, Annapolis, Maryland, USA. IEEE Computer Society, pp 287\u2013300. https:\/\/doi.org\/10.1109\/EDOC.2007.14","DOI":"10.1109\/EDOC.2007.14"},{"issue":"3","key":"1110_CR100","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson JL (1977) Petri nets. ACM Comput Surv 9(3):223\u2013252. https:\/\/doi.org\/10.1145\/356698.356702","journal-title":"ACM Comput Surv"},{"issue":"5","key":"1110_CR101","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1007\/S10618-016-0467-9","volume":"30","author":"F Petitjean","year":"2016","unstructured":"Petitjean F, Li T, Tatti N, Webb GI (2016) Skopus: mining top-k sequential patterns under leverage. Data Min Knowl Discov 30(5):1086\u20131111. https:\/\/doi.org\/10.1007\/S10618-016-0467-9","journal-title":"Data Min Knowl Discov"},{"issue":"9","key":"1110_CR102","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/S00607-018-0593-X","volume":"100","author":"M Polato","year":"2018","unstructured":"Polato M, Sperduti A, Burattin A, Leoni M (2018) Time and activity sequence prediction of business process instances. Computing 100(9):1005\u20131031. https:\/\/doi.org\/10.1007\/S00607-018-0593-X","journal-title":"Computing"},{"issue":"3","key":"1110_CR103","doi-asserted-by":"publisher","first-page":"319","DOI":"10.14778\/3632093.3632098","volume":"17","author":"WR Punter","year":"2023","unstructured":"Punter WR, Papapetrou O, Garofalakis MN (2023) OmniSketch: efficient multi-dimensional high-velocity stream analytics with arbitrary predicates. Proc VLDB Endow 17(3):319\u2013331","journal-title":"Proc VLDB Endow"},{"key":"1110_CR104","doi-asserted-by":"publisher","unstructured":"Rivetti N, Zacheilas N, Gal A, Kalogeraki V (2018) Probabilistic management of late arrival of events. In: Hinze A, Eyers DM, Hirzel M, Weidlich M, Bhowmik S (eds) Proceedings of the 12th ACM international conference on distributed and event-based systems, DEBS 2018, Hamilton, New Zealand, June 25\u201329, 2018. ACM, pp 52\u201363. https:\/\/doi.org\/10.1145\/3210284.3210293","DOI":"10.1145\/3210284.3210293"},{"issue":"6","key":"1110_CR105","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1007\/S10489-019-01616-Z","volume":"50","author":"Q Shi","year":"2020","unstructured":"Shi Q, Shan J, Yan W, Wu Y, Wu X (2020) Netnpg: nonoverlapping pattern matching with general gap constraints. Appl Intell 50(6):1832\u20131845. https:\/\/doi.org\/10.1007\/S10489-019-01616-Z","journal-title":"Appl Intell"},{"issue":"5","key":"1110_CR106","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1109\/TBDATA.2020.3047438","volume":"8","author":"A Slo","year":"2022","unstructured":"Slo A, Bhowmik S, Rothermel K (2022) State-aware load shedding from input event streams in complex event processing. IEEE Trans Big Data 8(5):1340\u20131357. https:\/\/doi.org\/10.1109\/TBDATA.2020.3047438","journal-title":"IEEE Trans Big Data"},{"issue":"6","key":"1110_CR107","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TKDE.2019.2897311","volume":"32","author":"JD Smedt","year":"2020","unstructured":"Smedt JD, Deeva G, Weerdt JD (2020) Mining behavioral sequence constraints for classification. IEEE Trans Knowl Data Eng 32(6):1130\u20131142. https:\/\/doi.org\/10.1109\/TKDE.2019.2897311","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1110_CR108","doi-asserted-by":"publisher","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Apers PMG, Bouzeghoub M, Gardarin G (eds) Advances in database technology\u2014EDBT\u201996, 5th international conference on extending database technology, Avignon, France, March 25\u201329, 1996, proceedings. Lecture notes in computer science, vol 1057. Springer, pp 3\u201317. https:\/\/doi.org\/10.1007\/BFB0014140","DOI":"10.1007\/BFB0014140"},{"key":"1110_CR109","doi-asserted-by":"publisher","unstructured":"Tanbeer SK, Ahmed CF, Jeong B, Lee Y (2009) Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong T, Kijsirikul B, Cercone N, Ho TB (eds) Advances in knowledge discovery and data mining, 13th Pacific-Asia conference, PAKDD 2009, Bangkok, Thailand, April 27\u201330, 2009, proceedings. Lecture notes in computer science, vol 5476. Springer, pp 242\u2013253. https:\/\/doi.org\/10.1007\/978-3-642-01307-2_24","DOI":"10.1007\/978-3-642-01307-2_24"},{"key":"1110_CR110","doi-asserted-by":"publisher","unstructured":"Tatti N, Vreeken J (2012) The long and the short of it: summarising event sequences with serial episodes. In: Yang Q, Agarwal D, Pei J (eds) The 18th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201912, Beijing, China, August 12\u201316, 2012. ACM, pp 462\u2013470. https:\/\/doi.org\/10.1145\/2339530.2339606","DOI":"10.1145\/2339530.2339606"},{"issue":"2","key":"1110_CR111","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/J.JIDES.2016.11.001","volume":"3","author":"N Tax","year":"2016","unstructured":"Tax N, Sidorova N, Haakma R, Aalst WMP (2016) Mining local process models. J Innov Digit Ecosyst 3(2):183\u2013196. https:\/\/doi.org\/10.1016\/J.JIDES.2016.11.001","journal-title":"J Innov Digit Ecosyst"},{"key":"1110_CR112","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/J.IS.2018.04.006","volume":"77","author":"N Tax","year":"2018","unstructured":"Tax N, Dalmas B, Sidorova N, Aalst WMP, Norre S (2018) Interest-driven discovery of local process models. Inf Syst 77:105\u2013117. https:\/\/doi.org\/10.1016\/J.IS.2018.04.006","journal-title":"Inf Syst"},{"key":"1110_CR113","unstructured":"Trino: Trino - MATCH_RECOGNIZE. https:\/\/trino.io\/docs\/current\/sql\/match-recognize.html. Accessed: 8 Apr 2024"},{"issue":"1","key":"1110_CR114","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TKDE.2003.1161581","volume":"15","author":"AKH Tung","year":"2003","unstructured":"Tung AKH, Lu H, Han J, Feng L (2003) Efficient mining of intertransaction association rules. IEEE Trans Knowl Data Eng 15(1):43\u201356. https:\/\/doi.org\/10.1109\/TKDE.2003.1161581","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"1110_CR115","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E (1995) On-line construction of suffix trees. Algorithmica 14(3):249\u2013260. https:\/\/doi.org\/10.1007\/BF01206331","journal-title":"Algorithmica"},{"issue":"3","key":"1110_CR116","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth MK, Haussler D (1984) On the complexity of iterated shuffle. J Comput Syst Sci 28(3):345\u2013358. https:\/\/doi.org\/10.1016\/0022-0000(84)90018-7","journal-title":"J Comput Syst Sci"},{"issue":"5","key":"1110_CR117","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/S11390-014-1464-3","volume":"29","author":"X Wu","year":"2014","unstructured":"Wu X, Qiang J, Xie F (2014a) Pattern matching with flexible wildcards. J Comput Sci Technol 29(5):740\u2013750. https:\/\/doi.org\/10.1007\/S11390-014-1464-3","journal-title":"J Comput Sci Technol"},{"issue":"1","key":"1110_CR118","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/S10489-013-0499-4","volume":"41","author":"Y Wu","year":"2014","unstructured":"Wu Y, Wang L, Ren J, Ding W, Wu X (2014b) Mining sequential patterns with periodic wildcard gaps. Appl Intell 41(1):99\u2013116. https:\/\/doi.org\/10.1007\/S10489-013-0499-4","journal-title":"Appl Intell"},{"issue":"10","key":"1110_CR119","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","volume":"48","author":"Y Wu","year":"2018","unstructured":"Wu Y, Tong Y, Zhu X, Wu X (2018) NOSEP: nonoverlapping sequence pattern mining with gap constraints. IEEE Trans Cybern 48(10):2809\u20132822. https:\/\/doi.org\/10.1109\/TCYB.2017.2750691","journal-title":"IEEE Trans Cybern"},{"issue":"11","key":"1110_CR120","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1007\/S10489-020-01778-1","volume":"50","author":"Y Wu","year":"2020","unstructured":"Wu Y, Fan J, Li Y, Guo L, Wu X (2020a) NetDAP: ($$\\delta$$, $$\\gamma$$) -approximate pattern matching with length constraints. Appl Intell 50(11):4094\u20134116. https:\/\/doi.org\/10.1007\/S10489-020-01778-1","journal-title":"Appl Intell"},{"key":"1110_CR121","doi-asserted-by":"publisher","DOI":"10.1016\/J.KNOSYS.2020.105812","volume":"196","author":"Y Wu","year":"2020","unstructured":"Wu Y, Zhu C, Li Y, Guo L, Wu X (2020b) NetNCSP: nonoverlapping closed sequential pattern mining. Knowl Based Syst 196:105812. https:\/\/doi.org\/10.1016\/J.KNOSYS.2020.105812","journal-title":"Knowl Based Syst"},{"key":"1110_CR122","doi-asserted-by":"publisher","first-page":"115449","DOI":"10.1016\/J.ESWA.2021.115449","volume":"184","author":"Y Wu","year":"2021","unstructured":"Wu Y, Lei R, Li Y, Guo L (2021) HAOP-Miner: self-adaptive high-average utility one-off sequential pattern mining. Expert Syst Appl 184:115449. https:\/\/doi.org\/10.1016\/J.ESWA.2021.115449","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1110_CR123","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3549940","volume":"17","author":"Y Wu","year":"2023","unstructured":"Wu Y, Chen M, Li Y, Liu J, Li Z, Li J, Wu X (2023) ONP-Miner: one-off negative sequential pattern mining. ACM Trans Knowl Discov Data 17(3):37\u201313724. https:\/\/doi.org\/10.1145\/3549940","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1110_CR124","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/J.KNOSYS.2016.10.011","volume":"115","author":"F Xie","year":"2017","unstructured":"Xie F, Wu X, Zhu X (2017) Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowl Based Syst 115:27\u201339. https:\/\/doi.org\/10.1016\/J.KNOSYS.2016.10.011","journal-title":"Knowl Based Syst"},{"key":"1110_CR125","doi-asserted-by":"publisher","unstructured":"Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large datasets. In: Barbar\u00e1 D, Kamath C (eds) Proceedings of the third SIAM international conference on data mining, San Francisco, CA, USA, May 1\u20133, 2003. SIAM, pp 166\u2013177. https:\/\/doi.org\/10.1137\/1.9781611972733.15","DOI":"10.1137\/1.9781611972733.15"},{"issue":"3","key":"1110_CR126","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TKDE.2003.1198394","volume":"15","author":"J Yang","year":"2003","unstructured":"Yang J, Wang W, Yu PS (2003) Mining asynchronous periodic patterns in time series data. IEEE Trans Knowl Data Eng 15(3):613\u2013628. https:\/\/doi.org\/10.1109\/TKDE.2003.1198394","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"Web\u2013Server\u2013Issu","key":"1110_CR127","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1093\/NAR\/GKL164","volume":"34","author":"J Ye","year":"2006","unstructured":"Ye J, McGinnis SD, Madden TL (2006) BLAST: improvements for better sequence analysis. Nucleic Acids Res 34(Web\u2013Server\u2013Issue):6\u20139. https:\/\/doi.org\/10.1093\/NAR\/GKL164","journal-title":"Nucleic Acids Res"},{"key":"1110_CR128","doi-asserted-by":"crossref","unstructured":"Yin J, Zheng Z, Cao L (2012) USpan: an efficient algorithm for mining high utility sequential patterns. In: Proceedings of the 18th ACM SIGKDD International conference on knowledge discovery and data mining, pp 660\u2013668","DOI":"10.1145\/2339530.2339636"},{"key":"1110_CR129","doi-asserted-by":"publisher","unstructured":"Yin J, Zheng Z, Cao L, Song Y, Wei W (2013) Efficiently mining top-k high utility sequential patterns. In: Xiong H, Karypis G, Thuraisingham B, Cook DJ, Wu X (eds) 2013 IEEE 13th international conference on data mining, Dallas, TX, USA, December 7\u201310, 2013. IEEE Computer Society, pp 1259\u20131264. https:\/\/doi.org\/10.1109\/ICDM.2013.148","DOI":"10.1109\/ICDM.2013.148"},{"issue":"8","key":"1110_CR130","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/J.IS.2012.01.002","volume":"38","author":"H Zhang","year":"2013","unstructured":"Zhang H, Diao Y, Immerman N (2013) Recognizing patterns in streams with imprecise timestamps. Inf Syst 38(8):1187\u20131211. https:\/\/doi.org\/10.1016\/J.IS.2012.01.002","journal-title":"Inf Syst"},{"key":"1110_CR131","doi-asserted-by":"crossref","unstructured":"Zhang H, Diao Y, Immerman N (2014) On complexity and optimization of expensive queries in complex event processing. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 217\u2013228","DOI":"10.1145\/2588555.2593671"},{"key":"1110_CR132","unstructured":"Zheng Z, Zhao Y, Zuo Z, Cao L (2009) Negative-gsp: An efficient method for mining negative sequential patterns. In: Kennedy PJ, Ong K, Christen P (eds) Eighth Australasian data mining conference, AusDM 2009, Melbourne, Australia, December 2009. CRPIT, vol 101. Australian Computer Society, pp 63\u201368. http:\/\/crpit.scem.westernsydney.edu.au\/abstracts\/CRPITV101Zheng.html"},{"key":"1110_CR133","unstructured":"Zhou Y, Ma C, Guo Q, Shou L, Chen G (2014) Sequence pattern matching over event data with temporal uncertainty. In: Proc. 17th international conference on extending database technology (EDBT), Athens, Greece, pp 205\u2013216"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01110-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01110-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01110-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:34:22Z","timestamp":1757183662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01110-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":134,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1110"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01110-w","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"38"}}