{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T12:27:34Z","timestamp":1745497654538,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10489-021-03000-2","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T04:43:13Z","timestamp":1643776993000},"page":"12155-12174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["NetDPO: (delta, gamma)-approximate pattern matching with gap constraints under one-off condition"],"prefix":"10.1007","volume":"52","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[]},{"given":"Lei","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"issue":"7","key":"3000_CR1","doi-asserted-by":"publisher","first-page":"4305","DOI":"10.1007\/s10489-020-02156-7","volume":"51","author":"M Liu","year":"2021","unstructured":"Liu M, Zhang Y, Xu J, Chen Y (2021) Deep bi-directional interaction network for sentence matching. Appl Intell 51(7):4305\u20134329","journal-title":"Appl Intell"},{"key":"3000_CR2","doi-asserted-by":"crossref","unstructured":"Dinh D T, Le B, Fournier-Viger P, Huynh V N (2018) An efficient algorithm for mining periodic high-utility sequential patterns. Appl Intell 48(12):4694\u20134714","DOI":"10.1007\/s10489-018-1227-x"},{"issue":"1","key":"3000_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-018-1282-y","volume":"58","author":"M Wu","year":"2019","unstructured":"Wu M, Wu X (2019) On big wisdom. Knowl Inf Syst 58(1):1\u20138","journal-title":"Knowl Inf Syst"},{"key":"3000_CR4","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhu C, Li Y, Guo L, Wu X (2020) NetNCSP: Nonoverlapping closed sequential pattern mining. Knowl-Based Syst 196(105812)","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"3000_CR5","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang S, Guo L, Liu J, Wu Y, Wu X (2021) NetNMSP: Nonoverlapping maximal sequential pattern mining. Applied Intelligence. DOI:","DOI":"10.1007\/s10489-021-02912-3"},{"issue":"10","key":"3000_CR6","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","journal-title":"IEEE Trans Cybern"},{"key":"3000_CR7","doi-asserted-by":"publisher","unstructured":"Wang Y, Wu Y, Li Y, Yao F, Fournier-Viger P, Wu X (2021) Self-adaptive nonoverlapping sequential pattern mining. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-021-02763-y","DOI":"10.1007\/s10489-021-02763-y"},{"issue":"1","key":"3000_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s41019-019-0090-z","volume":"4","author":"X Wang","year":"2019","unstructured":"Wang X, Chai L, Xu Q, Yang Y, Li J, Wang J, Chai Y (2019) Efficient subgraph matching on large RDF graphs using mapreduce. Data Sci Eng 4(1):24\u201343","journal-title":"Data Sci Eng"},{"key":"3000_CR9","doi-asserted-by":"crossref","unstructured":"Wu Y, Shen C, Jiang H, Wu X (2017) Strict pattern matching under non-overlapping condition. Sci China Inf Sci 60(1):012101","DOI":"10.1007\/s11432-015-0935-3"},{"issue":"4","key":"3000_CR10","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1007\/s10044-018-0733-0","volume":"21","author":"N Liu","year":"2018","unstructured":"Liu N, Xie F, Wu X (2018) Multi-pattern matching with variable-length wildcards using suffix tree. Pattern Anal Applic 21(4):1151\u20131165","journal-title":"Pattern Anal Applic"},{"issue":"5","key":"3000_CR11","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 (2014) Pattern matching with flexible wildcards. J Comput Sci Technol 29(5):740\u2013750","journal-title":"J Comput Sci Technol"},{"issue":"W1","key":"3000_CR12","doi-asserted-by":"publisher","first-page":"W507","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):W507\u2013W512","journal-title":"Nucleic Acids Res"},{"key":"3000_CR13","doi-asserted-by":"crossref","unstructured":"Wu Y, Geng M, Li Y, Guo L, Li Z, Fournier-Viger P, Zhu X, Wu X (2021) HANP-Miner: High average utility nonoverlapping sequential pattern mining. Knowl-Based Syst 229(107361)","DOI":"10.1016\/j.knosys.2021.107361"},{"key":"3000_CR14","doi-asserted-by":"publisher","unstructured":"Qiu P, Gong Y, Zhao Y, Cao L, Zhang C, Dong X (2021) An efficient method for modeling non-occurring behaviors by negative sequential patterns with loose constraints. IEEE Transactions on Neural Networks and Learning Systems. https:\/\/doi.org\/10.1109\/TNNLS.2021.3063162","DOI":"10.1109\/TNNLS.2021.3063162"},{"issue":"5","key":"3000_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3399671","volume":"14","author":"T Wang","year":"2020","unstructured":"Wang T, Duan L, Dong G, Bao Z (2020) Efficient mining of outlying sequence patterns for analyzing outlierness of sequence data. ACM Trans Knowl Discov Data 14(5):62","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"3000_CR16","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","journal-title":"Appl Intell"},{"issue":"6","key":"3000_CR17","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","journal-title":"Appl Intell"},{"issue":"11","key":"3000_CR18","first-page":"3331","volume":"32","author":"Y Wu","year":"2021","unstructured":"Wu Y, Liu X, Yan W, Guo L, Wu X (2021) Efficient algorithm for solving strict pattern matching under nonoverlapping condition. J Softw 32(11):3331\u20133350","journal-title":"J Softw"},{"issue":"5","key":"3000_CR19","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1177\/0165551515603286","volume":"42","author":"Y Wu","year":"2016","unstructured":"Wu Y, Tang Z, Jiang H, Wu X (2016) Approximate pattern matching with gap constraints. J Inf Sci 42(5):639\u2013658","journal-title":"J Inf Sci"},{"key":"3000_CR20","doi-asserted-by":"publisher","first-page":"24350","DOI":"10.1109\/ACCESS.2018.2832209","volume":"6","author":"Y Wu","year":"2018","unstructured":"Wu Y, Li S, Liu J, Guo L, Wu X (2018) NetASPNO: Approximate strict pattern matching under nonoverlapping condition. IEEE Access 6:24350\u201324361","journal-title":"IEEE Access"},{"key":"3000_CR21","doi-asserted-by":"crossref","unstructured":"Clifford P, Clifford R, Iliopoulos C (2005) Faster algorithms for delta, gamma-matching and related problems. In: Annual symposium on combinatorial pattern matching. Springer, Berlin, pp 68\u201378","DOI":"10.1007\/11496656_7"},{"key":"3000_CR22","doi-asserted-by":"crossref","unstructured":"Lee I, Mendivelso J, Pinz\u00f3n YJ (2008) Delta gamma\u2013parameterized matching. In International Symposium on String Processing and Information Retrieval, pp 236\u2013248","DOI":"10.1007\/978-3-540-89097-3_23"},{"key":"3000_CR23","unstructured":"Ardila Y J P, Christodoulakis M, Iliopoulos C S, Mohamed M (2005) Efficient (delta, gamma)-pattern-matching with don\u2018t cares. In: Proceeding the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA), Ballarat, pp 27\u201338"},{"issue":"11","key":"3000_CR24","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 (2020) NetDAP: (delta, gamma)-Approximate pattern matching with length constraints. Appl Intell 50(11):4094\u20134116","journal-title":"Appl Intell"},{"issue":"2","key":"3000_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin J, Keogh E, Wei L, Lonardi S (2007) Experiencing SAX: a novel symbolic representation of time series. Data Min Knowl Disc 15(2):107\u2013144","journal-title":"Data Min Knowl Disc"},{"key":"3000_CR26","doi-asserted-by":"publisher","unstructured":"Qiang J, Qian Z, Li Y, Yuan Y, Wu X (2020) Short text topic modeling techniques, applications, and performance: a survey. IEEE Transactions on Knowledge and Data Engineering (TKDE). https:\/\/doi.org\/10.1109\/TKDE.2020.2992485","DOI":"10.1109\/TKDE.2020.2992485"},{"issue":"4","key":"3000_CR27","doi-asserted-by":"publisher","first-page":"829","DOI":"10.3233\/IDA-173435","volume":"22","author":"H Liu","year":"2018","unstructured":"Liu H, Wang L, Liu Z, Zhao P, Wu X (2018) Efficient pattern matching with periodical wildcards in uncertain sequences. Intell Data Anal 22(4):829\u2013842","journal-title":"Intell Data Anal"},{"issue":"1","key":"3000_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/09298215.2015.1132737","volume":"45","author":"K Siedenburg","year":"2016","unstructured":"Siedenburg K, Ichiro F, Stephen M (2016) A comparison of approaches to timbre descriptors in music information retrieval and music psychology. J Music Res 45(1):27\u201341","journal-title":"J Music Res"},{"issue":"5","key":"3000_CR29","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TSC.2016.2560165","volume":"9","author":"L Nie","year":"2016","unstructured":"Nie L, Jiang H, Ren Z, Sun Z, Li X (2016) Query expansion based on crowd knowledge for code search. IEEE Trans Serv Comput 9(5):771\u2013783","journal-title":"IEEE Trans Serv Comput"},{"issue":"2","key":"3000_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3106164","volume":"18","author":"H Jiang","year":"2018","unstructured":"Jiang H, Chen X, He T, Chen Z, Li X (2018) Fuzzy clustering of crowdsourced test reports for apps. ACM Trans Internet Technol 18(2):1\u201328","journal-title":"ACM Trans Internet Technol"},{"issue":"5","key":"3000_CR31","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1109\/JBHI.2015.2453478","volume":"20","author":"S Ghosh","year":"2016","unstructured":"Ghosh S, Feng M, Nguyen H, Li J (2016) Hypotension risk prediction via sequential contrast patterns of icu blood pressure. IEEE J Biomed Health Inf 20(5):1416\u20131426","journal-title":"IEEE J Biomed Health Inf"},{"issue":"3","key":"3000_CR32","doi-asserted-by":"publisher","first-page":"5905","DOI":"10.1007\/s10586-017-1671-0","volume":"22","author":"Y Wu","year":"2019","unstructured":"Wu Y, Wang Y, Liu J, Yu M, Liu J, Li Y (2019) Mining distinguishing subsequence patterns with nonoverlapping condition. Clust Comput 22(3):5905\u20135917","journal-title":"Clust Comput"},{"issue":"1","key":"3000_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40(1):29\u2013 43","journal-title":"Appl Intell"},{"issue":"1","key":"3000_CR34","doi-asserted-by":"publisher","first-page":"143","DOI":"10.3233\/IDA-163231","volume":"22","author":"W Song","year":"2018","unstructured":"Song W, Jiang B, Qiao Y (2018) Mining multi-relational high utility itemsets from star schemas. Intell Data Anal 22(1):143\u2013 165","journal-title":"Intell Data Anal"},{"issue":"1","key":"3000_CR35","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 (2014) Mining sequential patterns with periodic wildcard gaps. Appl Intell 41(1):99\u2013116","journal-title":"Appl Intell"},{"key":"3000_CR36","doi-asserted-by":"publisher","first-page":"4922","DOI":"10.1109\/ACCESS.2016.2593953","volume":"4","author":"C Tan","year":"2016","unstructured":"Tan C, Min F, Wang M, Zhang H, Zhang Z (2016) Discovering patterns with weak-wildcard gaps. IEEE Access 4:4922\u20134932","journal-title":"IEEE Access"},{"key":"3000_CR37","doi-asserted-by":"publisher","unstructured":"Wu Y, Wang Y, Li Y, Zhu X, Wu X (2021) Top-k self-adaptive contrast sequential pattern mining. IEEE Transactions on Cybernetics. https:\/\/doi.org\/10.1109\/TCYB.2021.3082114","DOI":"10.1109\/TCYB.2021.3082114"},{"issue":"4","key":"3000_CR38","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 A N, He Y (2006) Efficient string matching with wildcards and length constraints. Knowl Inf Syst 10(4):399\u2013419","journal-title":"Knowl Inf Syst"},{"key":"3000_CR39","doi-asserted-by":"crossref","unstructured":"Wu Y, Lei R, Li Y, Guo L, Wu X (2021) HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining. Expert Syst Appl 184(115449)","DOI":"10.1016\/j.eswa.2021.115449"},{"key":"3000_CR40","doi-asserted-by":"publisher","unstructured":"Wu Y, Wang X, Li Y, Guo L, Li Z, Zhang J, Wu X (2021) OWSP-Miner: Self-adaptive one-off weak-gap strong pattern mining. ACM Transactions on Management Information Systems. https:\/\/doi.org\/10.1145\/3476247","DOI":"10.1145\/3476247"},{"issue":"1","key":"3000_CR41","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","journal-title":"Appl Intell"},{"issue":"12","key":"3000_CR42","doi-asserted-by":"publisher","first-page":"7673","DOI":"10.1021\/acs.chemrev.6b00851","volume":"117","author":"M Krallinger","year":"2017","unstructured":"Krallinger M, Rabal O, Lourenco A, Oyarzabal J, Valencia A (2017) Information retrieval and text mining technologies for chemistry. Chem Rev 117(12):7673\u20137761","journal-title":"Chem Rev"},{"issue":"7","key":"3000_CR43","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1142\/S0129054117500307","volume":"28","author":"J Lin","year":"2017","unstructured":"Lin J, Jiang Y, Harner E J, Jiang B, Adjeroh D (2017) IDPM: An improved degenerate pattern matching algorithm for biological sequences. Int J Found Comput Sci 28(7):889\u2013914","journal-title":"Int J Found Comput Sci"},{"key":"3000_CR44","doi-asserted-by":"crossref","unstructured":"He D, Wu X, Zhu X (2007) SAIL-Approx: An efficient on-line algorithm for approximate pattern matching with wildcards and length constraints. IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2007), pp 151\u2013158","DOI":"10.1109\/BIBM.2007.48"},{"issue":"3","key":"3000_CR45","first-page":"800","volume":"33","author":"G Huang","year":"2013","unstructured":"Huang G, Guo D, Hu X (2013) Algorithms for approximate pattern matching with wildcards and length constraints. J Comput Appl 33(3):800\u2013805","journal-title":"J Comput Appl"},{"issue":"2","key":"3000_CR46","first-page":"108","volume":"7","author":"KK Yip","year":"2015","unstructured":"Yip K K, Nembhard D A (2015) Mining approximate sequential patterns with gaps. Int J Data Min Modell Manag 7(2):108\u2013129","journal-title":"Int J Data Min Modell Manag"},{"key":"3000_CR47","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.ins.2015.04.018","volume":"329","author":"S Miao","year":"2016","unstructured":"Miao S, Vespier U, Cachucho R, Meeng M, Knobbe A (2016) Predefined pattern detection in large time series. Inf Sci 329:950\u2013964","journal-title":"Inf Sci"},{"issue":"3","key":"3000_CR48","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/s11390-017-1746-7","volume":"32","author":"Y Wu","year":"2017","unstructured":"Wu Y, Liu D, Jiang H (2017) Length-changeable incremental extreme learning machine. J Comput Sci Technol 32(3):630\u2013 643","journal-title":"J Comput Sci Technol"},{"key":"3000_CR49","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.ins.2018.04.013","volume":"507","author":"F Min","year":"2020","unstructured":"Min F, Zhang Z, Zhai W, Shen R (2020) Frequent pattern discovery with tri-partition alphabets. Inf Sci 507:715\u2013732","journal-title":"Inf Sci"},{"key":"3000_CR50","doi-asserted-by":"publisher","unstructured":"Wu Y, Luo L, Li Y, Guo L, Fournier-Viger P, Zhu X, Wu X (2021) NTP-Miner: Nonoverlapping three-way sequential pattern mining. ACM Transactions on Knowledge Discovery from Data. https:\/\/doi.org\/10.1145\/3480245","DOI":"10.1145\/3480245"},{"key":"3000_CR51","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2021.07.091","volume":"579","author":"S Cheng","year":"2021","unstructured":"Cheng S, Wu Y, Li Y, Yao F, Min F (2021) TWD-SFNN: Three-Way decisions with a single hidden layer feedforward neural network. Inf Sci 579:15\u201332","journal-title":"Inf Sci"},{"key":"3000_CR52","doi-asserted-by":"publisher","unstructured":"Zhang Z, Min F, Chen G, Shen S, Wen Z, Zhou X (2021) Tri-partition state alphabet-based sequential pattern for multivariate time series. Cognitive Computation. https:\/\/doi.org\/10.1007\/s12559-021-09871-4","DOI":"10.1007\/s12559-021-09871-4"},{"key":"3000_CR53","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ipl.2017.03.001","volume":"123","author":"P Zhang","year":"2017","unstructured":"Zhang P, Atallah M J (2017) On approximate pattern matching with thresholds. Inf Process Lett 123:21\u201326","journal-title":"Inf Process Lett"},{"issue":"3","key":"3000_CR54","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth M K, Haussler D (1984) On the complexity of iterated shuffle. Journal of Computer and System Sciences 28(3):345\u2013358","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"3000_CR55","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 A N, He Y (2006) Efficient string matching with wildcards and length constraints. Knowl Inf Syst 10(4):399\u2013419","journal-title":"Knowl Inf Syst"},{"key":"3000_CR56","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","journal-title":"Knowl-Based Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03000-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-03000-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-03000-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:15:50Z","timestamp":1663330550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-03000-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,2]]},"references-count":56,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3000"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-03000-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,2,2]]},"assertion":[{"value":"10 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}