{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:35:27Z","timestamp":1757612127852,"version":"3.44.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106175"],"award-info":[{"award-number":["62106175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10044-025-01505-x","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:38Z","timestamp":1750307138000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NEONATE: a bi-directional search strategy for non-overlapping pattern matching with gap constraint"],"prefix":"10.1007","volume":"28","author":[{"given":"Cong","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongyi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"issue":"1","key":"1505_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3314107","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 Recogn 1(1):54\u201377. https:\/\/doi.org\/10.1145\/3314107","journal-title":"Data Sci Pattern Recogn"},{"issue":"1","key":"1505_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/3597935","volume":"18","author":"C Zhang","year":"2024","unstructured":"Zhang C, Yang Y, Du Z, Gan W, Yu PS (2024) HUSP-SP: faster utility mining on sequence data. ACM Trans Knowl Discov Data 18(1):5\u20131521. https:\/\/doi.org\/10.1145\/3597935","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"5","key":"1505_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3643820","volume":"18","author":"AY Rodr\u00edguez-Gonz\u00e1lez","year":"2024","unstructured":"Rodr\u00edguez-Gonz\u00e1lez AY, Aranda R, \u00c1lvarez-Carmona M\u00c1, D\u00edaz-Pacheco A, Rosas RMV (2024) X-FSPMiner: a novel algorithm for frequent similar pattern mining. ACM Trans Knowl Discov Data 18(5):1\u201326. https:\/\/doi.org\/10.1145\/3643820","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"1505_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/3354187","volume":"37","author":"X Li","year":"2019","unstructured":"Li X, Han D, He J, Liao L, Wang M (2019) Next and next new POI recommendation via latent behavior pattern inference. ACM Trans Inf Syst 37(4):46\u201314628. https:\/\/doi.org\/10.1145\/3354187","journal-title":"ACM Trans Inf Syst"},{"issue":"3","key":"1505_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/3564280","volume":"41","author":"B Liang","year":"2023","unstructured":"Liang B, Meng X, Zhang Y (2023) Exploring time-aware multi-pattern group venue recommendation in LBSNs. ACM Trans Inf Syst 41(3):70\u201317031. https:\/\/doi.org\/10.1145\/3564280","journal-title":"ACM Trans Inf Syst"},{"key":"1505_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2021.116435","volume":"194","author":"M Karaca","year":"2022","unstructured":"Karaca M, Alvarado MM, Gahrooei MR, Bihorac A, Pardalos PM (2022) Frequent pattern mining from multivariate time series data. Expert Syst Appl 194:116435. https:\/\/doi.org\/10.1016\/J.ESWA.2021.116435","journal-title":"Expert Syst Appl"},{"key":"1505_CR7","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/J.FUTURE.2022.02.017","volume":"134","author":"F Lv","year":"2022","unstructured":"Lv F, Wang W, Han L, Wang D, Pei Y, Huang J, Wang B, Pechenizkiy M (2022) Mining trading patterns of pyramid schemes from financial time series data. Future Gener Comput Syst 134:388\u2013398. https:\/\/doi.org\/10.1016\/J.FUTURE.2022.02.017","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"1505_CR8","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TCBB.2018.2828313","volume":"17","author":"J Zhang","year":"2018","unstructured":"Zhang J, Guo J, Zhang M, Yu X, Yu X, Guo W, Zeng T, Chen L (2018) Efficient mining multi-mers in a variety of biological sequences. IEEE ACM Trans Comput Biol Bioinform 17(3):949\u2013958. https:\/\/doi.org\/10.1109\/TCBB.2018.2828313","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"1505_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/S11227-022-04673-3","volume":"79","author":"OAS Ibrahim","year":"2023","unstructured":"Ibrahim OAS, Hamed BA, El-Hafeez TA (2023) A new fast technique for pattern matching in biological sequences. J Supercomput 79(1):367\u2013388. https:\/\/doi.org\/10.1007\/S11227-022-04673-3","journal-title":"J Supercomput"},{"doi-asserted-by":"publisher","unstructured":"Xylogiannopoulos KF (2019) Exhaustive exact string matching: the analysis of the full human genome. In: ASONAM \u201919, pp 801\u2013808 https:\/\/doi.org\/10.1145\/3341161.3343517","key":"1505_CR10","DOI":"10.1145\/3341161.3343517"},{"issue":"2","key":"1505_CR11","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.32604\/CSSE.2023.025893","volume":"44","author":"S Sivanantham","year":"2023","unstructured":"Sivanantham S, Mohanraj V, Suresh Y, Senthilkumar J (2023) Association rule mining frequent-pattern-based intrusion detection in network. Comput Syst Sci Eng 44(2):1617\u20131631. https:\/\/doi.org\/10.32604\/CSSE.2023.025893","journal-title":"Comput Syst Sci Eng"},{"issue":"05","key":"1505_CR12","doi-asserted-by":"publisher","first-page":"1959016","DOI":"10.1142\/S021800141959016X","volume":"33","author":"X Jiang","year":"2019","unstructured":"Jiang X, Xu T, Dong X (2019) Campus data analysis based on positive and negative sequential patterns. Int J Pattern Recogn Artif Intell 33(05):1959016. https:\/\/doi.org\/10.1142\/S021800141959016X","journal-title":"Int J Pattern Recogn Artif Intell"},{"issue":"9","key":"1505_CR13","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1109\/TNNLS.2018.2886199","volume":"30","author":"X Dong","year":"2019","unstructured":"Dong X, Qiu P, L\u00fc J, Cao L, Xu T (2019) Mining top-k useful negative sequential patterns via learning. IEEE Trans Neural Netw Learn Syst 30(9):2764\u20132778. https:\/\/doi.org\/10.1109\/TNNLS.2018.2886199","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1505_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2023.119791","volume":"653","author":"K Hu","year":"2024","unstructured":"Hu K, Gan W, Huang S, Peng H, Fournier-Viger P (2024) Targeted mining of contiguous sequential patterns. Inf Sci 653:119791. https:\/\/doi.org\/10.1016\/J.INS.2023.119791","journal-title":"Inf Sci"},{"issue":"5","key":"1505_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/3639827","volume":"18","author":"G Huang","year":"2024","unstructured":"Huang G, Gan W, Yu PS (2024) TaSPM: Targeted sequential pattern mining. ACM Trans Knowl Discov Data 18(5):114\u2013111418. https:\/\/doi.org\/10.1145\/3639827","journal-title":"ACM Trans Knowl Discov Data"},{"doi-asserted-by":"publisher","unstructured":"Deutsch A, Francis N, Green A, Hare K, Li B, Libkin L, Lindaaker T, Marsault V, Martens W, Michels J (2022) Graph pattern matching in GQL and SQL\/PGQ. In: SIGMOD \u201922, pp 2246\u20132258. https:\/\/doi.org\/10.1145\/3514221.35260","key":"1505_CR16","DOI":"10.1145\/3514221.35260"},{"issue":"7","key":"1505_CR17","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.14778\/3587136.3587151","volume":"16","author":"W Martens","year":"2023","unstructured":"Martens W, Niewerth M, Popp T, Vansummeren S, Vrgoc D (2023) Representing paths in graph database pattern matching. Proc VLDB Endow 16(7):1790\u20131803. https:\/\/doi.org\/10.14778\/3587136.3587151","journal-title":"Proc VLDB Endow"},{"key":"1505_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2019.112950","volume":"141","author":"H Park","year":"2020","unstructured":"Park H, Jung J-Y (2020) SAX-ARM: deviant event pattern discovery from multivariate time series using symbolic aggregate approximation and association rule mining. Expert Syst Appl 141:112950. https:\/\/doi.org\/10.1016\/J.ESWA.2019.112950","journal-title":"Expert Syst Appl"},{"issue":"OOPSLA2","key":"1505_CR19","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1145\/3563342","volume":"6","author":"A Boruch-Gruszecki","year":"2022","unstructured":"Boruch-Gruszecki A, Wa\u015bko R, Xu Y, Parreaux L (2022) A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning. Proc ACM Program Lang 6(OOPSLA2):1526\u20131555. https:\/\/doi.org\/10.1145\/3563342","journal-title":"Proc ACM Program Lang"},{"issue":"7463","key":"1505_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1038\/nature12477","volume":"500","author":"LB Alexandrov","year":"2013","unstructured":"Alexandrov LB, Nik-Zainal S, Wedge DC, Aparicio SA, Behjati S, Biankin AV, Bignell GR, Bolli N, Borg A, B\u00f8rresen-Dale A-L (2013) Signatures of mutational processes in human cancer. Nature 500(7463):415\u2013421. https:\/\/doi.org\/10.1038\/nature12477","journal-title":"Nature"},{"doi-asserted-by":"publisher","unstructured":"Day JD, Kosche M, Manea F, Schmid ML (2022) Subsequences with gap constraints: complexity bounds for matching and analysis problems. In: ISAAC\u201922, Seoul, Korea, pp 64-16418. https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2022.64","key":"1505_CR21","DOI":"10.4230\/LIPICS.ISAAC.2022.64"},{"issue":"2","key":"1505_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3495214","volume":"13","author":"X Wu","year":"2022","unstructured":"Wu X, Zhu X, Wu M (2022) The evolution of search: three computing paradigms. ACM Trans Manage Inf Syst 13(2):1\u201320. https:\/\/doi.org\/10.1145\/3495214","journal-title":"ACM Trans Manage Inf Syst"},{"issue":"3","key":"1505_CR23","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/s10489-014-0612-3","volume":"42","author":"Y Wu","year":"2015","unstructured":"Wu Y, Fu S, Jiang H, Wu X (2015) Strict approximate pattern matching with general gaps. Appl Intell 42(3):566\u2013580.https:\/\/doi.org\/10.1007\/s10489-014-0612-3","journal-title":"Appl Intell"},{"issue":"1","key":"1505_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-015-0935-3","volume":"60","author":"Y Wu","year":"2017","unstructured":"Wu Y, Shen C, Jiang H, Wu X (2017) Strict pattern matching under non-overlapping condition. Sci China Inf Sci 60(1):1\u201316. https:\/\/doi.org\/10.1007\/s11432-015-0935-3","journal-title":"Sci China Inf Sci"},{"issue":"W1","key":"1505_CR25","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1093\/nar\/gkv435","volume":"43","author":"M Drory Retwitzer","year":"2015","unstructured":"Drory Retwitzer M, Polishchuk M, Churkin E, Kifer I, Yakhini Z, Barash D (2015) RNAPattMatch: a web server for RNA sequence\/structure motif detection based on pattern matching with flexible gaps. Nucleic Acids Res 43(W1):507\u2013512. https:\/\/doi.org\/10.1093\/nar\/gkv435","journal-title":"Nucleic Acids Res"},{"issue":"6","key":"1505_CR26","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G Navarro","year":"2003","unstructured":"Navarro G, Raffinot M (2003) Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J Comput Biol 10(6):903\u2013923. https:\/\/doi.org\/10.1089\/106652703322756140","journal-title":"J Comput Biol"},{"doi-asserted-by":"publisher","unstructured":"Ding B, Lo D, Han J, Khoo S-C (2009) Efficient mining of closed repetitive gapped subsequences from a sequence database. In: ICDE\u201909, pp. 1024\u20131035. IEEE Computer Society, Shanghai, China. https:\/\/doi.org\/10.1109\/ICDE.2009.104","key":"1505_CR27","DOI":"10.1109\/ICDE.2009.104"},{"issue":"9","key":"1505_CR28","doi-asserted-by":"publisher","first-page":"4874","DOI":"10.1109\/TKDE.2023.3334300","volume":"36","author":"M Geng","year":"2024","unstructured":"Geng M, Wu Y, Li Y, Liu J, Fournier-Viger P, Zhu X, Wu X (2024) RNP-Miner: repetitive nonoverlapping sequential pattern mining. IEEE Trans Knowl Data Eng 36(9):4874\u20134889. https:\/\/doi.org\/10.1109\/TKDE.2023.3334300","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1505_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/J.KNOSYS.2024.111449","volume":"287","author":"C Sun","year":"2024","unstructured":"Sun C, Gong Y, Guo Y, Zhao L, Guan H, Liu X, Dong X (2024) SN-RNSP: mining self-adaptive nonoverlapping repetitive negative sequential patterns in transaction sequences. Knowl Based Syst 287:111449. https:\/\/doi.org\/10.1016\/J.KNOSYS.2024.111449","journal-title":"Knowl Based Syst"},{"issue":"4","key":"1505_CR30","doi-asserted-by":"publisher","first-page":"3781","DOI":"10.1007\/s10489-021-02536-7","volume":"52","author":"SZ Ishita","year":"2022","unstructured":"Ishita SZ, Ahmed CF, Leung CK (2022) New approaches for mining regular high utility sequential patterns. Appl Intell 52(4):3781\u20133806. https:\/\/doi.org\/10.1007\/s10489-021-02536-7","journal-title":"Appl Intell"},{"key":"1505_CR31","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 (1991) An algorithm for string matching with a sequence of don\u2019t cares. Inf Process Lett 37:133\u2013136. https:\/\/doi.org\/10.1016\/0020-0190(91)90032-D","journal-title":"Inf Process Lett"},{"issue":"1","key":"1505_CR32","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/S00453-007-9141-3","volume":"55","author":"CS Iliopoulos","year":"2009","unstructured":"Iliopoulos CS, Rahman MS (2009) Indexing factors with gaps. Algorithmica 55(1):60\u201370. https:\/\/doi.org\/10.1007\/S00453-007-9141-3","journal-title":"Algorithmica"},{"issue":"6","key":"1505_CR33","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1109\/TCBB.2020.2980234","volume":"18","author":"Y-H Ke","year":"2021","unstructured":"Ke Y-H, Huang J-W, Lin W-C, Jaysawal BP (2021) Finding possible promoter binding sites in DNA sequences by sequential patterns mining with specific numbers of gaps. IEEE ACM Trans Comput Biol Bioinform 18(6):2459\u20132470. https:\/\/doi.org\/10.1109\/TCBB.2020.2980234","journal-title":"IEEE ACM Trans Comput BiolBioinform"},{"key":"1505_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.102088","volume":"100","author":"W Wang","year":"2021","unstructured":"Wang W, Tian J, Lv F, Xin G, Ma Y, Wang B (2021) Mining frequent pyramid patterns from time series transaction data with custom constraints. Comput Secur 100:102088. https:\/\/doi.org\/10.1016\/j.cose.2020.102088","journal-title":"Comput Secur"},{"unstructured":"Chen Z, Gan W, Huang G, Qi Z, Li Y, Yu PS (2023) TALENT: targeted mining of non-overlapping sequential patterns. ACM Trans Manage Inf Syst 1\u201328 (major revision). arXiv:2306.06470","key":"1505_CR35"},{"key":"1505_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2012.03.029","volume":"443","author":"P Bille","year":"2012","unstructured":"Bille P, G\u00f8rtz IL, Vildh\u00f8j HW, Wind DK (2012) String matching with variable length gaps. Theor Comput Sci 443:25\u201334. https:\/\/doi.org\/10.1016\/j.tcs.2012.03.029","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1505_CR37","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"},{"doi-asserted-by":"publisher","unstructured":"Dahiya A, Garg D (2014) Maximal pattern matching with flexible wildcard gaps and one-off constraint. In: ICACCI\u201914. IEEE, Delhi, India, pp 1107\u20131112. https:\/\/doi.org\/10.1109\/ICACCI.2014.6968285","key":"1505_CR38","DOI":"10.1109\/ICACCI.2014.6968285"},{"issue":"6","key":"1505_CR39","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.3233\/IDA-216325","volume":"26","author":"Y Wu","year":"2022","unstructured":"Wu Y, Jian B, Li Y, Jiang H, Wu X (2022) NetNDP: nonoverlapping (delta, gamma)-approximate pattern matching. Intell Data Anal 26(6):1661\u20131682. https:\/\/doi.org\/10.3233\/IDA-216325","journal-title":"Intell Data Anal"},{"issue":"2","key":"1505_CR40","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1504\/IJDMMM.2015.069249","volume":"7","author":"KK Yip","year":"2015","unstructured":"Yip KK, Nembhard DA (2015) Mining approximate sequential patterns with gaps. Int J Data Min Model Manage 7(2):108\u2013129. https:\/\/doi.org\/10.1504\/IJDMMM.2015.069249","journal-title":"Int J Data Min Model Manage"},{"doi-asserted-by":"publisher","unstructured":"Wu Y, Wu X, Jiang H, Min F (2010) A nettree for approximate maximal pattern matching with gaps and one-off constraint. In: 22nd IEEE international conference on tools with artificial intelligence, ICTAI 2010, Arras, France, 27\u201329 October 2010, vol 2, pp 38\u201341. https:\/\/doi.org\/10.1109\/ICTAI.2010.81","key":"1505_CR41","DOI":"10.1109\/ICTAI.2010.81"},{"issue":"2","key":"1505_CR42","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1267066.1267068","volume":"1","author":"M Zhang","year":"2007","unstructured":"Zhang M, Kao B, Cheung DW, Yip KY (2007) Mining periodic patterns with gap requirement from sequences. ACM Trans Knowl Discov Data 1(2):7. https:\/\/doi.org\/10.1145\/1267066.1267068","journal-title":"ACM Trans Knowl Discov Data"},{"unstructured":"Wang Z, Che M, Yang Y, Meng W, Li Q, Xia F, Li W (2022) Automatic Chinese national pentatonic modes recognition using convolutional neural network. In: ISMIR\u201922. ISMIR, Bengaluru, India, pp 345\u2013352. https:\/\/archives.ismir.net\/ismir2022\/paper\/000041.pdf","key":"1505_CR43"},{"key":"1505_CR44","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:1832\u20131845. https:\/\/doi.org\/10.1007\/s10489-019-01616-z","journal-title":"Appl Intell"},{"key":"1505_CR45","doi-asserted-by":"publisher","first-page":"17233","DOI":"10.1007\/s00500-020-05015-2","volume":"24","author":"A Jamshed","year":"2020","unstructured":"Jamshed A, Mallick B, Kumar P (2020) Deep learning-based sequential pattern mining for progressive database. Soft Comput 24:17233\u201317246. https:\/\/doi.org\/10.1007\/s00500-020-05015-2","journal-title":"Soft Comput"},{"issue":"9","key":"1505_CR46","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TC.2024.3416619","volume":"73","author":"J Li","year":"2024","unstructured":"Li J, Li Y, Song J, Zhang J, Zhang S (2024) Quantum support vector machine for classifying noisy data. IEEE Trans Comput 73(9):2233\u20132247. https:\/\/doi.org\/10.1109\/TC.2024.3416619","journal-title":"IEEE Trans Comput"},{"key":"1505_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2025.126536","volume":"270","author":"G Li","year":"2025","unstructured":"Li G, Xiang J, Fang W, Wang J, Shang T (2025) HUPSP-LAL: efficiently mining utility-driven sequential patterns in uncertain sequences. Expert Syst Appl 270:126536. https:\/\/doi.org\/10.1016\/J.ESWA.2025.126536","journal-title":"Expert Syst Appl"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-025-01505-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-025-01505-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-025-01505-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T07:16:11Z","timestamp":1756970171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-025-01505-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1505"],"URL":"https:\/\/doi.org\/10.1007\/s10044-025-01505-x","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"type":"print","value":"1433-7541"},{"type":"electronic","value":"1433-755X"}],"subject":[],"published":{"date-parts":[[2025,6,19]]},"assertion":[{"value":"20 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"127"}}