{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T03:06:58Z","timestamp":1781147218241,"version":"3.54.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T00:00:00Z","timestamp":1578096000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1535977"],"award-info":[{"award-number":["CCF-1535977"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ABI-1458652"],"award-info":[{"award-number":["ABI-1458652"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1513629"],"award-info":[{"award-number":["IIS-1513629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ira and Debra Cohen Fellowship"}],"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:sec>\n<jats:title>Motivation<\/jats:title>\n<jats:p>Estimated gene trees are often inaccurate, due to insufficient phylogenetic signal in the single gene alignment, among other causes. Gene tree correction aims to improve the accuracy of an estimated gene tree by using computational techniques along with auxiliary information, such as a reference species tree or sequencing data. However, gene trees and species trees can differ as a result of gene duplication and loss (GDL), incomplete lineage sorting (ILS), and other biological processes. Thus gene tree correction methods need to take estimation error as well as gene tree heterogeneity into account. Many prior gene tree correction methods have been developed for the case where GDL is present.<\/jats:p>\n<\/jats:sec><jats:sec>\n<jats:title>Results<\/jats:title>\n<jats:p>Here, we study the problem of gene tree correction where gene tree heterogeneity is instead due to ILS and\/or HGT. We introduce TRACTION, a simple polynomial time method that provably finds an optimal solution to the RF-optimal tree refinement and completion (RF-OTRC) Problem, which seeks a refinement and completion of a singly-labeled gene tree with respect to a given singly-labeled species tree so as to minimize the Robinson\u2212Foulds (RF) distance. Our extensive simulation study on 68,000 estimated gene trees shows that TRACTION matches or improves on the accuracy of well-established methods from the GDL literature when HGT and ILS are both present, and ties for best under the ILS-only conditions. Furthermore, TRACTION ties for fastest on these datasets. We also show that a naive generalization of the RF-OTRC problem to multi-labeled trees is possible, but can produce misleading results where gene tree heterogeneity is due to GDL.<\/jats:p>\n<\/jats:sec>","DOI":"10.1186\/s13015-019-0161-8","type":"journal-article","created":{"date-parts":[[2020,1,4]],"date-time":"2020-01-04T06:02:31Z","timestamp":1578117751000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Non-parametric correction of estimated gene trees using TRACTION"],"prefix":"10.1186","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5790-6266","authenticated-orcid":false,"given":"Sarah","family":"Christensen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erin K.","family":"Molloy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pranjal","family":"Vachaspati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ananya","family":"Yammanuru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-3514","authenticated-orcid":false,"given":"Tandy","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,4]]},"reference":[{"issue":"8","key":"161_CR1","doi-asserted-by":"publisher","first-page":"0159559","DOI":"10.1371\/journal.pone.0159559","volume":"11","author":"E Noutahi","year":"2016","unstructured":"Noutahi E, Semeria M, Lafond M, Seguin J, Boussau B, Gu\u00e9guen L, El-Mabrouk N, Tannier E. Efficient gene tree correction guided by genome evolution. PLoS ONE. 2016;11(8):0159559. https:\/\/doi.org\/10.1371\/journal.pone.0159559.","journal-title":"PLoS ONE"},{"issue":"6215","key":"161_CR2","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1126\/science.1253451","volume":"346","author":"ED Jarvis","year":"2014","unstructured":"Jarvis ED, Mirarab S, Aberer AJ, Li B, Houde P, Li C, Ho S, Faircloth BC, Nabholz B, Howard JT, et al. Whole-genome analyses resolve early branches in the tree of life of modern birds. Science. 2014;346(6215):1320\u201331. https:\/\/doi.org\/10.1126\/science.1253451.","journal-title":"Science"},{"issue":"2","key":"161_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/sysbio\/syx077","volume":"67","author":"EK Molloy","year":"2018","unstructured":"Molloy EK, Warnow T. To include or not to include: the impact of gene filtering on species tree estimation methods. Syst Biol. 2018;67(2):285\u2013303. https:\/\/doi.org\/10.1093\/sysbio\/syx077.","journal-title":"Syst Biol"},{"issue":"3","key":"161_CR4","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1093\/sysbio\/46.3.523","volume":"46","author":"W Maddison","year":"1997","unstructured":"Maddison W. Gene trees in species trees. Syst Biol. 1997;46(3):523\u201336. https:\/\/doi.org\/10.1093\/sysbio\/46.3.523.","journal-title":"Syst Biol"},{"issue":"1","key":"161_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1558-5646.2008.00549.x","volume":"63","author":"SV Edwards","year":"2009","unstructured":"Edwards SV. Is a new and general theory of molecular systematics emerging? Evolution. 2009;63(1):1\u201319. https:\/\/doi.org\/10.1111\/j.1558-5646.2008.00549.x.","journal-title":"Evolution"},{"issue":"1","key":"161_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1093\/sysbio\/sys076","volume":"62","author":"Y-C Wu","year":"2012","unstructured":"Wu Y-C, Rasmussen MD, Bansal MS, Kellis M. TreeFix: statistically informed gene tree error correction using species trees. Syst Biol. 2012;62(1):110\u201320. https:\/\/doi.org\/10.1093\/sysbio\/sys076.","journal-title":"Syst Biol"},{"issue":"8","key":"161_CR7","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1093\/bioinformatics\/btu806","volume":"31","author":"MS Bansal","year":"2015","unstructured":"Bansal MS, Wu Y-C, Alm EJ, Kellis M. Improved gene tree error correction in the presence of horizontal gene transfer. Bioinformatics. 2015;31(8):1211\u20138. https:\/\/doi.org\/10.1093\/bioinformatics\/btu806.","journal-title":"Bioinformatics"},{"issue":"3\u20134","key":"161_CR8","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1089\/106652700750050871","volume":"7","author":"K Chen","year":"2000","unstructured":"Chen K, Durand D, Farach-Colton M. NOTUNG: a program for dating gene duplications and optimizing gene family trees. J Comput Biol. 2000;7(3\u20134):429\u201347. https:\/\/doi.org\/10.1089\/106652700750050871.","journal-title":"J Comput Biol"},{"issue":"2","key":"161_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1089\/cmb.2006.13.320","volume":"13","author":"D Durand","year":"2006","unstructured":"Durand D, Halld\u00f3rsson BV, Vernot B. A hybrid micro? Macroevolutionary approach to gene tree reconstruction. J Comput Biol. 2006;13(2):320\u201335. https:\/\/doi.org\/10.1089\/cmb.2006.13.320.","journal-title":"J Comput Biol"},{"issue":"7","key":"161_CR10","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1093\/bioinformatics\/btw778","volume":"33","author":"E Jacox","year":"2017","unstructured":"Jacox E, Weller M, Tannier E, Scornavacca C. Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Bioinformatics. 2017;33(7):980\u20137. https:\/\/doi.org\/10.1093\/bioinformatics\/btw778.","journal-title":"Bioinformatics"},{"issue":"10","key":"161_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1471-2105-13-S10-S11","volume":"13","author":"R Chaudhary","year":"2012","unstructured":"Chaudhary R, Burleigh JG, Eulenstein O. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinform. 2012;13(10):11. https:\/\/doi.org\/10.1186\/1471-2105-13-S10-S11.","journal-title":"BMC Bioinform"},{"issue":"1","key":"161_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1748-7188-8-12","volume":"8","author":"TH Nguyen","year":"2013","unstructured":"Nguyen TH, Ranwez V, Pointet S, Chifolleau A-M, Doyon J-P, Berry V. Reconciliation and local gene tree rearrangement can be of mutual profit. Algorithms Mol Biol. 2013;8(1):1. https:\/\/doi.org\/10.1186\/1748-7188-8-12.","journal-title":"Algorithms Mol Biol"},{"issue":"6","key":"161_CR13","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1093\/sysbio\/syt054","volume":"62","author":"GJ Sz\u00f6ll\u0151si","year":"2013","unstructured":"Sz\u00f6ll\u0151si GJ, Rosikiewicz W, Boussau B, Tannier E, Daubin V. Efficient exploration of the space of reconciled gene trees. Syst Biol. 2013;62(6):901\u201312. https:\/\/doi.org\/10.1093\/sysbio\/syt054.","journal-title":"Syst Biol"},{"issue":"5","key":"161_CR14","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TCBB.2017.2720581","volume":"15","author":"M Lafond","year":"2018","unstructured":"Lafond M, Chauve C, El-Mabrouk N, Ouangraoua A. Gene tree construction and correction using supertree and reconciliation. IEEE\/ACM Trans Comput Biol Bioinform TCBB. 2018;15(5):1560\u201370. https:\/\/doi.org\/10.1109\/TCBB.2017.2720581.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform TCBB"},{"issue":"13","key":"161_CR15","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1093\/bioinformatics\/btw105","volume":"32","author":"E Jacox","year":"2016","unstructured":"Jacox E, Chauve C, Sz\u00f6ll\u0151si GJ, Ponty Y, Scornavacca C. ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics. 2016;32(13):2056\u20138. https:\/\/doi.org\/10.1093\/bioinformatics\/btw105.","journal-title":"Bioinformatics"},{"key":"161_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-05269-4_33","volume-title":"Research in computational molecular biology","author":"Y Zheng","year":"2014","unstructured":"Zheng Y, Zhang L. Reconciliation with non-binary gene trees revisited. In: Sharan R, editor. Research in computational molecular biology. Cham: Springer; 2014. p. 418\u201332. https:\/\/doi.org\/10.1007\/978-3-319-05269-4_33."},{"issue":"1\u20132","key":"161_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson DF, Foulds LR. Comparison of phylogenetic trees. Math Biosci. 1981;53(1\u20132):131\u201347. https:\/\/doi.org\/10.1016\/0025-5564(81)90043-2.","journal-title":"Math Biosci"},{"issue":"1","key":"161_CR18","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\u2212Foulds distance. Algorithms Mol Biol. 2013;8(1):28. https:\/\/doi.org\/10.1186\/1748-7188-8-28.","journal-title":"Algorithms Mol Biol"},{"issue":"3\u20134","key":"161_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0025-5564(75)90040-1","volume":"23","author":"GF Estabrook","year":"1975","unstructured":"Estabrook GF, Johnson C Jr, Mc Morris FR. An idealized concept of the true cladistic character. Math Biosci. 1975;23(3\u20134):263\u201372. https:\/\/doi.org\/10.1016\/0025-5564(75)90040-1.","journal-title":"Math Biosci"},{"issue":"1\u20132","key":"161_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0025-5564(76)90035-3","volume":"29","author":"GF Estabrook","year":"1976","unstructured":"Estabrook GF, Johnson C Jr, McMorris F. A mathematical foundation for the analysis of cladistic character compatibility. Math Biosci. 1976;29(1\u20132):181\u20137. https:\/\/doi.org\/10.1016\/0025-5564(76)90035-3.","journal-title":"Math Biosci"},{"key":"161_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF00276095","volume":"10","author":"GF Estabrook","year":"1980","unstructured":"Estabrook GF, McMorris F. When is one estimate of evolutionary relationships a refinement of another? J Math Biol. 1980;10:367\u201373.","journal-title":"J Math Biol"},{"issue":"3","key":"161_CR22","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.1994.1018","volume":"16","author":"TJ Warnow","year":"1994","unstructured":"Warnow TJ. Tree compatibility and inferring evolutionary history. J Algorithms. 1994;16(3):388\u2013407.","journal-title":"J Algorithms"},{"issue":"1","key":"161_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield D. Efficient algorithms for inferring evolutionary trees. Networks. 1991;21(1):19\u201328.","journal-title":"Networks"},{"issue":"5","key":"161_CR24","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00285-005-0365-z","volume":"52","author":"K Huber","year":"2006","unstructured":"Huber K, Moulton V. Phylogenetic networks from multi-labelled trees. J Math Biol. 2006;52(5):613\u201332.","journal-title":"J Math Biol"},{"issue":"1","key":"161_CR25","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s13015-018-0124-5","volume":"13","author":"S Christensen","year":"2018","unstructured":"Christensen S, Molloy EK, Vachaspati P, Warnow T. OCTAL: optimal completion of gene trees in polynomial time. Algorithms Mol Biol. 2018;13(1):6. https:\/\/doi.org\/10.1186\/s13015-018-0124-5.","journal-title":"Algorithms Mol Biol"},{"key":"161_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-00834-5_12","volume-title":"Comp Genomics","author":"MS Bansal","year":"2018","unstructured":"Bansal MS. Linear-time algorithms for some phylogenetic tree completion problems under Robinson\u2212Foulds distance. In: Blanchette M, Ouangraoua A, editors. Comp Genomics. Cham: Springer; 2018. p. 209\u201326. https:\/\/doi.org\/10.1007\/978-3-030-00834-5_12."},{"key":"161_CR27","unstructured":"Gawrychowski P, Landau GM, Sung W-K, Weimann O. A faster construction of phylogenetic consensus trees. arXiv preprint; 2017. arXiv:1705.10548."},{"issue":"4","key":"161_CR28","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1109\/TCBB.2006.57","volume":"3","author":"G Ganapathy","year":"2006","unstructured":"Ganapathy G, Goodson B, Jansen R, Le H-S, Ramachandran V, Warnow T. Pattern identification in biogeography. IEEE\/ACM Trans Comput Biol Bioinform TCBB. 2006;3(4):334\u201346. https:\/\/doi.org\/10.1109\/TCBB.2006.57.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform TCBB"},{"key":"161_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2164-16-S10-S1","volume":"16","author":"R Davidson","year":"2015","unstructured":"Davidson R, Vachaspati P, Mirarab S, Warnow T. Phylogenomic species tree estimation in the presence of incomplete lineage sorting and horizontal gene transfer. BMC Genomics. 2015;16:1. https:\/\/doi.org\/10.1186\/1471-2164-16-S10-S1.","journal-title":"BMC Genomics"},{"issue":"9","key":"161_CR30","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/bioinformatics\/btu033","volume":"30","author":"A Stamatakis","year":"2014","unstructured":"Stamatakis A. RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics. 2014;30(9):1312\u20133. https:\/\/doi.org\/10.1093\/bioinformatics\/btu033.","journal-title":"Bioinformatics"},{"issue":"10","key":"161_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2164-16-S10-S3","volume":"16","author":"P Vachaspati","year":"2015","unstructured":"Vachaspati P, Warnow T. ASTRID: accurate species trees from internode distances. BMC Genomics. 2015;16(10):3. https:\/\/doi.org\/10.1186\/1471-2164-16-S10-S3.","journal-title":"BMC Genomics"},{"issue":"4","key":"161_CR32","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TCBB.2011.157","volume":"9","author":"Y Lin","year":"2012","unstructured":"Lin Y, Rajan V, Moret BM. A metric for phylogenetic trees based on matching. IEEE\/ACM Trans Comput Biol Bioinform TCBB. 2012;9(4):1014\u201322. https:\/\/doi.org\/10.1109\/TCBB.2011.157.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform TCBB"},{"issue":"10","key":"161_CR33","doi-asserted-by":"publisher","first-page":"1636","DOI":"10.1093\/bioinformatics\/bth097","volume":"20","author":"T Mailund","year":"2004","unstructured":"Mailund T, Pedersen CN. Qdist-quartet distance between evolutionary trees. Bioinformatics. 2004;20(10):1636\u20137. https:\/\/doi.org\/10.1093\/bioinformatics\/bth097.","journal-title":"Bioinformatics"},{"issue":"10","key":"161_CR34","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1093\/molbev\/msv150","volume":"32","author":"V Lefort","year":"2015","unstructured":"Lefort V, Desper R, Gascuel O. FastME 2.0: a comprehensive, accurate, and fast distance-based phylogeny inference program. Mol Biol Evol. 2015;32(10):2798\u2013800.","journal-title":"Mol Biol Evol"},{"issue":"12","key":"161_CR35","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1093\/bioinformatics\/btq228","volume":"26","author":"J Sukumaran","year":"2010","unstructured":"Sukumaran J, Holder MT. Dendropy: a Python library for phylogenetic computing. Bioinformatics. 2010;26(12):1569\u201371. https:\/\/doi.org\/10.1093\/bioinformatics\/btq228.","journal-title":"Bioinformatics"},{"key":"161_CR36","unstructured":"Lin Y, Rajan V, Moret B. Software for the matching distance of Lin, Rajan, and Moret. ; 2018. http:\/\/users.cecs.anu.edu.au\/~u1024708\/index_files\/matching_distance.zip. Accessed 27 Dec 2019."},{"issue":"6","key":"161_CR37","doi-asserted-by":"publisher","first-page":"0129183","DOI":"10.1371\/journal.pone.0129183","volume":"10","author":"MS Bayzid","year":"2015","unstructured":"Bayzid MS, Mirarab S, Boussau B, Warnow T. Weighted statistical binning: enabling statistically consistent genome-scale phylogenetic analyses. PLoS ONE. 2015;10(6):0129183. https:\/\/doi.org\/10.1371\/journal.pone.0129183.","journal-title":"PLoS ONE"},{"issue":"6215","key":"161_CR38","doi-asserted-by":"publisher","first-page":"1250463","DOI":"10.1126\/science.1250463","volume":"346","author":"S Mirarab","year":"2014","unstructured":"Mirarab S, Bayzid MS, Boussau B, Warnow T. Statistical binning enables an accurate coalescent-based estimation of the avian tree. Science. 2014;346(6215):1250463. https:\/\/doi.org\/10.1126\/science.1250463.","journal-title":"Science"},{"issue":"15","key":"161_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/1471-2105-14-S15-S5","volume":"14","author":"M Lafond","year":"2013","unstructured":"Lafond M, Semeria M, Swenson KM, Tannier E, El-Mabrouk N. Gene tree correction guided by orthology. BMC Bioinform. 2013;14(15):5. https:\/\/doi.org\/10.1186\/1471-2105-14-S15-S5.","journal-title":"BMC Bioinform"},{"key":"161_CR40","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-67979-2_16","volume-title":"Comp Genomics","author":"H Lai","year":"2017","unstructured":"Lai H, Stolzer M, Durand D. Fast heuristics for resolving weakly supported branches using duplication, transfers, and losses. In: Meidanis J, Nakhleh L, editors. Comp Genomics. Cham: Springer; 2017. p. 298\u2013320 10.1007\/978-3-319-67979-2\\_16."},{"key":"161_CR41","unstructured":"Vachaspati P. Github site for TRACTION. https:\/\/github.com\/pranjalv123\/TRACTION-RF. Accessed 27 Dec 2019."},{"key":"161_CR42","doi-asserted-by":"publisher","unstructured":"Christensen S, Molloy EK, Vachaspati P, Warnow T. Datasets for TRACTION at the Illinois Data Bank. https:\/\/doi.org\/10.13012\/B2IDB-1747658_V1.","DOI":"10.13012\/B2IDB-1747658_V1"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0161-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-019-0161-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0161-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:04:35Z","timestamp":1609632275000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-019-0161-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,4]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1186\/s13015-019-0161-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,4]]},"assertion":[{"value":"9 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 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":"1"}}