{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:05:47Z","timestamp":1770753947441,"version":"3.50.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RGPIN-249834"],"award-info":[{"award-number":["RGPIN-249834"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The classical gene and species tree reconciliation, used to infer the history of gene gain and loss explaining the evolution of gene families, assumes an independent evolution for each family. While this assumption is reasonable for genes that are far apart in the genome, it is not appropriate for genes grouped into syntenic blocks, which are more plausibly the result of a concerted evolution. Here, we introduce the<jats:italic>Super-Reconciliation<\/jats:italic>problem which consists in inferring a history of segmental duplication and loss events (involving a set of neighboring genes) leading to a set of present-day syntenies from a single ancestral one. In other words, we extend the traditional Duplication-Loss reconciliation problem of a single gene tree, to a set of trees, accounting for segmental duplications and losses. Existency of a Super-Reconciliation depends on individual gene tree consistency. In addition, ignoring rearrangements implies that existency also depends on gene order consistency. We first show that\u00a0the problem of reconstructing a most parsimonious Super-Reconciliation, if any, is NP-hard and give an exact exponential-time algorithm to solve it. Alternatively, we show that accounting for rearrangements in the evolutionary model, but still only minimizing segmental duplication and loss events, leads to an exact polynomial-time algorithm. We finally assess time efficiency of the former exponential time algorithm for the Duplication-Loss model on simulated datasets, and give a proof of concept on the opioid receptor genes.<\/jats:p>","DOI":"10.1186\/s13015-020-00171-4","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T04:02:22Z","timestamp":1590465742000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Evolution through segmental duplications and losses: a Super-Reconciliation approach"],"prefix":"10.1186","volume":"15","author":[{"given":"Matt\u00e9o","family":"Delabre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina T.","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Moulton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Noutahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel Sautie","family":"Castellanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"171_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool. 1979;28:132\u201363.","journal-title":"Syst Zool"},{"key":"171_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","volume":"4","author":"LX Zhang","year":"1997","unstructured":"Zhang LX. On Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. J Comput Biol. 1997;4:177\u201388.","journal-title":"J Comput Biol"},{"key":"171_CR3","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1093\/bioinformatics\/17.9.821","volume":"17","author":"CM Zmasek","year":"2001","unstructured":"Zmasek CM, Eddy SR. A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics. 2001;17:821\u20138.","journal-title":"Bioinformatics"},{"issue":"12","key":"171_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012;28(12):283\u201391. https:\/\/doi.org\/10.1093\/bioinformatics\/bts225.","journal-title":"Bioinformatics"},{"issue":"5","key":"171_CR5","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1093\/bib\/bbr045","volume":"12","author":"JP Doyon","year":"2011","unstructured":"Doyon JP, Ranwez V, Daubin V, Berry V. Models, algorithms and programs for phylogeny reconciliation. Briefings Bioinf. 2011;12(5):392\u2013400.","journal-title":"Briefings Bioinf"},{"issue":"2","key":"171_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh A, Hallett M, Lagergren J. Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans Comput BiolBioinf. 2011;8(2):517\u201335. https:\/\/doi.org\/10.1109\/TCBB.2010.14.","journal-title":"IEEE\/ACM Trans Comput BiolBioinf"},{"key":"171_CR7","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1089\/cmb.2008.0092","volume":"15","author":"B Vernot","year":"2009","unstructured":"Vernot B, Stolzer M, Goldman A, Durand D. Reconciliation with non-binary species trees. J Comput Biol. 2009;15:981\u20131006.","journal-title":"J Comput Biol"},{"key":"171_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1101\/gr.161968.113","volume":"24","author":"YC Wu","year":"2014","unstructured":"Wu YC, Rasmussen MD, Bansal MS, Kellis M. Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees. Genome Res. 2014;24:475\u201386.","journal-title":"Genome Res"},{"issue":"14","key":"171_CR9","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1073\/pnas.0806251106","volume":"106","author":"O Akerborg","year":"2009","unstructured":"Akerborg O, Sennblad B, Arvestad L, Lagergren J. Simultaneous bayesian gene tree reconstruction and reconciliation analysis. Proc Natl Acad Sci USA. 2009;106(14):5714\u20139.","journal-title":"Proc Natl Acad Sci USA"},{"issue":"3","key":"171_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1093\/sysbio\/syu007","volume":"63","author":"J Sj\u00f6strand","year":"2014","unstructured":"Sj\u00f6strand J, Tofigh A, Daubin V, Arvestad L, Sennblad B, Lagergren J. A bayesian method for analyzing lateral gene transfer. Syst Biol. 2014;63(3):409\u201320.","journal-title":"Syst Biol"},{"issue":"1","key":"171_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1093\/sysbio\/syu048","volume":"64","author":"GJ Sz\u00f6ll\u0151si","year":"2014","unstructured":"Sz\u00f6ll\u0151si GJ, Tannier Daubin V, Boussau B. The inference of gene trees with species trees. Syst Biol. 2014;64(1):42\u201362.","journal-title":"Syst Biol"},{"key":"171_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1186\/1471-2148-8-184","volume":"8","author":"TA Larsson","year":"2008","unstructured":"Larsson TA, Olsson F, Sundstrom G, Lundin LG, Brenner S, Venkatesh B, Larhammar D. Early vertebrate chromosome duplications and the evolution of the neuropeptide y receptor gene regions. BMC Evol Biol. 2008;8:184.","journal-title":"BMC Evol Biol"},{"key":"171_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1186\/1471-2148-7-239","volume":"7","author":"AA Abbasi","year":"2007","unstructured":"Abbasi AA, Grzeschik KH. An insight into the phylogenetic history of hox linked gene families in vertebrates. BMC Evol Biol. 2007;7:239.","journal-title":"BMC Evol Biol"},{"key":"171_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3389\/fevo.2016.00036","volume":"4","author":"DEK Ferrier","year":"2016","unstructured":"Ferrier DEK. Evolution of homeobox gene clusters in animals: the giga-cluster and primary vs. secondary clustering. Front Ecol Evol. 2016;4:34.","journal-title":"Front Ecol Evol"},{"key":"171_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1038\/nrg1723","volume":"6","author":"J Garcia-Fern\u00e0ndez","year":"2005","unstructured":"Garcia-Fern\u00e0ndez J. The genesis and evolution of homeobox gene clusters. Nat Rev Genet. 2005;6:881\u201392.","journal-title":"Nat Rev Genet"},{"key":"171_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ympev.2014.09.009","volume":"81","author":"W Ajmal","year":"2014","unstructured":"Ajmal W, Khan H, Abbasi AA. Phylogenetic investigation of human FGFR-bearing paralogons favors piecemeal duplication theory of vertebrate genome evolution. Mol Phylogenet Evol. 2014;81:49\u201360.","journal-title":"Mol Phylogenet Evol"},{"key":"171_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ympev.2015.08.019","volume":"94","author":"M Hafeez","year":"2016","unstructured":"Hafeez M, Shabbir M, Altaf F, Abbasi AA. Phylogenomic analysis reveals ancient segmental duplications in the human genome. Mol Phylogenet Evol. 2016;94:95\u2013100.","journal-title":"Mol Phylogenet Evol"},{"issue":"40","key":"171_CR18","doi-asserted-by":"publisher","first-page":"15487","DOI":"10.1073\/pnas.0805590105","volume":"105","author":"S Dreborg","year":"2008","unstructured":"Dreborg S, Sundstrom G, Larsson TA, Larhammar D. Evolution of vertebrate opioid receptors. Proc Natl Acad Sci USA. 2008;105(40):15487\u201392.","journal-title":"Proc Natl Acad Sci USA"},{"key":"171_CR19","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.2741\/3306","volume":"14","author":"CW Stevens","year":"2009","unstructured":"Stevens CW. The evolution of vertebrate opioid receptors. Front Biosci. 2009;14:1247\u201369.","journal-title":"Front Biosci"},{"key":"171_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1371\/journal.pone.0010512","volume":"5","author":"G Sundstrom","year":"2010","unstructured":"Sundstrom G, Dreborg S, Larhammar D. Concomitant duplications of opioid peptide and receptor genes before the origin of jawed vertebrates. PLoS ONE. 2010;5:5.","journal-title":"PLoS ONE."},{"issue":"18","key":"171_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1093\/bioinformatics\/bts374","volume":"28","author":"S B\u00e9rard","year":"2012","unstructured":"B\u00e9rard S, Gallien C, Boussau B, Szollosi GJ, Daubin V, Tannier E. Evolution of gene neighborhoods within reconciled phylogenies. Bioinformatics. 2012;28(18):382\u20138.","journal-title":"Bioinformatics"},{"issue":"5","key":"171_CR22","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/gbe\/evx069","volume":"9","author":"Y Anselmetti","year":"2017","unstructured":"Anselmetti Y, Patterson M, Ponty Y, B\u00e9rard S, Chauve C, Scornavacca C, Daubin V. DeCoSTAR: Reconstructing the ancestral organization of genes or genomes using reconciled phylogenies. Genome Biol Evol. 2017;9(5):1312\u20139.","journal-title":"Genome Biol Evol"},{"key":"171_CR23","unstructured":"Duchemin W. Phylogeny of dependencies and dependencies of phylogenies in genes and genomes. Theses, Universit\u00e9 de Lyon (December 2017). https:\/\/tel.archives-ouvertes.fr\/tel-01779517"},{"issue":"5","key":"171_CR24","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1109\/TCBB.2017.2706679","volume":"15","author":"J Paszek","year":"2017","unstructured":"Paszek J, Gorecki P. Efficient algorithms for genomic duplication models. IEEE\/ACM Trans Comput Biol Bioinform. 2017;15(5):1515\u201324.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"171_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/s13015-019-0139-6","volume":"14","author":"R Dondi","year":"2019","unstructured":"Dondi R, Lafond M, Scornavacca C. Reconciling multiple genes trees via segmental duplications and losses. Algorith Mol Biol. 2019;14:25.","journal-title":"Algorith Mol Biol"},{"issue":"3","key":"171_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho AV, Yehoshua S, Szymanski TG, Ullman JD. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J Comput. 1981;10(3):405\u201321.","journal-title":"SIAM J Comput"},{"key":"171_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01202270","volume":"12","author":"M Constantinescu","year":"1995","unstructured":"Constantinescu M, Sankoff D. An efficient algorithm for supertrees. J Classif. 1995;12:101\u201312.","journal-title":"J Classif"},{"key":"171_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"MP Ng","year":"1996","unstructured":"Ng MP, Wormald NC. Reconstruction of rooted trees from subtrees. Discrete Appl Math. 1996;69:19\u201331.","journal-title":"Discrete Appl Math"},{"key":"171_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00250-0","volume":"127","author":"C Semple","year":"2003","unstructured":"Semple C. Reconstructing minimal rooted trees. Discrete Appl Math. 2003;127:3.","journal-title":"Discrete Appl Math"},{"key":"171_CR30","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s12864-014-1196-3","volume":"16","author":"M Lafond","year":"2015","unstructured":"Lafond M, Ouangraoua A, El-Mabrouk N. Reconstructing a supergenetree minimizing reconciliation. BMC Genom. 2015;16:4.","journal-title":"BMC Genom"},{"issue":"2","key":"171_CR31","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G Pruesse","year":"1994","unstructured":"Pruesse G, Ruskey F. Generating linear extensions fast. SIAM J Comput. 1994;23(2):373\u201386.","journal-title":"SIAM J Comput"},{"issue":"3","key":"171_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell G, Winkler P. Counting linear extensions. Order. 1991;8(3):225\u201342.","journal-title":"Order"},{"key":"171_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1093\/bioinformatics\/17.suppl_1.S165","volume":"17","author":"B Moret","year":"2001","unstructured":"Moret B, Wang L, Warnow T, Wyman S. New approaches for reconstructing phylogenies from gene order data. Bioinformatics. 2001;17:165\u201373.","journal-title":"Bioinformatics"},{"key":"171_CR34","first-page":"26","volume":"12","author":"G Bourque","year":"2002","unstructured":"Bourque G, Pevzner PA. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 2002;12:26\u201336.","journal-title":"Genome Res"},{"key":"171_CR35","doi-asserted-by":"publisher","first-page":"1000234","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C Chauve","year":"2008","unstructured":"Chauve C, Tannier E. A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genomes. PloS Comput Biol. 2008;4:1000234.","journal-title":"PloS Comput Biol"},{"key":"171_CR36","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1101\/gr.5383506","volume":"16","author":"J Ma","year":"2007","unstructured":"Ma J, Zhang L, Suh BB, Raney BJ, Burhans RC, Kent WJ, Blanchette M, Haussler D, Miller W. Reconstructing contiguous regions of an ancestral genome. Genome Res. 2007;16:1557\u201365.","journal-title":"Genome Res"},{"key":"171_CR37","first-page":"251","volume-title":"Lecture Notes in Computer Science","author":"David Sankoff","year":"1997","unstructured":"Sankoff D, Blanchette M. The median problem for breakpoints in comparative genomics. In: Jiang, T., Lee, D.T. (eds.) Computing and combinatorics, proceeedings of COCOON \u201997. Lecture notes in computer science. Berlin: Springer; 1997, pp. 251\u201363."},{"key":"171_CR38","unstructured":"Bergeron A, Mixtacki J, Stoye J. Hp distance via double cut and join distance. In: Ferragina, P., Landau, G. (eds.) Combinatorial Pattern Matching. CPM \u201808. Lecture Notes in Computer Science, vol. 5029. 2008."},{"key":"171_CR39","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1016\/j.tcs.2009.09.008","volume":"410","author":"A Bergeron","year":"2009","unstructured":"Bergeron A, Mixtacki J, Stoye J. A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theor Comput Sci. 2009;410:5300\u201316.","journal-title":"Theor Comput Sci"},{"key":"171_CR40","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier E, Sankoff D. Multichromosomal median and halving problems under different genomic distances. BMC Bioinf. 2009;10:120.","journal-title":"BMC Bioinf"},{"key":"171_CR41","first-page":"291","volume-title":"Genome rearrangement with gene families. Mathematics of evolution and phylogeny","author":"N El-Mabrouk","year":"2005","unstructured":"El-Mabrouk N. Genome rearrangement with gene families. Mathematics of evolution and phylogeny. Oxford: Oxford University Press; 2005. p. 291\u2013320."},{"key":"171_CR42","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of genome rearrangements","author":"G Fertin","year":"2009","unstructured":"Fertin G, Labarre A, Rusu I, Tannier E, Vialette S. Combinatorics of genome rearrangements. Cambridge, Massachusetts, London, England: The MIT Press; 2009."},{"issue":"22","key":"171_CR43","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"JD Thompson","year":"1994","unstructured":"Thompson JD, Higgins DG, Gibson TJ. Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 1994;22(22):4673\u201380.","journal-title":"Nucleic Acids Res"},{"issue":"7","key":"171_CR44","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1093\/molbev\/msw054","volume":"33","author":"S Kumar","year":"2016","unstructured":"Kumar S, Stecher G, Tamura K. Molecular evolutionary genetics analysis version 7.0 for bigger datasets. Mol Biol Evol. 2016;33(7):1870\u20134.","journal-title":"Mol Biol Evol"},{"key":"171_CR45","doi-asserted-by":"crossref","unstructured":"Scornavacca C, Berry V, Ranwez V. From gene trees to species trees through a supertree approach. In: LATA 2009.","DOI":"10.1007\/978-3-642-00982-2_60"},{"issue":"1","key":"171_CR46","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1186\/1748-7188-8-28","volume":"8","author":"R Chaudhary","year":"2013","unstructured":"Chaudhary R, Burleigh JG, Fern\u00e1ndez-Baca D. Inferring species trees from incongruent multi-copy gene trees using the robinson-foulds distance. Algorith Mol Biol. 2013;8(1):28. https:\/\/doi.org\/10.1186\/1748-7188-8-28.","journal-title":"Algorith Mol Biol"},{"issue":"1","key":"171_CR47","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1186\/1748-7188-5-18","volume":"5","author":"MS Bansal","year":"2010","unstructured":"Bansal MS, Burleigh JG, Eulenstein O, Fern\u00e1ndez-Baca D. Robinson-foulds supertrees. Algorith Mol Biol. 2010;5(1):18. https:\/\/doi.org\/10.1186\/1748-7188-5-18.","journal-title":"Algorith Mol Biol"},{"issue":"1","key":"171_CR48","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1186\/1748-7188-8-18","volume":"8","author":"A Deepak","year":"2013","unstructured":"Deepak A, Fern\u00e1ndez-Baca D, McMahon MM. Extracting conflict-free information from multi-labeled trees. Algorithm Mol Biol. 2013;8(1):18. https:\/\/doi.org\/10.1186\/1748-7188-8-18.","journal-title":"Algorithm Mol Biol"},{"issue":"4","key":"171_CR49","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer I. The NP-completeness of edge-coloring. SIAM J Comput. 1981;10(4):718\u201320.","journal-title":"SIAM J Comput"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-020-00171-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13015-020-00171-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-020-00171-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:14:18Z","timestamp":1722939258000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-020-00171-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1186\/s13015-020-00171-4","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,26]]},"assertion":[{"value":"26 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"12"}}