{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:08:35Z","timestamp":1783987715713,"version":"3.55.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:00:00Z","timestamp":1778630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"content-version":"vor","delay-in-days":62,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFC3604902"],"award-info":[{"award-number":["2023YFC3604902"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-026-53226-8","type":"journal-article","created":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:34:50Z","timestamp":1778679290000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing gait template generation from variable-length data: a dynamic dimension warping approach"],"prefix":"10.1038","volume":"16","author":[{"given":"Dongnan","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yali","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiuzhi","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenpeng","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xunju","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dehao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,13]]},"reference":[{"key":"53226_CR1","unstructured":"Merris, R. Wiley-Interscience Series in Discrete Mathematics and Optimization (John Wiley & Sons, Ltd, 2011)."},{"key":"53226_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.swevo.2018.02.013","volume":"44","author":"M Jain","year":"2019","unstructured":"Jain, M., Singh, V. & Rani, A. A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol. Comput. 44, 148\u2013175 (2019).","journal-title":"Swarm Evol. Comput."},{"key":"53226_CR3","unstructured":"Eberhart, R. & Kennedy, J. A new optimizer using particle swarm theory. MHS\u201995. Proceedings of the sixth international symposium on micro machine and human science. Ieee, (1995)."},{"key":"53226_CR4","unstructured":"Pal, A. & Bahuguna, S. Grey Wolf Optimizer. 26th European Signal Processing Conference (EUSIPCO) 2018. (2018)."},{"key":"53226_CR5","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S. Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowl-Based Syst. 89, 228\u2013249 (2015).","journal-title":"Knowl-Based Syst."},{"key":"53226_CR6","doi-asserted-by":"crossref","unstructured":"Abualigah, L. et al. Aquila optimizer: A novel meta-heuristic optimization algorithm. Comput. Ind. Eng. 157, 107250 (2021).","DOI":"10.1016\/j.cie.2021.107250"},{"key":"53226_CR7","volume":"1","author":"H Peraza-V\u00e1zquez","year":"2021","unstructured":"Peraza-V\u00e1zquez, H. et al. A bio-inspired method for engineering design optimization inspired by dingoes hunting strategies. Math. Probl. Eng. 1, 9107547 (2021).","journal-title":"Math. Probl. Eng."},{"issue":"2","key":"53226_CR8","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TIE.2018.2821091","volume":"66","author":"R Alipour-Sarabi","year":"2018","unstructured":"Alipour-Sarabi, R. et al. Improved winding proposal for wound rotor resolver using genetic algorithm and winding function approach. IEEE Trans. Industr. Electron. 66 (2), 1325\u20131334 (2018).","journal-title":"IEEE Trans. Industr. Electron."},{"key":"53226_CR9","doi-asserted-by":"crossref","unstructured":"Qu, X. & Yiwang, L. Optimizing an integrated inventory-routing system for multi-item joint replenishment and coordinated outbound delivery using differential evolution algorithm. Appl. Soft Comput. 86, 105863 (2020).","DOI":"10.1016\/j.asoc.2019.105863"},{"key":"53226_CR10","doi-asserted-by":"crossref","unstructured":"Wang, W. et al. A Hierarchical Game with Strategy Evolution for Mobile Sponsored Content\/Service Markets. GLOBECOM 2017\u20132017 IEEE Global Communications Conference IEEE, (2018).","DOI":"10.1109\/GLOCOM.2017.8254117"},{"key":"53226_CR11","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science 220, 671\u2013680 (1983).","DOI":"10.1126\/science.220.4598.671"},{"issue":"13","key":"53226_CR12","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi, E., Nezamabadi-Pour, H. & Saryazdi, S. GSA: A gravitational search algorithm. Inf. Sci. 179 (13), 2232\u20132248 (2009).","journal-title":"Inf. Sci."},{"issue":"3","key":"53226_CR13","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","volume":"51","author":"FA Hashim","year":"2021","unstructured":"Hashim, F. A. et al. Archimedes optimization algorithm: A new metaheuristic algorithm for solving optimization problems. Appl. Intell. 51 (3), 1531\u20131551 (2021).","journal-title":"Appl. Intell."},{"key":"53226_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.10.008","volume":"55","author":"YJ Zheng","year":"2015","unstructured":"Zheng, Y. J. Water wave optimization: A new nature-inspired metaheuristic. Comput. Oper. Res. 55, 1\u201311 (2015).","journal-title":"Comput. Oper. Res."},{"key":"53226_CR15","doi-asserted-by":"crossref","unstructured":"Geem, Z., Woo, J. H., Kim & Loganathan, G. V. A new heuristic optimization algorithm: harmony search. Simulation 76 (2), 60\u201368. (2001).","DOI":"10.1177\/003754970107600201"},{"key":"53226_CR16","doi-asserted-by":"publisher","first-page":"106656","DOI":"10.1016\/j.compchemeng.2019.106656","volume":"133","author":"EH Houssein","year":"2020","unstructured":"Houssein, E. H. et al. A novel hybrid Harris hawks optimization and support vector machines for drug design and discovery. Comput. Chem. Eng. 133, 106656 (2020).","journal-title":"Comput. Chem. Eng."},{"key":"53226_CR17","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, N. et al. Optimization algorithms combining (meta) heuristics and mathematical programming and its application in engineering. (2018).","DOI":"10.1155\/2018\/3967457"},{"key":"53226_CR18","doi-asserted-by":"crossref","unstructured":"Vasant, P. M. Meta-heuristics optimization algorithms in engineering, business, economics, and finance. register (2013).","DOI":"10.4018\/978-1-4666-2086-5"},{"issue":"4","key":"53226_CR19","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1007\/s10614-022-10303-0","volume":"62","author":"A Khan","year":"2023","unstructured":"Khan, A., Tamoor, Cao & Li, S. Using quadratic interpolated beetle antennae search for higher dimensional portfolio selection under cardinality constraints. Comput. Econ. 62 (4), 1413\u20131435 (2023).","journal-title":"Comput. Econ."},{"issue":"3","key":"53226_CR20","doi-asserted-by":"publisher","first-page":"0","DOI":"10.1109\/4235.930318","volume":"5","author":"M Koppen","year":"2001","unstructured":"Koppen, M., Wolpert, D. H. & Macready, W. G. Remarks on a recent paper on the o free lunch\\ theorems. evolutionary computation ieee transactions on 5(3), 0\u2013296 (2001).","journal-title":"evolutionary computation ieee transactions on"},{"issue":"1","key":"53226_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H. & Macready, W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"53226_CR22","doi-asserted-by":"crossref","unstructured":"Tan, Y. & Zhu, Y. Fireworks algorithm for optimization. Advances in Swarm Intelligence: First International Conference, ICSI 2010, Beijing, China, June 12\u201315, 2010, Proceedings, Part I 1. Springer Berlin Heidelberg, (2010).","DOI":"10.1007\/978-3-642-13495-1"},{"issue":"2","key":"53226_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1166\/jctn.2012.2019","volume":"9","author":"A Abraham","year":"2012","unstructured":"Abraham, A., Jatoth, R. K. & Rajasekhar, A. Hybrid differential artificial bee colony algorithm. J. Comput. Theor. Nanosci. 9(2), 249\u2013257 (2012).","journal-title":"J. Comput. Theor. Nanosci."},{"issue":"4","key":"53226_CR24","first-page":"330","volume":"1","author":"X Yang","year":"2010","unstructured":"Yang, X. & Deb, S. Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330\u2013343 (2010).","journal-title":"Int. J. Math. Model. Numer. Optim."},{"key":"53226_CR25","doi-asserted-by":"crossref","unstructured":"Yang XinShe. Firefly algorithms for multimodal optimization. International symposium on stochastic algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg,. (2009).","DOI":"10.1007\/978-3-642-04944-6_14"},{"issue":"5","key":"53226_CR26","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TEVC.2009.2011992","volume":"13","author":"S He","year":"2009","unstructured":"He, S., Wu, Q. H. & Saunders, J. R. Group search optimizer: An optimization algorithm inspired by animal searching behavior. IEEE Trans. Evol. Comput. 13(5), 973\u2013990 (2009).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"53226_CR27","doi-asserted-by":"crossref","unstructured":"Yang XinShe. A new metaheuristic bat-inspired algorithm. Nature inspired cooperative strategies for optimization (NICSO 2010) 65\u201374 (Springer Berlin Heidelberg, 2010).","DOI":"10.1007\/978-3-642-12538-6_6"},{"issue":"2","key":"53226_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff, M., Lansey, K. & Pasha, F. Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization. Eng. Optim. 38(2), 129\u2013154 (2006).","journal-title":"Eng. Optim."},{"key":"53226_CR29","unstructured":"Shi, Y. Brain storm optimization algorithm. Advances in Swarm Intelligence: Second International Conference, ICSI 2011, Chongqing, China, June 12\u201315, 2011, Proceedings, Part I 2. Springer Berlin Heidelberg, (2011)."},{"issue":"1","key":"53226_CR30","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","volume":"8","author":"J Xue","year":"2020","unstructured":"Xue, J. & Shen, B. A novel swarm intelligence optimization approach: Sparrow search algorithm. Syst. Sci. Control Eng. 8(1), 22\u201334 (2020).","journal-title":"Syst. Sci. Control Eng."},{"key":"53226_CR31","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S. The ant lion optimizer. Adv. Eng. Softw. 83, 80\u201398 (2015).","journal-title":"Adv. Eng. Softw."},{"key":"53226_CR32","doi-asserted-by":"crossref","unstructured":"Arora, S. & Singh, S. Butterfly algorithm with levy flights for global optimization. 2015 International conference on signal processing, computing and control (ISPCC). IEEE, (2015).","DOI":"10.1109\/ISPCC.2015.7375029"},{"key":"53226_CR33","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s00521-015-1923-y","volume":"31","author":"GG Wang","year":"2019","unstructured":"Wang, G. G., Deb, S. & Cui, Z. Monarch butterfly Optim. Neural Comput. Appl. 31 : 1995\u20132014. (2019).","journal-title":"Monarch butterfly Optim. Neural Comput. Appl."},{"key":"53226_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106559","volume":"145","author":"K Zervoudakis","year":"2020","unstructured":"Zervoudakis, K. & Tsafarakis, S. A mayfly optimization algorithm. Comput. Ind. Eng. 145, 106559 (2020).","journal-title":"Comput. Ind. Eng."},{"key":"53226_CR35","first-page":"30","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi, S., Mirjalili, S. & Lewis, A. Grasshopper optimisation algorithm: theory application Adv. Eng. Softw. 105 : 30\u201347. (2017).","journal-title":"Grasshopper optimisation algorithm: theory application Adv. Eng. Softw."},{"key":"53226_CR36","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1007\/s10462-019-09732-5","volume":"53","author":"HA Alsattar","year":"2020","unstructured":"Alsattar, H. A. & Zaidan, A. A. Novel meta-heuristic bald eagle search optimisation algorithm. Artif. Intell. Rev. 53, 2237\u20132264 (2020).","journal-title":"Artif. Intell. Rev."},{"key":"53226_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi, A. et al. Marine predators algorithm: A nature-inspired metaheuristic. Expert Syst. Appl. 152, 113377 (2020).","journal-title":"Expert Syst. Appl."},{"key":"53226_CR38","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili, S. et al. Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 114, 163\u2013191 (2017).","journal-title":"Adv. Eng. Softw."},{"key":"53226_CR39","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li, S. et al. Slime mould algorithm: A new method for stochastic optimization. Future generation Comput. Syst. 111, 300\u2013323 (2020).","journal-title":"Future generation Comput. Syst."},{"issue":"1","key":"53226_CR40","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1108\/IJICC-02-2014-0005","volume":"7","author":"H Duan","year":"2014","unstructured":"Duan, H. & Qiao, P. Pigeon-inspired optimization: A new swarm intelligence optimizer for air robot path planning. Int. J. Intell. Comput. Cybern. 7(1), 24\u201337 (2014).","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"53226_CR41","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"A Heidari","year":"2019","unstructured":"Heidari, A. et al. Harris hawks optimization: Algorithm and applications. Future Gener. Comput. Syst. 97, 849\u2013872 (2019).","journal-title":"Future Gener. Comput. Syst."},{"key":"53226_CR42","first-page":"51","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S. Andrew Lewis whale Optim. algorithm Adv. Eng. Softw. 95 : 51\u201367. (2016).","journal-title":"Andrew Lewis whale Optim. algorithm Adv. Eng. Softw."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53226-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53226-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53226-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:40:37Z","timestamp":1783986037000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53226-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,13]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["53226"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-53226-8","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,13]]},"assertion":[{"value":"29 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2026","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":"Competing interests"}},{"value":"This study involving human subjects was approved by the Ethics Committee of Beijing Institute of Technology (Approval Code: BIT-EC-H-2024156). All methods were performed in accordance with the relevant guidelines and regulations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable, as this study does not contain any individual person\u2019s data.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"21937"}}