{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:56:04Z","timestamp":1768553764977,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Polish high-performance computing infrastructure PLGrid","award":["PLG\/2023\/016386"],"award-info":[{"award-number":["PLG\/2023\/016386"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07165-2","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T21:59:34Z","timestamp":1743458374000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Boosting exact pattern matching with extreme gradient boosting (and more)"],"prefix":"10.1007","volume":"81","author":[{"given":"Robert","family":"Susik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,29]]},"reference":[{"issue":"2","key":"7165_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth DE, Morris JH Jr, Pratt VR (1977) Fast pattern matching in strings. SIAM J Comput 6(2):323\u2013350","journal-title":"SIAM J Comput"},{"issue":"10","key":"7165_CR2","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer RS, Moore JS (1977) A fast string searching algorithm. Commun ACM 20(10):762\u2013772","journal-title":"Commun ACM"},{"issue":"2","key":"7165_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp RM, Rabin MO (1987) Efficient randomized pattern-matching algorithms. IBM J Res Dev 31(2):249\u2013260","journal-title":"IBM J Res Dev"},{"issue":"7","key":"7165_CR4","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1002\/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D","volume":"27","author":"J Tarhio","year":"1997","unstructured":"Tarhio J, Peltola H (1997) String matching in the DNA alphabet. Softw Pract Exp 27(7):851\u2013861","journal-title":"Softw Pract Exp"},{"key":"7165_CR5","doi-asserted-by":"crossref","unstructured":"Zhang G, Zhu E, Mao L, Yin M (2009) A bit-parallel exact string matching algorithm for small alphabet. In: Frontiers in Algorithmics: Third International Workshop, FAW 2009, Hefei, China, June 20\u201323, 2009. Proceedings 3. Springer, pp 336\u2013345","DOI":"10.1007\/978-3-642-02270-8_34"},{"key":"7165_CR6","first-page":"1","volume":"9","author":"K Fredriksson","year":"2005","unstructured":"Fredriksson K, Navarro G (2005) Average-optimal single and multiple approximate string matching. J Exp Algorithmics (JEA) 9:1\u20134","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"12","key":"7165_CR7","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.ipl.2013.03.015","volume":"113","author":"M Kubica","year":"2013","unstructured":"Kubica M, Kulczy\u0144ski T, Radoszewski J, Rytter W, Wale\u0144 T (2013) A linear time algorithm for consecutive permutation pattern matching. Inf Process Lett 113(12):430\u2013433","journal-title":"Inf Process Lett"},{"key":"7165_CR8","doi-asserted-by":"crossref","unstructured":"Susik R, Grabowski S, Deorowicz S (2013) Fast and simple circular pattern matching. In: Proceedings of the International Conference on Man-Machine Interactions. Springer, Cham, pp 537\u2013544","DOI":"10.1007\/978-3-319-02309-0_59"},{"key":"7165_CR9","unstructured":"Susik R (2017) Applying a q-gram based multiple string matching algorithm for approximate matching. Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie \u015arodowiska 7"},{"key":"7165_CR10","unstructured":"Neerja M, Smyth WF (2020) Simple KMP pattern-matching on indeterminate strings. In: Proceedings of the Prague Stringology Conference 2020, Czech Technical University in Prague, Czech Republic, pp 125\u2013133"},{"key":"7165_CR11","doi-asserted-by":"crossref","unstructured":"Hajiaghayi M, Saleh H, Seddighin S, Sun X (2021) String matching with wildcards in the massively parallel computation model. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pp 275\u2013284","DOI":"10.1145\/3409964.3461793"},{"issue":"12","key":"7165_CR12","doi-asserted-by":"crossref","first-page":"17741","DOI":"10.1007\/s11227-024-06115-8","volume":"80","author":"R Susik","year":"2024","unstructured":"Susik R, Nowotniak R (2024) Pattern matching algorithms in blockchain for network fees reduction. J Supercomput 80(12):17741\u201317759","journal-title":"J Supercomput"},{"issue":"2","key":"7165_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S Faro","year":"2013","unstructured":"Faro S, Lecroq T (2013) The exact online string matching problem: a review of the most recent results. ACM Comput Surv (CSUR) 45(2):1\u201342","journal-title":"ACM Comput Surv (CSUR)"},{"key":"7165_CR14","volume-title":"Handbook of Exact String Matching Algorithms","author":"C Charras","year":"2004","unstructured":"Charras C, Lecroq T (2004) Handbook of Exact String Matching Algorithms. King\u2019s College Publications, London"},{"issue":"6","key":"7165_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"RN Horspool","year":"1980","unstructured":"Horspool RN (1980) Practical fast searching in strings. Softw-Pract Exp 10(6):501\u2013506","journal-title":"Softw-Pract Exp"},{"key":"7165_CR16","first-page":"412","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore M, Rytter W (1994) Text Algorithms. Oxford University Press Inc, USA, p 412"},{"key":"7165_CR17","unstructured":"Baeza-Yates R (1989) Efficient text searching. PhD thesis, University of Waterloo"},{"key":"7165_CR18","doi-asserted-by":"crossref","unstructured":"Navarro G, Raffinot M (1998) A bit-parallel approach to suffix automata: fast extended string matching. In: Combinatorial Pattern Matching. Springer, Berlin, Heidelberg, pp 14\u201333","DOI":"10.1007\/BFb0030778"},{"key":"7165_CR19","first-page":"197","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire RE (1990) The strength of weak learnability. Mach Learn 5:197\u2013227","journal-title":"Mach Learn"},{"key":"7165_CR20","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24:123\u2013140","journal-title":"Mach Learn"},{"key":"7165_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Mach Learn 63:3\u201342","journal-title":"Mach Learn"},{"key":"7165_CR22","unstructured":"Ke G, Meng Q, Finley T, Wang T, Chen W, Ma W, Ye Q, Liu T-Y (2017) Lightgbm: A highly efficient gradient boosting decision tree. In: Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc., Red Hook, NY, USA"},{"key":"7165_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"key":"7165_CR24","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"7165_CR25","unstructured":"Faro S, Lecroq T, Borz\u00ec S, Mauro SD, Maggio A (2016) The string matching algorithms research tool. In: Proceedings of the Prague Stringology Conference 2016, Czech Technical University in Prague, Czech Republic, pp 99\u2013111"},{"key":"7165_CR26","doi-asserted-by":"crossref","unstructured":"Fredriksson K, Grabowski S (2005) Practical and optimal string matching. In: Proceedings of the String Processing and Information Retrieval, pp 374\u2013385. Springer, Berlin, Heidelberg","DOI":"10.1007\/11575832_42"},{"key":"7165_CR27","doi-asserted-by":"crossref","unstructured":"Charras C, Lecrog T, Pehoushek JD (1998) A very fast string matching algorithm for small alphabets and long patterns. In: Annual Symposium on Combinatorial Pattern Matching. Springer, pp 55\u201364","DOI":"10.1007\/BFb0030780"},{"issue":"5\/6","key":"7165_CR28","first-page":"589","volume":"10","author":"D Cantone","year":"2005","unstructured":"Cantone D, Faro S (2005) Fast-search algorithms: new efficient variants of the Boyer\u2013Moore pattern-matching algorithm. J Autom Lang Comb 10(5\/6):589\u2013608","journal-title":"J Autom Lang Comb"},{"key":"7165_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/351827.384246","volume":"5","author":"G Navarro","year":"2000","unstructured":"Navarro G, Raffinot M (2000) Fast and flexible string matching by combining bit-parallelism and suffix automata. J Exp Algorithmics (JEA) 5:4","journal-title":"J Exp Algorithmics (JEA)"},{"key":"7165_CR30","doi-asserted-by":"crossref","unstructured":"Allauzen C, Crochemore M, Raffinot M (1999) Factor oracle: A new structure for pattern matching. In: SOFSEM\u201999: Theory and Practice of Informatics: 26th Conference on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic, Nov 27\u2013Dec 4, 1999 Proceedings 26. Springer, pp 295\u2013310","DOI":"10.1007\/3-540-47849-3_18"},{"key":"7165_CR31","unstructured":"Berry T, Ravindran S (1999) A fast string matching algorithm and experimental results. In: Prague Stringology Club Workshop"},{"key":"7165_CR32","unstructured":"Faro S, Lecroq T (2008) Efficient variants of the backward-oracle-matching algorithm. In: Proceedings of the Prague Stringology Conference 2008, Czech Technical University in Prague, Czech Republic, pp 146\u2013160"},{"key":"7165_CR33","unstructured":"Hancart C (1993) Analyse exacte et en moyenne d\u2019algorithmes de recherche d\u2019un motif dans un texte. PhD thesis, Paris 7"},{"issue":"1","key":"7165_CR34","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(92)90139-7","volume":"92","author":"T Lecroq","year":"1992","unstructured":"Lecroq T (1992) A variation on the Boyer\u2013Moore algorithm. Theoret Comput Sci 92(1):119\u2013144","journal-title":"Theoret Comput Sci"},{"key":"7165_CR35","doi-asserted-by":"crossref","unstructured":"Peltola H, Tarhio J (2003) Alternative algorithms for bit-parallel string matching. In: International Symposium on String Processing and Information Retrieval. Springer, pp 80\u201393","DOI":"10.1007\/978-3-540-39984-1_7"},{"key":"7165_CR36","doi-asserted-by":"crossref","unstructured":"Fan H, Yao N, Ma H (2009) Fast variants of the backward-oracle-marching algorithm. In: 2009 Fourth International Conference on Internet Computing for Science and Engineering, pp 56\u201359","DOI":"10.1109\/ICICSE.2009.53"},{"issue":"10","key":"7165_CR37","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1002\/spe.4380211006","volume":"21","author":"PD Smith","year":"1991","unstructured":"Smith PD (1991) Experiments with a very fast substring search algorithm. Softw Pract Exp 21(10):1065\u20131074","journal-title":"Softw Pract Exp"},{"issue":"10","key":"7165_CR38","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R Baeza-Yates","year":"1992","unstructured":"Baeza-Yates R, Gonnet GH (1992) A new approach to text searching. Commun ACM 35(10):74\u201382","journal-title":"Commun ACM"},{"key":"7165_CR39","unstructured":"Cantone D, Faro S (2004) \u201cIt\u2019s economy, stupid!\u201d Searching for a substring with constant extra-space complexity. In: Proceedings of Third International Conference on Fun with Algorithms, Tuscany, Italy, pp 118\u2013131"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07165-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T22:01:01Z","timestamp":1743458461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07165-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,29]]},"references-count":39,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["7165"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07165-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,29]]},"assertion":[{"value":"6 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2025","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"673"}}