{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:28:46Z","timestamp":1781216926577,"version":"3.54.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>With the rapid development of accurate sequencing and assembly technologies, an increasing number of high-quality chromosome-level and haplotype-resolved assemblies of genomic sequences have been derived, from which there will be great opportunities for computational pangenomics. Although genome graphs are among the most useful models for pangenome representation, their structural complexity makes it difficult to present genome information intuitively, such as the linear reference genome. Thus, efficiently and accurately analyzing the genome graph spatial structure and coordinating the information remains a substantial challenge.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>We developed a new method, a colored superbubble (<jats:italic>cSupB<\/jats:italic>), that can overcome the complexity of graphs and organize a set of species- or population-specific haplotype sequences of interest. Based on this model, we propose a tri-tuple coordinate system that combines an offset value, topological structure and sample information. Additionally, <jats:italic>cSupB<\/jats:italic> provides a novel method that utilizes complete topological information and efficiently detects small indels (&lt;\u200950\u00a0bp) for highly similar samples, which can be validated by simulated datasets. Moreover, we demonstrated that <jats:italic>cSupB<\/jats:italic> can adapt to the complex cycle structure.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusions<\/jats:title>\n                <jats:p>Although the solution is made suitable for increasingly complex genome graphs by relaxing the constraint, the directed acyclic graph, the motif cSupB and the <jats:italic>cSupB<\/jats:italic> method can be extended to any colored directed acyclic graph. We anticipate that our method will facilitate the analysis of individual haplotype variants and population genomic diversity. We have developed a C\u2009+\u2009\u2009+\u2009program for implementing our method that is available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/eggleader\/cSupB\">https:\/\/github.com\/eggleader\/cSupB<\/jats:ext-link><jats:underline>.<\/jats:underline><\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-021-04149-w","type":"journal-article","created":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T19:02:52Z","timestamp":1622142172000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A tri-tuple coordinate system derived for fast and accurate analysis of the colored de Bruijn graph-based pangenomes"],"prefix":"10.1186","volume":"22","author":[{"given":"Jindan","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erli","family":"Pang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongtao","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5993-1972","authenticated-orcid":false,"given":"Kui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,27]]},"reference":[{"issue":"5","key":"4149_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.gpb.2015.08.002","volume":"13","author":"A Rhoads","year":"2015","unstructured":"Rhoads A, Au KF. PacBio sequencing and its applications. Genomics Proteomics Bioinformatics. 2015;13(5):278\u201389.","journal-title":"Genomics Proteomics Bioinformatics"},{"issue":"9","key":"4149_CR2","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.tig.2018.05.008","volume":"34","author":"EL van Dijk","year":"2018","unstructured":"van Dijk EL, Jaszczyszyn Y, Naquin D, Thermes C. The third revolution in sequencing technology. Trends Genet. 2018;34(9):666\u201381.","journal-title":"Trends Genet"},{"issue":"19","key":"4149_CR3","doi-asserted-by":"publisher","first-page":"3547","DOI":"10.1093\/bioinformatics\/btz272","volume":"35","author":"G Kucherov","year":"2019","unstructured":"Kucherov G. Evolution of biosequence search algorithms: a brief survey. Bioinformatics. 2019;35(19):3547\u201352.","journal-title":"Bioinformatics"},{"key":"4149_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4939-7463-4_2","volume":"1704","author":"T Zekic","year":"2018","unstructured":"Zekic T, Holley G, Stoye J. Pan-genome storage and analysis techniques. Methods Mol Biol. 2018;1704:29\u201353.","journal-title":"Methods Mol Biol"},{"issue":"1","key":"4149_CR5","first-page":"118","volume":"19","author":"C Computational Pan-Genomics","year":"2018","unstructured":"Computational Pan-Genomics C. Computational pan-genomics: status, promises and challenges. Brief Bioinform. 2018;19(1):118\u201335.","journal-title":"Brief Bioinform"},{"issue":"5","key":"4149_CR6","first-page":"485","volume":"76","author":"C Dreux","year":"2018","unstructured":"Dreux C, Maquart FX, Bonnefont-Rousselot D, Delpech M, Gueant JL, Le Bouc Y, Massoubre B, Porquet D, Rives N, Vigneron C. Medical biology in the face of the evolution of health care needs. Ann Biol Clin (Paris). 2018;76(5):485\u201391.","journal-title":"Ann Biol Clin (Paris)"},{"key":"4149_CR7","doi-asserted-by":"crossref","unstructured":"Azarian T, Huang IT, Hanage WP: structure and dynamics of bacterial populations: pangenome ecology. In: The Pangenome: Diversity, Dynamics and Evolution of Genomes. Edited by Tettelin H, Medini D. Cham (CH); 2020: 115\u2013128.","DOI":"10.1007\/978-3-030-38281-0_5"},{"issue":"20","key":"4149_CR8","doi-asserted-by":"publisher","first-page":"R1094","DOI":"10.1016\/j.cub.2019.08.012","volume":"29","author":"MA Brockhurst","year":"2019","unstructured":"Brockhurst MA, Harrison E, Hall JPJ, Richards T, McNally A, MacLean C. The ecology and evolution of pangenomes. Curr Biol. 2019;29(20):R1094\u2013103.","journal-title":"Curr Biol"},{"issue":"8","key":"4149_CR9","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1038\/s41587-019-0199-7","volume":"37","author":"A Ameur","year":"2019","unstructured":"Ameur A. Goodbye reference, hello genome graphs. Nat Biotechnol. 2019;37(8):866\u20138.","journal-title":"Nat Biotechnol"},{"issue":"2","key":"4149_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/s41588-018-0316-4","volume":"51","author":"G Rakocevic","year":"2019","unstructured":"Rakocevic G, Semenyuk V, Lee WP, Spencer J, Browning J, Johnson IJ, Arsenijevic V, Nadj J, Ghose K, Suciu MC, et al. Fast and accurate genomic analyses using genome graphs. Nat Genet. 2019;51(2):354\u201362.","journal-title":"Nat Genet"},{"issue":"1","key":"4149_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"PA Pevzner","year":"1989","unstructured":"Pevzner PA. 1-Tuple DNA sequencing: computer analysis. J Biomol Struct Dyn. 1989;7(1):63\u201373.","journal-title":"J Biomol Struct Dyn"},{"issue":"5","key":"4149_CR12","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1101\/gr.082784.108","volume":"19","author":"MA Alekseyev","year":"2009","unstructured":"Alekseyev MA, Pevzner PA. Breakpoint graphs and ancestral genome reconstructions. Genome Res. 2009;19(5):943\u201357.","journal-title":"Genome Res"},{"issue":"5","key":"4149_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1101\/gr.214155.116","volume":"27","author":"B Paten","year":"2017","unstructured":"Paten B, Novak AM, Eizenga JM, Garrison E. Genome graphs and the evolution of genome inference. Genome Res. 2017;27(5):665\u201376.","journal-title":"Genome Res"},{"issue":"14","key":"4149_CR14","doi-asserted-by":"publisher","first-page":"i118","DOI":"10.1093\/bioinformatics\/btx236","volume":"33","author":"Y Rosen","year":"2017","unstructured":"Rosen Y, Eizenga J, Paten B. Modelling haplotypes with respect to reference cohort variation graphs. Bioinformatics. 2017;33(14):i118\u201323.","journal-title":"Bioinformatics"},{"issue":"1","key":"4149_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1186\/s13059-020-02157-2","volume":"21","author":"M Rautiainen","year":"2020","unstructured":"Rautiainen M, Marschall T. GraphAligner: rapid and versatile sequence-to-graph alignment. Genome Biol. 2020;21(1):253.","journal-title":"Genome Biol"},{"key":"4149_CR16","doi-asserted-by":"crossref","unstructured":"Rasko DA, Rosovitz MJ, Myers GS, Mongodin EF, Fricke WF, Gajer P, Crabtree J, Sebaihia M, Thomson NR, Chaudhuri R et al: The pangenome structure of Escherichia coli: comparative genomic analysis of E. coli commensal and pathogenic isolates. J Bacteriol 2008, 190(20):6881\u20136893.","DOI":"10.1128\/JB.00619-08"},{"issue":"1","key":"4149_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1186\/s12864-017-4401-3","volume":"19","author":"C Jandrasits","year":"2018","unstructured":"Jandrasits C, Dabrowski PW, Fuchs S, Renard BY. seq-seq-pan: building a computational pan-genome data structure on whole genome alignment. BMC Genom. 2018;19(1):47.","journal-title":"BMC Genom"},{"issue":"8","key":"4149_CR18","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1038\/s41587-019-0201-4","volume":"37","author":"D Kim","year":"2019","unstructured":"Kim D, Paggi JM, Park C, Bennett C, Salzberg SL. Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype. Nat Biotechnol. 2019;37(8):907\u201315.","journal-title":"Nat Biotechnol"},{"issue":"1","key":"4149_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1186\/s12859-017-1678-9","volume":"18","author":"KD Rand","year":"2017","unstructured":"Rand KD, Grytten I, Nederbragt AJ, Storvik GO, Glad IK, Sandve GK. Coordinates and intervals in graph-based reference genomes. BMC Bioinformatics. 2017;18(1):263.","journal-title":"BMC Bioinformatics"},{"issue":"5","key":"4149_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1089\/cmb.2014.0146","volume":"22","author":"N Nguyen","year":"2015","unstructured":"Nguyen N, Hickey G, Zerbino DR, Raney B, Earl D, Armstrong J, Kent WJ, Haussler D, Paten B. Building a pan-genome reference for a population. J Comput Biol. 2015;22(5):387\u2013401.","journal-title":"J Comput Biol"},{"key":"4149_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/s13015-018-0133-4","volume":"13","author":"F Gartner","year":"2018","unstructured":"Gartner F, Honer Z, Siederdissen C, Muller L, Stadler PF. Coordinate systems for supergenomes. Algorithms Mol Biol. 2018;13:15.","journal-title":"Algorithms Mol Biol"},{"key":"4149_CR22","unstructured":"Heng Li XF, Chong C: The design and construction of reference pangenome graphs. Method 2020."},{"key":"4149_CR23","doi-asserted-by":"crossref","unstructured":"Onodera T, Sadakane K, Shibuya T. Detecting superbubbles in assembly graphs; 2013.","DOI":"10.1007\/978-3-642-40453-5_26"},{"issue":"7","key":"4149_CR24","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1089\/cmb.2017.0251","volume":"25","author":"B Paten","year":"2018","unstructured":"Paten B, Eizenga JM, Rosen YM, Novak AM, Garrison E, Hickey G. Superbubbles, ultrabubbles, and cacti. J Comput Biol. 2018;25(7):649\u201363.","journal-title":"J Comput Biol"},{"issue":"5","key":"4149_CR25","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"DR Zerbino","year":"2008","unstructured":"Zerbino DR, Birney E. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 2008;18(5):821\u20139.","journal-title":"Genome Res"},{"issue":"2","key":"4149_CR26","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1038\/ng.1028","volume":"44","author":"Z Iqbal","year":"2012","unstructured":"Iqbal Z, Caccamo M, Turner I, Flicek P, McVean G. De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat Genet. 2012;44(2):226\u201332.","journal-title":"Nat Genet"},{"issue":"2","key":"4149_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1093\/bioinformatics\/bts673","volume":"29","author":"Z Iqbal","year":"2013","unstructured":"Iqbal Z, Turner I, McVean G. High-throughput microbial population genomics using the Cortex variation assembler. Bioinformatics. 2013;29(2):275\u20136.","journal-title":"Bioinformatics"},{"issue":"4","key":"4149_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1093\/bioinformatics\/btq697","volume":"27","author":"TC Conway","year":"2011","unstructured":"Conway TC, Bromage AJ. Succinct data structures for assembling large genomes. Bioinformatics. 2011;27(4):479\u201386.","journal-title":"Bioinformatics"},{"issue":"1","key":"4149_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/1748-7188-8-22","volume":"8","author":"R Chikhi","year":"2013","unstructured":"Chikhi R, Rizk G. Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms Mol Biol. 2013;8(1):22.","journal-title":"Algorithms Mol Biol"},{"issue":"5","key":"4149_CR30","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1089\/cmb.2014.0160","volume":"22","author":"R Chikhi","year":"2015","unstructured":"Chikhi R, Limasset A, Jackman S, Simpson JT, Medvedev P. On the representation of de Bruijn graphs. J Comput Biol. 2015;22(5):336\u201352.","journal-title":"J Comput Biol"},{"issue":"24","key":"4149_CR31","doi-asserted-by":"publisher","first-page":"3476","DOI":"10.1093\/bioinformatics\/btu756","volume":"30","author":"S Marcus","year":"2014","unstructured":"Marcus S, Lee H, Schatz MC. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips. Bioinformatics. 2014;30(24):3476\u201383.","journal-title":"Bioinformatics"},{"key":"4149_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/s13015-016-0066-8","volume":"11","author":"G Holley","year":"2016","unstructured":"Holley G, Wittler R, Stoye J. Bloom filter trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms Mol Biol. 2016;11:3.","journal-title":"Algorithms Mol Biol"},{"issue":"20","key":"4149_CR33","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1093\/bioinformatics\/btx067","volume":"33","author":"MD Muggli","year":"2017","unstructured":"Muggli MD, Bowe A, Noyes NR, Morley PS, Belk KE, Raymond R, Gagie T, Puglisi SJ, Boucher C. Succinct colored de Bruijn graphs. Bioinformatics. 2017;33(20):3181\u20137.","journal-title":"Bioinformatics"},{"key":"4149_CR34","first-page":"1811","volume":"18","author":"PP FatemehAlmodaresi","year":"2017","unstructured":"FatemehAlmodaresi PP, Rob P. Rainbowfish- a succinct colored de bruijn graph representation. Bioinformatics. 2017;18:1811\u20135.","journal-title":"Bioinformatics"},{"issue":"13","key":"4149_CR35","doi-asserted-by":"publisher","first-page":"i169","DOI":"10.1093\/bioinformatics\/bty292","volume":"34","author":"F Almodaresi","year":"2018","unstructured":"Almodaresi F, Sarkar H, Srivastava A, Patro R. A space and time-efficient index for the compacted colored de Bruijn graph. Bioinformatics. 2018;34(13):i169\u201377.","journal-title":"Bioinformatics"},{"issue":"4","key":"4149_CR36","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1089\/cmb.2019.0322","volume":"27","author":"F Almodaresi","year":"2020","unstructured":"Almodaresi F, Pandey P, Ferdman M, Johnson R, Patro R. An efficient, scalable, and exact representation of high-dimensional color information enabled using de bruijn graph search. J Comput Biol. 2020;27(4):485\u201399.","journal-title":"J Comput Biol"},{"issue":"1","key":"4149_CR37","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1186\/s13059-020-02135-8","volume":"21","author":"G Holley","year":"2020","unstructured":"Holley G, Melsted P. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs. Genome Biol. 2020;21(1):249.","journal-title":"Genome Biol"},{"issue":"14","key":"4149_CR38","doi-asserted-by":"publisher","first-page":"i51","DOI":"10.1093\/bioinformatics\/btz350","volume":"35","author":"MD Muggli","year":"2019","unstructured":"Muggli MD, Alipanahi B, Boucher C. Building large updatable colored de Bruijn graphs via merging. Bioinformatics. 2019;35(14):i51\u201360.","journal-title":"Bioinformatics"},{"key":"4149_CR39","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.tcs.2015.10.021","volume":"609","author":"L Brankovic","year":"2016","unstructured":"Brankovic L, Iliopoulos CS, Kundu R, Mohamed M, Pissis SP, Vayani F. Linear-time superbubble identification algorithm for genome assembly. Theoret Comput Sci. 2016;609:374\u201383.","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"4149_CR40","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TCBB.2014.2385696","volume":"12","author":"WK Sung","year":"2015","unstructured":"Sung WK, Sadakane K, Shibuya T, Belorkar A, Pyrogova I. An O(m log m)-time algorithm for detecting superbubbles. IEEE\/ACM Trans Comput Biol Bioinform. 2015;12(4):770\u20137.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"4149_CR41","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s13015-018-0134-3","volume":"13","author":"F Gartner","year":"2018","unstructured":"Gartner F, Muller L, Stadler PF. Superbubbles revisited. Algorithms Mol Biol. 2018;13:16.","journal-title":"Algorithms Mol Biol"},{"issue":"2","key":"4149_CR42","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1038\/13779","volume":"23","author":"RM Andrews","year":"1999","unstructured":"Andrews RM, Kubacka I, Chinnery PF, Lightowlers RN, Turnbull DM, Howell N. Reanalysis and revision of the Cambridge reference sequence for human mitochondrial DNA. Nat Genet. 1999;23(2):147.","journal-title":"Nat Genet"},{"issue":"5","key":"4149_CR43","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1093\/nar\/gkh340","volume":"32","author":"RC Edgar","year":"2004","unstructured":"Edgar RC. MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 2004;32(5):1792\u20137.","journal-title":"Nucleic Acids Res"},{"issue":"14","key":"4149_CR44","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K Katoh","year":"2002","unstructured":"Katoh K, Misawa K, Kuma K, Miyata T. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 2002;30(14):3059\u201366.","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"4149_CR45","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/pro.3290","volume":"27","author":"F Sievers","year":"2018","unstructured":"Sievers F, Higgins DG. Clustal Omega for making accurate alignments of many protein sequences. Protein Sci. 2018;27(1):135\u201345.","journal-title":"Protein Sci"},{"issue":"3","key":"4149_CR46","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1093\/bioinformatics\/btq665","volume":"27","author":"SV Angiuoli","year":"2011","unstructured":"Angiuoli SV, Salzberg SL. Mugsy: fast multiple alignment of closely related whole genomes. Bioinformatics. 2011;27(3):334\u201342.","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04149-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-021-04149-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04149-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T20:11:54Z","timestamp":1622146314000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-021-04149-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,27]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4149"],"URL":"https:\/\/doi.org\/10.1186\/s12859-021-04149-w","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,27]]},"assertion":[{"value":"31 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"282"}}