{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:28:13Z","timestamp":1778758093991,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T00:00:00Z","timestamp":1709424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T00:00:00Z","timestamp":1709424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Microsoft AI4Health Azure"},{"name":"NSERC Discovery Grant"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Motivation<\/jats:title>\n                    <jats:p>\n                      Computational RNA secondary structure prediction by free energy minimization is indispensable for analyzing structural RNAs and their interactions. These methods find the structure with the minimum free energy (MFE) among exponentially many possible structures and have a restrictive time and space complexity (\n                      <jats:inline-formula>\n                        <jats:alternatives>\n                          <jats:tex-math>$$O(n^3)$$<\/jats:tex-math>\n                          <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                            <mml:mrow>\n                              <mml:mi>O<\/mml:mi>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:msup>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mn>3<\/mml:mn>\n                              <\/mml:msup>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:math>\n                        <\/jats:alternatives>\n                      <\/jats:inline-formula>\n                      time and\n                      <jats:inline-formula>\n                        <jats:alternatives>\n                          <jats:tex-math>$$O(n^2)$$<\/jats:tex-math>\n                          <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                            <mml:mrow>\n                              <mml:mi>O<\/mml:mi>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:msup>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mn>2<\/mml:mn>\n                              <\/mml:msup>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:math>\n                        <\/jats:alternatives>\n                      <\/jats:inline-formula>\n                      space for pseudoknot-free structures) for longer RNA sequences. Furthermore, accurate free energy calculations, including dangle contributions can be difficult and costly to implement, particularly when optimizing for time and space requirements.\n                    <\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>Here we introduce a fast and efficient sparsified MFE pseudoknot-free structure prediction algorithm, SparseRNAFolD, that utilizes an accurate energy model that accounts for dangle contributions. While the sparsification technique was previously employed to improve the time and space complexity of a pseudoknot-free structure prediction method with a realistic energy model, SparseMFEFold, it was not extended to include dangle contributions due to the complexity of computation. This may come at the cost of prediction accuracy. In this work, we compare three different sparsified implementations for dangle contributions and provide pros and cons of each method. As well, we compare our algorithm to LinearFold, a linear time and space algorithm, where we find that in practice, SparseRNAFolD has lower memory consumption across all lengths of sequence and a faster time for lengths up to 1000 bases.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Conclusion<\/jats:title>\n                    <jats:p>Our SparseRNAFolD algorithm is an MFE-based algorithm that guarantees optimality of result and employs the most general energy model, including dangle contributions. We provide a basis for applying dangles to sparsified recursion in a pseudoknot-free model that has the potential to be extended to pseudoknots.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1186\/s13015-024-00256-4","type":"journal-article","created":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T19:03:43Z","timestamp":1709492623000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration"],"prefix":"10.1186","volume":"19","author":[{"given":"Mateo","family":"Gray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Will","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hosna","family":"Jabbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,3]]},"reference":[{"key":"256_CR1","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.cell.2009.02.003","volume":"136","author":"JA Cruz","year":"2009","unstructured":"Cruz JA, Westhof E. The dynamic landscapes of RNA architecture. Cell. 2009;136:604\u20139. https:\/\/doi.org\/10.1016\/j.cell.2009.02.003.","journal-title":"Cell"},{"key":"256_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.gene.2005.06.037","volume":"361","author":"M Kozak","year":"2005","unstructured":"Kozak M. Regulation of translation via mRNA structure in prokaryotes and eukaryotes. Gene. 2005;361:13\u201337. https:\/\/doi.org\/10.1016\/j.gene.2005.06.037.","journal-title":"Gene"},{"key":"256_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1038\/nrg3681","volume":"15","author":"SA Mortimer","year":"2014","unstructured":"Mortimer SA, Kidwell MA, Doudna JA. Insights into RNA structure and function from genome-wide studies. Nat Rev Genet. 2014;15:469\u201379. https:\/\/doi.org\/10.1038\/nrg3681.","journal-title":"Nat Rev Genet"},{"key":"256_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tibs.2009.10.004","volume":"35","author":"MB Warf","year":"2010","unstructured":"Warf MB, Berglund JA. Role of RNA structure in regulating pre-mRNA splicing. Trends Biochem Sci. 2010;35:169\u201378. https:\/\/doi.org\/10.1016\/j.tibs.2009.10.004.","journal-title":"Trends Biochem Sci."},{"key":"256_CR5","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1261\/rna.049874.115","volume":"21","author":"TJ Wilson","year":"2015","unstructured":"Wilson TJ, Lilley DMJ. RNA catalysis\u2014is that it? RNA. 2015;21:534\u20137. https:\/\/doi.org\/10.1261\/rna.049874.115.","journal-title":"RNA"},{"key":"256_CR6","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1126\/science.1176488","volume":"326","author":"CE Holt","year":"2013","unstructured":"Holt CE, Bullock SL. Subcellular mRNA localization in animal cells and why it matters. Science. 2013;326:1212\u20136. https:\/\/doi.org\/10.1126\/science.1176488.","journal-title":"Science"},{"key":"256_CR7","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.cell.2009.01.044","volume":"136","author":"KC Martin","year":"2009","unstructured":"Martin KC, Ephrussi A. mRNA localization: gene expression in the spatial dimension. Cell. 2009;136:719\u201330. https:\/\/doi.org\/10.1016\/j.cell.2009.01.044.","journal-title":"Cell"},{"issue":"3","key":"256_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.sbi.2006.05.010","volume":"16","author":"DH Mathews","year":"2006","unstructured":"Mathews DH, Turner DH. Prediction of RNA secondary structure by free energy minimization. Curr Opin Struct Biol. 2006;16(3):270\u20138. https:\/\/doi.org\/10.1016\/j.sbi.2006.05.010.","journal-title":"Curr Opin Struct Biol"},{"issue":"3","key":"256_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/smvy.1997.0118","volume":"8","author":"J Nowakowski","year":"1997","unstructured":"Nowakowski J, Tinoco I. RNA structure and stability. Semin Virol. 1997;8(3):153\u201365. https:\/\/doi.org\/10.1006\/smvy.1997.0118.","journal-title":"Semin Virol"},{"key":"256_CR10","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1089\/cmb.2007.R020","volume":"14","author":"Y Wexler","year":"2007","unstructured":"Wexler Y, Zilberstein C, Ziv-Ukelson M. A study of accessible motifs and RNA folding complexity. J Comput Biol. 2007;14:856\u201372. https:\/\/doi.org\/10.1089\/cmb.2007.R020.","journal-title":"J Comput Biol"},{"key":"256_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-12683-3_31","volume-title":"Research in computational molecular biology","author":"R Salari","year":"2010","unstructured":"Salari R, M\u00f6hl M, Will S, Sahinalp SC, Backofen R. Time and space efficient RNA-RNA interaction prediction via sparse folding. In: Research in computational molecular biology. Berlin, Germany: Springer; 2010. p. 473\u201390. https:\/\/doi.org\/10.1007\/978-3-642-12683-3_31."},{"key":"256_CR12","doi-asserted-by":"publisher","unstructured":"M\u00f6hl M, Salari R, Will S, Backofen R, Sahinalp S. Sparsification of RNA structure prediction including pseudoknots. Algorithms Mol Biol. 5 (2010) https:\/\/doi.org\/10.1186\/1748-7188-5-39","DOI":"10.1186\/1748-7188-5-39"},{"key":"256_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2010.09.001","volume":"9","author":"R Backofen","year":"2011","unstructured":"Backofen R, Tsur D, Zakov S, Ziv-Ukelson M. Sparse RNA folding: time and space efficient algorithms. J Discrete Algo. 2011;9:12\u201331. https:\/\/doi.org\/10.1016\/j.jda.2010.09.001.","journal-title":"J Discrete Algo"},{"key":"256_CR14","doi-asserted-by":"publisher","unstructured":"Dimitrieva S, Bucher P. Practicality and time complexity of a sparsified RNA folding algorithm. J Bioinformat Comput Biol 10 (2012) https:\/\/doi.org\/10.1142\/S0219720012410077","DOI":"10.1142\/S0219720012410077"},{"key":"256_CR15","doi-asserted-by":"publisher","unstructured":"Will S, Jabbari H. Sparse RNA folding revisited: space-efficient minimum free energy structure prediction. Algorithms for Molecular Biology 11 (2016) https:\/\/doi.org\/10.1186\/s13015-016-0071-y","DOI":"10.1186\/s13015-016-0071-y"},{"key":"256_CR16","doi-asserted-by":"publisher","unstructured":"Jabbari H, Wark I, Mothentemagno C, Will S. Sparsification enables predicting kissing hairpin pseudoknot structures of long RNAs in practice. In: 17th International Workshop on Algorithms in Bioinformatics (WABI 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 88, pp. 12\u201311213. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Oktavie-Allee, 66687 Wadern, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2017.12","DOI":"10.4230\/LIPIcs.WABI.2017.12"},{"key":"256_CR17","doi-asserted-by":"publisher","first-page":"3849","DOI":"10.1093\/bioinformatics\/bty420","volume":"34","author":"H Jabbari","year":"2018","unstructured":"Jabbari H, Wark I, Montemagno C, Will S. Knotty: efficient and accurate prediction of complex RNA pseudoknot structures. Bioinformatics. 2018;34:3849\u201356. https:\/\/doi.org\/10.1093\/bioinformatics\/bty420.","journal-title":"Bioinformatics"},{"key":"256_CR18","doi-asserted-by":"publisher","unstructured":"Lorenz R, Bernhart S.H, Siederdissen C, Tafer H, Flamm C, Stadler P.F, Hofacker I.L. ViennaRNA package 2.0. Algo Mol Biol. 2011;6. https:\/\/doi.org\/10.1186\/1748-7188-6-26","DOI":"10.1186\/1748-7188-6-26"},{"key":"256_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1093\/bioinformatics\/btz375","volume":"35","author":"L Huang","year":"2019","unstructured":"Huang L, Zhang H, Deng D, Zhao K, Liu K, Hendrix DA, Mathews DH. Linearfold: linear-time approximate RNA folding by 5\u2019-to-3\u2019 dynamic programming and beam search. Bioinformatics. 2019;35:295\u2013304. https:\/\/doi.org\/10.1093\/bioinformatics\/btz375.","journal-title":"Bioinformatics"},{"key":"256_CR20","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1093\/bioinformatics\/btl023","volume":"22","author":"IL Hofacker","year":"2006","unstructured":"Hofacker IL, Stadler PF. Memory efficient folding algorithms for circular RNA secondary structures. Bioinformatics. 2006;22:1172\u20136. https:\/\/doi.org\/10.1093\/bioinformatics\/btl023.","journal-title":"Bioinformatics"},{"key":"256_CR21","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"JS McCaskill","year":"1990","unstructured":"McCaskill JS. The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers. 1990;29:1105\u201319. https:\/\/doi.org\/10.1002\/bip.360290621.","journal-title":"Biopolymers"},{"key":"256_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00285-007-0107-5","volume":"56","author":"AF Bompf\u00fcnewerer","year":"2008","unstructured":"Bompf\u00fcnewerer AF, Backofen R, Bernhart SH, Hertel J, Hofacker IL, Stadler PF, Will S. Variations on RNA folding and alignment: lessons from Benasque. J Mathe Biol. 2008;56:129\u201344. https:\/\/doi.org\/10.1007\/s00285-007-0107-5.","journal-title":"J Mathe Biol"},{"key":"256_CR23","doi-asserted-by":"publisher","unstructured":"Lorenz R, Hofacker IL, Stadler PF. RNA folding with hard and soft constraints. Algo Mol Biol. 2016;11 (2016) https:\/\/doi.org\/10.1186\/s13015-016-0070-z","DOI":"10.1186\/s13015-016-0070-z"},{"key":"256_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M Zuker","year":"1981","unstructured":"Zuker M, Stiegler P. Optimal computer folding of large RNA sequences using thermodynamic and auxiliary information. Nucleic Acids Res. 1981;9:133\u201348. https:\/\/doi.org\/10.1093\/nar\/9.1.133.","journal-title":"Nucleic Acids Res"},{"key":"256_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00818163","volume":"125","author":"IL Hofacker","year":"1994","unstructured":"Hofacker IL, Fontana W, Stadler PF, Bonhoeffer LS, Tacker M, Schuster P. Fast folding and comparison of RNA secondary structures. Chem Monthly. 1994;125:167\u201388. https:\/\/doi.org\/10.1007\/BF00818163.","journal-title":"Chem Monthly"},{"key":"256_CR26","doi-asserted-by":"publisher","unstructured":"Reuter J.S, Matthews D.H. RNAstructure: software for RNA secondary structure prediction and analysis. In: Proceeding of the National Academy of Science of the USA. 2010; 11. https:\/\/doi.org\/10.1186\/1471-2105-11-129","DOI":"10.1186\/1471-2105-11-129"},{"key":"256_CR27","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1017\/s1355838298980116","volume":"4","author":"M Zuker","year":"1998","unstructured":"Zuker M, Jacobson AB. Using reliability information to annotate RNA secondary structures. RNA. 1998;4:669\u201379. https:\/\/doi.org\/10.1017\/s1355838298980116.","journal-title":"RNA"},{"key":"256_CR28","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1017\/s1355838202028017","volume":"8","author":"A Waugh","year":"2002","unstructured":"Waugh A, Gendron P, Altman R, Brown JW, Case D, Gautheret D, Harvey SC, Leontis N, Westbrook J, Westhof E, Zuker M, Major F. RNAML: a standard syntax for exchanging RNA information. RNA. 2002;8:707\u201317. https:\/\/doi.org\/10.1017\/s1355838202028017.","journal-title":"RNA"},{"key":"256_CR29","doi-asserted-by":"publisher","first-page":"3406","DOI":"10.1093\/nar\/gkg595","volume":"31","author":"M Zuker","year":"2003","unstructured":"Zuker M. Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Res. 2003;31:3406\u201315. https:\/\/doi.org\/10.1093\/nar\/gkg595.","journal-title":"Nucleic Acids Res"},{"key":"256_CR30","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1006\/jmbi.1998.2436","volume":"285","author":"E Rivas","year":"1999","unstructured":"Rivas E, Eddy SR. A dynamic programming algorithm for RNA structure prediction including pseudoknots. J Mol Biol. 1999;285:2053\u201368. https:\/\/doi.org\/10.1006\/jmbi.1998.2436.","journal-title":"J Mol Biol"},{"key":"256_CR31","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1261\/rna.7284905","volume":"11","author":"J Ren","year":"2005","unstructured":"Ren J, Rastegari B, Condon A, Hoos HH. HotKnots: heuristic prediction of RNA secondary structures including pseudoknots. RNA. 2005;11:1494\u2013504. https:\/\/doi.org\/10.1261\/rna.7284905.","journal-title":"RNA"},{"key":"256_CR32","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1017\/s1355838298980116","volume":"24","author":"RM Dirks","year":"2003","unstructured":"Dirks RM, Pierce NA. A partition function algorithm for nucleic acid secondary structure including pseudoknots. J Comput Chem. 2003;24:1664\u201377. https:\/\/doi.org\/10.1017\/s1355838298980116.","journal-title":"J Comput Chem"},{"key":"256_CR33","doi-asserted-by":"publisher","unstructured":"Rastegari B, Condon A. Parsing nucleic acid pseudoknotted secondary structure: algorithm and applications. J Comput Biol. 2007;14. https:\/\/doi.org\/10.1089\/cmb.2006.0108","DOI":"10.1089\/cmb.2006.0108"},{"key":"256_CR34","doi-asserted-by":"publisher","first-page":"4554","DOI":"10.1021\/bi00388a058","volume":"19","author":"N Sugimoto","year":"1987","unstructured":"Sugimoto N, Kierzek R, Turner DH. Sequence dependence for the energetics of dangling ends and terminal base pairs in ribonucleic acid. Biochemisty. 1987;19:4554\u20138. https:\/\/doi.org\/10.1021\/bi00388a058.","journal-title":"Biochemisty."},{"key":"256_CR35","doi-asserted-by":"publisher","first-page":"6168","DOI":"10.1093\/nar\/gkx170","volume":"45","author":"J Zuber","year":"2017","unstructured":"Zuber J, Sun H, Zhang X, McFayden I, Matthews DH. A sensitivity analysis of RNA folding nearest neighbor parameters identifies a subset of free energy parameters with the greatest impact on RNA secondary structure prediction. Nucleic Acids Res. 2017;45:6168\u201376. https:\/\/doi.org\/10.1093\/nar\/gkx170.","journal-title":"Nucleic Acids Res"},{"key":"256_CR36","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1261\/rna.065102.117","volume":"24","author":"J Zuber","year":"2018","unstructured":"Zuber J, Cabral BJ, McFayden I, Mauger DM, Matthews DH. Analysis of RNA nearest neighbor parameters reveals interdependencies and quantifies the uncertainty in RNA secondary structure prediction. RNA. 2018;24:1568\u201382. https:\/\/doi.org\/10.1261\/rna.065102.117.","journal-title":"RNA"},{"key":"256_CR37","doi-asserted-by":"publisher","first-page":"7287","DOI":"10.1073\/pnas.0401799101","volume":"101","author":"DH Matthews","year":"2004","unstructured":"Matthews DH, Disney MD, Childs JL, Schroeder SJ, Zuker M, Turner DH. Incorporating chemical modification constraints into a dynamic programming algorithm for prediction of RNA secondary structure. Proc Nat Acad Sci USA. 2004;101:7287\u201392. https:\/\/doi.org\/10.1073\/pnas.0401799101.","journal-title":"Proc Nat Acad Sci USA"},{"issue":"1","key":"256_CR38","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1186\/1471-2105-9-340","volume":"9","author":"M Andronescu","year":"2008","unstructured":"Andronescu M, Bereg V, Hoos HH, Condon A. RNA STRAND: the RNA secondary structure and statistical analysis database. BMC Bioinformat. 2008;9(1):340. https:\/\/doi.org\/10.1186\/1471-2105-9-340.","journal-title":"BMC Bioinformat"},{"key":"256_CR39","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1093\/nar\/gkp892","volume":"38","author":"DH Turner","year":"2009","unstructured":"Turner DH, Matthews DH. NNDB: the nearest neighbor parameter database for predicting stability of nucleic acid secondary structure. Nucleic Acids Res. 2009;38:280\u20132. https:\/\/doi.org\/10.1093\/nar\/gkp892.","journal-title":"Nucleic Acids Res"},{"key":"256_CR40","doi-asserted-by":"publisher","unstructured":"Jabbari H, Condon A. A fast and robust iterative algorithm for prediction of RNA pseudoknotted secondary structures. BMC Bioinformatics 2014;15. https:\/\/doi.org\/10.1186\/1471-2105-15-147","DOI":"10.1186\/1471-2105-15-147"},{"key":"256_CR41","doi-asserted-by":"publisher","unstructured":"Gray M, Chester S, Jabbari H. KnotAli: informed energy minimization through the use of evolutionary information. BMC Bioinformat. 2022; 23. https:\/\/doi.org\/10.1186\/s12859-022-04673-3","DOI":"10.1186\/s12859-022-04673-3"},{"key":"256_CR42","unstructured":"Fog A. Optimizing Software in C++. (2023). https:\/\/www.agner.org\/optimize."}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-024-00256-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13015-024-00256-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-024-00256-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T08:03:21Z","timestamp":1722326601000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-024-00256-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,3]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1186\/s13015-024-00256-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3679534\/v1","asserted-by":"object"}]},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,3]]},"assertion":[{"value":"29 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2024","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":"9"}}