{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T15:17:01Z","timestamp":1771946221871,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A1515010242"],"award-info":[{"award-number":["2024A1515010242"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ipm.2026.104682","type":"journal-article","created":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T11:59:42Z","timestamp":1771934382000},"page":"104682","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["MNSPM: Merging-based nonoverlapping gap-constrained sequential pattern mining"],"prefix":"10.1016","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2207-0953","authenticated-orcid":false,"given":"Chunkai","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9223-8342","authenticated-orcid":false,"given":"Xiangrui","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Huaijin","family":"Hao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ipm.2026.104682_bib0001","first-page":"1","article-title":"Talent: Targeted mining of non-overlapping sequential patterns","volume":"16","author":"Chen","year":"2025","journal-title":"ACM Transactions on Management Information Systems"},{"key":"10.1016\/j.ipm.2026.104682_bib0002","series-title":"2009 IEEE 25th international conference on data engineering","first-page":"1024","article-title":"Efficient mining of closed repetitive gapped subsequences from a sequence database","author":"Ding","year":"2009"},{"key":"10.1016\/j.ipm.2026.104682_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.future.2025.107938","article-title":"Mining one-off high average utility episodes for process event logs","volume":"174","author":"Dong","year":"2026","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0004","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"Fournier-Viger","year":"2017","journal-title":"Data Science and Pattern Recognition"},{"issue":"3","key":"10.1016\/j.ipm.2026.104682_bib0005","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10115-014-0817-0","article-title":"Mining sequential patterns for classification","volume":"45","author":"Fradkin","year":"2015","journal-title":"Knowledge and Information Systems"},{"issue":"4","key":"10.1016\/j.ipm.2026.104682_bib0006","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10791-008-9054-z","article-title":"Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance","volume":"11","author":"Fredriksson","year":"2008","journal-title":"Information Retrieval"},{"issue":"9","key":"10.1016\/j.ipm.2026.104682_bib0007","doi-asserted-by":"crossref","first-page":"4874","DOI":"10.1109\/TKDE.2023.3334300","article-title":"Rnp-miner: Repetitive nonoverlapping sequential pattern mining","volume":"36","author":"Geng","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0008","doi-asserted-by":"crossref","first-page":"24","DOI":"10.5120\/21032-2939","article-title":"Customer purchasing behavior using sequential pattern mining technique","volume":"119","author":"Goel","year":"2015","journal-title":"International Journal of Computer Applications"},{"key":"10.1016\/j.ipm.2026.104682_bib0009","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"4098","article-title":"Complete closed time intervals-related patterns mining","volume":"vol. 35","author":"Harel","year":"2021"},{"key":"10.1016\/j.ipm.2026.104682_bib0010","series-title":"2021 IEEE International conference on big knowledge (ICBK)","first-page":"70","article-title":"Hsnp-miner: High utility self-adaptive nonoverlapping pattern mining","author":"Hossain","year":"2021"},{"key":"10.1016\/j.ipm.2026.104682_bib0011","series-title":"2009 International conference on computational science and engineering","first-page":"180","article-title":"Mining frequent patterns with gaps and one-off condition","volume":"vol. 1","author":"Huang","year":"2009"},{"issue":"4","key":"10.1016\/j.ipm.2026.104682_bib0012","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1007\/s11277-024-11605-2","article-title":"A systematic review on sequential pattern mining-types, algorithms and applications","volume":"138","author":"Jamshed","year":"2024","journal-title":"Wireless Personal Communications"},{"key":"10.1016\/j.ipm.2026.104682_bib0013","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.ins.2017.11.064","article-title":"Mining maximal frequent patterns in transactional databases and dynamic data streams: A spark-based approach","volume":"432","author":"Karim","year":"2018","journal-title":"Information Sciences"},{"key":"10.1016\/j.ipm.2026.104682_bib0014","series-title":"International conference on AI and OR techniques in constriant programming for combinatorial optimization problems","first-page":"198","article-title":"A global constraint for mining sequential patterns with gap constraint","author":"Kemmar","year":"2016"},{"issue":"3","key":"10.1016\/j.ipm.2026.104682_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104077","article-title":"Tk-rnsp: Efficient top-k repetitive negative sequential pattern mining","volume":"62","author":"Lan","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104682_bib0016","series-title":"Proceedings of the 7th international conference on future networks and distributed systems","first-page":"599","article-title":"Sequential pattern mining: A proposed approach for intrusion detection systems","author":"Lefoane","year":"2023"},{"key":"10.1016\/j.ipm.2026.104682_bib0017","series-title":"Proceedings of the 2008 SIAM international conference on data mining","first-page":"313","article-title":"Efficiently mining closed subsequences with gap constraints","author":"Li","year":"2008"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2133360.2133362","article-title":"Efficient mining of gap-constrained subsequences and its various applications","volume":"6","author":"Li","year":"2012","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"9","key":"10.1016\/j.ipm.2026.104682_bib0019","doi-asserted-by":"crossref","first-page":"9531","DOI":"10.1109\/TKDE.2023.3241213","article-title":"Mcor-miner: Maximal co-occurrence nonoverlapping sequential rule mining","volume":"35","author":"Li","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"10.1016\/j.ipm.2026.104682_bib0020","doi-asserted-by":"crossref","first-page":"9861","DOI":"10.1007\/s10489-021-02912-3","article-title":"NetNMSP: Nonoverlapping maximal sequential pattern mining","volume":"52","author":"Li","year":"2022","journal-title":"Applied Intelligence"},{"issue":"Suppl 4","key":"10.1016\/j.ipm.2026.104682_bib0021","doi-asserted-by":"crossref","DOI":"10.1186\/1752-0509-7-S4-S7","article-title":"Efficient mining gapped sequential patterns for motifs in biological sequences","volume":"7","author":"Liao","year":"2013","journal-title":"BMC Systems Biology"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0022","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1504\/IJFIPM.2012.050418","article-title":"The apriori property of sequence pattern mining with wildcard gaps","volume":"4","author":"Min","year":"2012","journal-title":"International Journal of Functional Informatics and Personalised Medicine"},{"key":"10.1016\/j.ipm.2026.104682_bib0023","series-title":"Proceedings of the 2016 SIAM international conference on data mining","first-page":"558","article-title":"Macfp: Maximal approximate consecutive frequent pattern mining under edit distance","author":"Shang","year":"2016"},{"issue":"6","key":"10.1016\/j.ipm.2026.104682_bib0024","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1007\/s10489-019-01616-z","article-title":"NetNPG: Nonoverlapping pattern matching with general gap constraints","volume":"50","author":"Shi","year":"2020","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.ipm.2026.104682_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111449","article-title":"Sn-rnsp: Mining self-adaptive nonoverlapping repetitive negative sequential patterns in transaction sequences","volume":"287","author":"Sun","year":"2024","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.ipm.2026.104682_bib0026","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ins.2021.01.060","article-title":"Efficient algorithms for mining frequent high utility sequences with constraints","volume":"568","author":"Truong","year":"2021","journal-title":"Information Sciences"},{"issue":"6","key":"10.1016\/j.ipm.2026.104682_bib0027","doi-asserted-by":"crossref","first-page":"6646","DOI":"10.1007\/s10489-021-02763-y","article-title":"Self-adaptive nonoverlapping sequential pattern mining","volume":"52","author":"Wang","year":"2022","journal-title":"Applied Intelligence"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0028","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1186\/1471-2105-8-396","article-title":"Large scale clustering of protein sequences with FORCE-a layout based heuristic for weighted cluster editing","volume":"8","author":"Wittkop","year":"2007","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"10.1016\/j.ipm.2026.104682_bib0029","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3549940","article-title":"Onp-miner: One-off negative sequential pattern mining","volume":"17","author":"Wu","year":"2023","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"10.1016\/j.ipm.2026.104682_bib0030","doi-asserted-by":"crossref","DOI":"10.1109\/TETC.2025.3607892","article-title":"Oer-miner: One-off episode rule mining for process event logs","author":"Wu","year":"2025","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"issue":"11","key":"10.1016\/j.ipm.2026.104682_bib0031","doi-asserted-by":"crossref","first-page":"4094","DOI":"10.1007\/s10489-020-01778-1","article-title":"NetDAP:(\u03b4, \u03b3)- approximate pattern matching with length constraints","volume":"50","author":"Wu","year":"2020","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.ipm.2026.104682_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107361","article-title":"Hanp-miner: High average utility nonoverlapping sequential pattern mining","volume":"229","author":"Wu","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.ipm.2026.104682_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115449","article-title":"Haop-miner: Self-adaptive high-average utility one-off sequential pattern mining","volume":"184","author":"Wu","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.1016\/j.ipm.2026.104682_bib0034","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1177\/0165551515603286","article-title":"Approximate pattern matching with gap constraints","volume":"42","author":"Wu","year":"2016","journal-title":"Journal of Information Science"},{"issue":"10","key":"10.1016\/j.ipm.2026.104682_bib0035","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-024-4496-9","article-title":"Oip-miner: One-off incremental sequential pattern mining with forgetting factor","volume":"68","author":"Wu","year":"2025","journal-title":"Science China Information Sciences"},{"issue":"10","key":"10.1016\/j.ipm.2026.104682_bib0036","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","article-title":"Nosep: Nonoverlapping sequence pattern mining with gap constraints","volume":"48","author":"Wu","year":"2017","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"10.1016\/j.ipm.2026.104682_bib0037","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10489-013-0499-4","article-title":"Mining sequential patterns with periodic wildcard gaps","volume":"41","author":"Wu","year":"2014","journal-title":"Applied Intelligence"},{"issue":"3","key":"10.1016\/j.ipm.2026.104682_bib0038","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3476247","article-title":"Owsp-miner: Self-adaptive one-off weak-gap strong pattern mining","volume":"13","author":"Wu","year":"2022","journal-title":"ACM Transactions on Management Information Systems (TMIS)"},{"key":"10.1016\/j.ipm.2026.104682_bib0039","series-title":"2010 IEEE International conference on information reuse & integration","first-page":"109","article-title":"A nettree for pattern matching with flexible wildcard constraints","author":"Wu","year":"2010"},{"key":"10.1016\/j.ipm.2026.104682_bib0040","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2021.12.064","article-title":"Nwp-miner: Nonoverlapping weak-gap sequential pattern mining","volume":"588","author":"Wu","year":"2022","journal-title":"Information Sciences"},{"key":"10.1016\/j.ipm.2026.104682_bib0041","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105812","article-title":"NetNCSP: Nonoverlapping closed sequential pattern mining","volume":"196","author":"Wu","year":"2020","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"10.1016\/j.ipm.2026.104682_bib0042","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1267066.1267068","article-title":"Mining periodic patterns with gap requirement from sequences","volume":"1","author":"Zhang","year":"2007","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"5","key":"10.1016\/j.ipm.2026.104682_bib0043","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/TKDE.2015.2510010","article-title":"Pattern based sequence classification","volume":"28","author":"Zhou","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326000737?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326000737?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T14:41:56Z","timestamp":1771944116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457326000737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0306457326000737"],"URL":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104682","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"MNSPM: Merging-based nonoverlapping gap-constrained sequential pattern mining","name":"articletitle","label":"Article Title"},{"value":"Information Processing & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104682","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104682"}}