{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T06:11:40Z","timestamp":1772691100671,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CE45-0023"],"award-info":[{"award-number":["ANR-19-CE45-0023"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00453-026-01371-x","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T04:11:50Z","timestamp":1772683910000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms"],"prefix":"10.1007","volume":"88","author":[{"given":"Th\u00e9o","family":"Boury","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Bulteau","sequence":"additional","affiliation":[]},{"given":"Bertrand","family":"Marchand","sequence":"additional","affiliation":[]},{"given":"Yann","family":"Ponty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,5]]},"reference":[{"issue":"2013","key":"1371_CR1","first-page":"127","volume":"409","author":"J van den Heuvel","year":"2013","unstructured":"van den Heuvel, J.: The complexity of change. Surveys Comb. 409(2013), 127\u2013160 (2013)","journal-title":"Surveys Comb."},{"issue":"1","key":"1371_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3280825","volume":"15","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. ACM Trans. Algorithms 15(1), 1\u201319 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"1371_CR3","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.dam.2020.01.022","volume":"283","author":"T Ito","year":"2020","unstructured":"Ito, T., Kami\u0144ski, M., Ono, H., Suzuki, A., Uehara, R., Yamanaka, K.: Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283, 336\u2013345 (2020)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1371_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. Algorithmica 78(1), 274\u2013297 (2017)","journal-title":"Algorithmica"},{"key":"1371_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2018.02.004","volume":"95","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Ramanujan, M., Saurabh, S.: Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95, 122\u2013131 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"1371_CR6","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/s00453-021-00909-5","volume":"84","author":"D Lokshtanov","year":"2022","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Siebertz, S.: On the parameterized complexity of reconfiguration of connected dominating sets. Algorithmica 84, 482\u2013509 (2022). https:\/\/doi.org\/10.1007\/s00453-021-00909-5","journal-title":"Algorithmica"},{"key":"1371_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2024.100663","volume":"53","author":"N Bousquet","year":"2024","unstructured":"Bousquet, N., Mouawad, A.E., Nishimura, N., Siebertz, S.: A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53, 100663 (2024)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"1371_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11047-010-9239-4","volume":"10","author":"J Ma\u0148uch","year":"2011","unstructured":"Ma\u0148uch, J., Thachuk, C., Stacho, L., Condon, A.: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10(1), 391\u2013405 (2011)","journal-title":"Nat. Comput."},{"issue":"2","key":"1371_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1006\/jmbi.1999.3001","volume":"293","author":"I Tinoco Jr","year":"1999","unstructured":"Tinoco, I., Jr., Bustamante, C.: How RNA folds. J. Mol. Biol. 293(2), 271\u2013281 (1999)","journal-title":"J. Mol. Biol."},{"key":"1371_CR10","doi-asserted-by":"publisher","unstructured":"Thachuk, C., Manuch, J., Rafiey, A., Mathieson, L.-A., Stacho, L., Condon, A.: An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs, pp. 108\u2013119. World Scientific, Singapore (2009). https:\/\/doi.org\/10.1142\/9789814295291_0013","DOI":"10.1142\/9789814295291_0013"},{"key":"1371_CR11","unstructured":"Gottschau, M., Happach, F., Kaiser, M., Waldmann, C.: Budget minimization with precedence constraints. CoRR arXiv:1905.13740 (2019)"},{"key":"1371_CR12","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-031-43587-4_22","volume-title":"Fundamentals of Computation Theory","author":"J Kinne","year":"2023","unstructured":"Kinne, J., Rafiey, A., Rafiey, A., Sorkhpar, M.: Vertex ordering with precedence constraints. In: Fernau, H., Jansen, K. (eds.) Fundamentals of Computation Theory, pp. 304\u2013317. Springer, Cham (2023)"},{"issue":"11","key":"1371_CR13","doi-asserted-by":"publisher","first-page":"5381","DOI":"10.1093\/nar\/gky285","volume":"46","author":"P Danaee","year":"2018","unstructured":"Danaee, P., Rouches, M., Wiley, M., Deng, D., Huang, L., Hendrix, D.: bpRNA: large-scale automated annotation and analysis of RNA secondary structure. Nucleic Acids Res. 46(11), 5381\u20135394 (2018)","journal-title":"Nucleic Acids Res."},{"issue":"9","key":"1371_CR14","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1007\/s00453-020-00700-y","volume":"82","author":"R Belmonte","year":"2020","unstructured":"Belmonte, R., Hanaka, T., Lampis, M., Ono, H., Otachi, Y.: Independent set reconfiguration parameterized by modular-width. Algorithmica 82(9), 2586\u20132605 (2020)","journal-title":"Algorithmica"},{"key":"1371_CR15","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Wrochna, M.: Reconfiguration over tree decompositions. In: International Symposium on Parameterized and Exact Computation, pp. 246\u2013257 (2014). Springer","DOI":"10.1007\/978-3-319-13524-3_21"},{"key":"1371_CR16","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Groenland, C., Swennenhuis, C.M.F.: Parameterized Complexities of Dominating and Independent Set Reconfiguration. In: Golovach, P.A., Zehavi, M. (eds.) 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). LIPIcs, vol. 214, pp. 9\u20131916. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2021.9","DOI":"10.4230\/LIPIcs.IPEC.2021.9"},{"key":"1371_CR17","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: Linear layouts in submodular systems. In: Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings 23, pp. 475\u2013484 (2012). Springer","DOI":"10.1007\/978-3-642-35261-4_50"},{"key":"1371_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02242792","volume":"24","author":"H Abdel-Wahab","year":"1980","unstructured":"Abdel-Wahab, H.: On strictly optimal schedules for the cumulative cost-optimal scheduling problem. Computing 24, 61\u201386 (1980)","journal-title":"Computing"},{"key":"1371_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 5. Springer, Cham (2015)"},{"issue":"14","key":"1371_CR20","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1088\/0305-4470\/31\/14\/005","volume":"31","author":"SR Morgan","year":"1998","unstructured":"Morgan, S.R., Higgs, P.G.: Barrier heights between ground states in a model of RNA secondary structure. J. Phys. A: Math. Gen. 31(14), 3153 (1998). https:\/\/doi.org\/10.1088\/0305-4470\/31\/14\/005","journal-title":"J. Phys. A: Math. Gen."},{"issue":"17","key":"1371_CR21","doi-asserted-by":"publisher","first-page":"4731","DOI":"10.1088\/0305-4470\/37\/17\/005","volume":"37","author":"MT Wolfinger","year":"2004","unstructured":"Wolfinger, M.T., Svrcek-Seiler, W.A., Flamm, C., Hofacker, I.L., Stadler, P.F.: Efficient computation of RNA folding dynamics. J. Phys. A: Math. Gen. 37(17), 4731 (2004)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"2","key":"1371_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1089\/cmb.2014.0193","volume":"22","author":"E Senter","year":"2015","unstructured":"Senter, E., Clote, P.: Fast, approximate kinetics of RNA folding. J. Comput. Biol. 22(2), 124\u2013144 (2015)","journal-title":"J. Comput. Biol."},{"issue":"14","key":"1371_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/btx269","volume":"33","author":"J Mich\u00e1lik","year":"2017","unstructured":"Mich\u00e1lik, J., Touzet, H., Ponty, Y.: Efficient approximations of RNA kinetics landscape using non-redundant sampling. Bioinformatics 33(14), 283\u2013292 (2017). https:\/\/doi.org\/10.1093\/bioinformatics\/btx269","journal-title":"Bioinformatics"},{"issue":"15","key":"1371_CR24","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1093\/bioinformatics\/btab066","volume":"37","author":"G Entzian","year":"2021","unstructured":"Entzian, G., Hofacker, I.L., Ponty, Y., Lorenz, R., Tanzer, A.: RNAxplorer: harnessing the power of guiding potentials to sample RNA landscapes. Bioinformatics 37(15), 2126\u20132133 (2021). https:\/\/doi.org\/10.1093\/bioinformatics\/btab066","journal-title":"Bioinformatics"},{"issue":"2","key":"1371_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed path-width and monotonicity in digraph searching. Graphs Comb. 22(2), 161\u2013172 (2006)","journal-title":"Graphs Comb."},{"issue":"10","key":"1371_CR26","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1016\/j.dam.2007.08.045","volume":"156","author":"B Yang","year":"2008","unstructured":"Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Discret. Appl. Math. 156(10), 1822\u20131837 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1371_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2851494","volume":"21","author":"D Coudert","year":"2016","unstructured":"Coudert, D., Mazauric, D., Nisse, N.: Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth. J. Experimental Algorithmics (JEA) 21, 1\u201323 (2016)","journal-title":"J. Experimental Algorithmics (JEA)"},{"issue":"1","key":"1371_CR28","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1137\/19M1248728","volume":"34","author":"J Erde","year":"2020","unstructured":"Erde, J.: Directed path-decompositions. SIAM J. Discret. Math. 34(1), 415\u2013430 (2020)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"1371_CR29","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/s00453-015-0015-9","volume":"75","author":"K Kitsunai","year":"2016","unstructured":"Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in $$o(1.89^{n})$$ time. Algorithmica 75(1), 138\u2013157 (2016)","journal-title":"Algorithmica"},{"key":"1371_CR30","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-25870-1_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H Tamaki","year":"2011","unstructured":"Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Kolman, P., Kratochv\u00edl, J. (eds.) Graph-Theoretic Concepts in Computer Science, pp. 331\u2013342. Springer, Berlin, Heidelberg (2011)"},{"key":"1371_CR31","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: Fixed-parameter tractability of treewidth and pathwidth. In: The Multivariate Algorithmic Revolution and Beyond, pp. 196\u2013227. Springer, Cham (2012)","DOI":"10.1007\/978-3-642-30891-8_12"},{"key":"1371_CR32","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Komuro, K., Tamaki, H.: Search space reduction through commitments in pathwidth computation: An experimental study. In: International Symposium on Experimental Algorithms, pp. 388\u2013399 (2014). Springer","DOI":"10.1007\/978-3-319-07959-2_33"},{"issue":"1","key":"1371_CR33","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0893-9659(94)90045-0","volume":"7","author":"K Fukuda","year":"1994","unstructured":"Fukuda, K., Matsui, T.: Finding all the perfect matchings in bipartite graphs. Appl. Math. Lett. 7(1), 15\u201318 (1994)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1371_CR34","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/110837188","volume":"27","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Zhang, X., Wen, X.: Directed hamilton cycles in digraphs and matching alternating hamilton cycles in bipartite graphs. SIAM J. Discret. Math. 27(1), 274\u2013289 (2013). https:\/\/doi.org\/10.1137\/110837188","journal-title":"SIAM J. Discret. Math."},{"key":"1371_CR35","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Marchand, B., Ponty, Y.: A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. In: Parameterized and Exact Computation (IPEC). LIPIcs, vol. 214, pp. 11\u201311115. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2021.11","DOI":"10.4230\/LIPIcs.IPEC.2021.11"},{"key":"1371_CR36","doi-asserted-by":"crossref","unstructured":"Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 331\u2013342. Springer, Cham (2011)","DOI":"10.1007\/978-3-642-25870-1_30"},{"issue":"4","key":"1371_CR37","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.jcss.2003.09.003","volume":"67","author":"J Chen","year":"2003","unstructured":"Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67(4), 833\u2013847 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"1371_CR38","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/367","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Society, Providence, Rhode Island, USA (2009)"},{"key":"1371_CR39","unstructured":"Zhang, Z.-B., Lou, D.: Bipartite graphs with a perfect matching and digraphs. arXiv preprint arXiv:1011.4359 (2010)"},{"issue":"6\u20137","key":"1371_CR40","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"JS McCaskill","year":"1990","unstructured":"McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers: Original Res. Biomolecules 29(6\u20137), 1105\u20131119 (1990)","journal-title":"Biopolymers: Original Res. Biomolecules"},{"issue":"1","key":"1371_CR41","first-page":"107","volume":"56","author":"Y Ponty","year":"2008","unstructured":"Ponty, Y.: Efficient sampling of RNA secondary structures from the boltzmann ensemble of low-energy: the Boustrophedon method. J. Math. Biol. 56(1), 107\u2013127 (2008)","journal-title":"J. Math. Biol."},{"issue":"21","key":"1371_CR42","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1093\/bioinformatics\/btr510","volume":"27","author":"Y Li","year":"2011","unstructured":"Li, Y., Zhang, S.: Finding stable local optimal rna secondary structures. Bioinformatics 27(21), 2994\u20133001 (2011). https:\/\/doi.org\/10.1093\/bioinformatics\/btr510","journal-title":"Bioinformatics"},{"issue":"4","key":"1371_CR43","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1093\/nar\/gkaa900","volume":"49","author":"AL Mart\u00edn","year":"2020","unstructured":"Mart\u00edn, A.L., Mounir, M., Meyer, I.M.: Cobold: a method for identifying different functional classes of transient rna structure features that can impact rna structure formation in vivo. Nucleic Acids Res. 49(4), 19\u201319 (2020). https:\/\/doi.org\/10.1093\/nar\/gkaa900","journal-title":"Nucleic Acids Res."},{"issue":"13","key":"1371_CR44","doi-asserted-by":"publisher","first-page":"5129","DOI":"10.1002\/j.1460-2075.1992.tb05620.x","volume":"11","author":"CK Biebricher","year":"1992","unstructured":"Biebricher, C.K., Luce, R.: In vitro recombination and terminal elongation of rna by q beta replicase. EMBO J. 11(13), 5129\u20135135 (1992). https:\/\/doi.org\/10.1002\/j.1460-2075.1992.tb05620.x","journal-title":"EMBO J."},{"key":"1371_CR45","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.dam.2018.05.029","volume":"250","author":"M de Berg","year":"2018","unstructured":"de Berg, M., Jansen, B.M., Mukherjee, D.: Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250, 165\u2013182 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"19","key":"1371_CR46","doi-asserted-by":"publisher","first-page":"7287","DOI":"10.1073\/pnas.0401799101","volume":"101","author":"DH Mathews","year":"2004","unstructured":"Mathews, D.H., Disney, M.D., Childs, J.L., Schroeder, S.J., Zuker, M., Turner, D.H.: Incorporating chemical modification constraints into a dynamic programming algorithm for prediction of rna secondary structure. Proc. Natl. Acad. Sci. 101(19), 7287\u20137292 (2004). https:\/\/doi.org\/10.1073\/pnas.0401799101","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01371-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-026-01371-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01371-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T04:11:52Z","timestamp":1772683912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-026-01371-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,5]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1371"],"URL":"https:\/\/doi.org\/10.1007\/s00453-026-01371-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,5]]},"assertion":[{"value":"11 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 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"}}],"article-number":"26"}}