{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:30:05Z","timestamp":1767925805124,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:00:00Z","timestamp":1707264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:00:00Z","timestamp":1707264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009367","name":"Mansoura University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009367","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>The rapid advancement of next-generation sequencing (NGS) machines in terms of speed and affordability has led to the generation of a massive amount of biological data at the expense of data quality as errors become more prevalent. This introduces the need to utilize different approaches to detect and filtrate errors, and data quality assurance is moved from the hardware space to the software preprocessing stages.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>We introduce MAC-ErrorReads, a novel<jats:italic>M<\/jats:italic>achine learning-<jats:italic>A<\/jats:italic>ssisted<jats:italic>C<\/jats:italic>lassifier designed for filtering<jats:italic>Erro<\/jats:italic>neous NGS<jats:italic>Reads<\/jats:italic>. MAC-ErrorReads transforms the erroneous NGS read filtration process into a robust binary classification task, employing five supervised machine learning algorithms. These models are trained on features extracted through the computation of Term Frequency-Inverse Document Frequency (<jats:italic>TF_IDF<\/jats:italic>) values from various datasets such as<jats:italic>E. coli<\/jats:italic>, GAGE<jats:italic>S. aureus<\/jats:italic>,<jats:italic>H. Chr14<\/jats:italic>,<jats:italic>Arabidopsis thaliana Chr1<\/jats:italic>and<jats:italic>Metriaclima zebra<\/jats:italic>. Notably, Naive Bayes demonstrated robust performance across various datasets, displaying high accuracy, precision, recall, F1-score, MCC, and ROC values. The MAC-ErrorReads NB model accurately classified<jats:italic>S. aureus<\/jats:italic>reads, surpassing most error correction tools with a 38.69% alignment rate. For<jats:italic>H. Chr14<\/jats:italic>, tools like Lighter, Karect, CARE, Pollux, and MAC-ErrorReads showed rates above 99%. BFC and RECKONER exceeded 98%, while Fiona had 95.78%. For the<jats:italic>Arabidopsis thaliana Chr1<\/jats:italic>, Pollux, Karect, RECKONER, and MAC-ErrorReads demonstrated good alignment rates of 92.62%, 91.80%, 91.78%, and 90.87%, respectively. For the<jats:italic>Metriaclima zebra<\/jats:italic>, Pollux achieved a high alignment rate of 91.23%, despite having the lowest number of mapped reads. MAC-ErrorReads, Karect, and RECKONER demonstrated good alignment rates of 83.76%, 83.71%, and 83.67%, respectively, while also producing reasonable numbers of mapped reads to the reference genome.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>This study demonstrates that machine learning approaches for filtering NGS reads effectively identify and retain the most accurate reads, significantly enhancing assembly quality and genomic coverage. The integration of genomics and artificial intelligence through machine learning algorithms holds promise for enhancing NGS data quality, advancing downstream data analysis accuracy, and opening new opportunities in genetics, genomics, and personalized medicine research.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-024-05681-1","type":"journal-article","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T03:02:05Z","timestamp":1707274925000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["MAC-ErrorReads: machine learning-assisted classifier for filtering erroneous NGS reads"],"prefix":"10.1186","volume":"25","author":[{"given":"Amira","family":"Sami","sequence":"first","affiliation":[]},{"given":"Sara","family":"El-Metwally","sequence":"additional","affiliation":[]},{"given":"M. Z.","family":"Rashad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"5681_CR1","first-page":"66","volume":"6","author":"MT Pervez","year":"2022","unstructured":"Pervez MT, Abbas SH, Moustafa MF, Aslam N, Shah SSM. A comprehensive review of performance of next-generation sequencing platforms. BioMed Res Int. 2022;6:66.","journal-title":"BioMed Res Int"},{"key":"5681_CR2","first-page":"66","volume":"6","author":"M Uhlen","year":"2023","unstructured":"Uhlen M, Quake SR. Sequential sequencing by synthesis and the next-generation sequencing revolution. Trends Biotechnol. 2023;6:66.","journal-title":"Trends Biotechnol"},{"key":"5681_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1146\/annurev-genom-101722-103045","volume":"24","author":"PE Warburton","year":"2023","unstructured":"Warburton PE, Sebra RP. Long-read DNA sequencing: recent advances and remaining challenges. Annu Rev Genom Hum Genet. 2023;24:66.","journal-title":"Annu Rev Genom Hum Genet"},{"issue":"12","key":"5681_CR4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1003345","volume":"9","author":"S El-Metwally","year":"2013","unstructured":"El-Metwally S, Hamza T, Zakaria M, Helmy M. Next-generation sequence assembly: four stages of data processing and computational challenges. PLoS Comput Biol. 2013;9(12): e1003345.","journal-title":"PLoS Comput Biol"},{"key":"5681_CR5","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2023.982111","volume":"11","author":"C Cheng","year":"2023","unstructured":"Cheng C, Fei Z, Xiao P. Methods to improve the accuracy of next-generation sequencing. Front Bioeng Biotechnol. 2023;11: 982111.","journal-title":"Front Bioeng Biotechnol"},{"issue":"1","key":"5681_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1093\/bib\/bbv029","volume":"17","author":"D Laehnemann","year":"2015","unstructured":"Laehnemann D, Borkhardt A, McHardy AC. Denoising DNA deep sequencing data\u2014high-throughput sequencing errors and their correction. Brief Bioinform. 2015;17(1):154\u201379.","journal-title":"Brief Bioinform"},{"issue":"4","key":"5681_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1186\/s12859-019-2684-x","volume":"20","author":"M Sangiovanni","year":"2019","unstructured":"Sangiovanni M, Granata I, Thind AS, Guarracino MR. From trash to treasure: detecting unexpected contamination in unmapped NGS data. BMC Bioinform. 2019;20(4):168.","journal-title":"BMC Bioinform"},{"issue":"1","key":"5681_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1186\/s13059-020-01988-3","volume":"21","author":"K Mitchell","year":"2020","unstructured":"Mitchell K, Brito JJ, Mandric I, Wu Q, Knyazev S, Chang S, Martin LS, Karlsberg A, Gerasimov E, Littman R, et al. Benchmarking of computational error-correction methods for next-generation sequencing data. Genome Biol. 2020;21(1):71.","journal-title":"Genome Biol"},{"issue":"1","key":"5681_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1093\/bib\/bbs015","volume":"14","author":"X Yang","year":"2013","unstructured":"Yang X, Chockalingam SP, Aluru S. A survey of error-correction methods for next-generation sequencing. Brief Bioinform. 2013;14(1):56\u201366.","journal-title":"Brief Bioinform"},{"issue":"4","key":"5681_CR10","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1093\/bib\/bbu029","volume":"16","author":"M Molnar","year":"2015","unstructured":"Molnar M, Ilie L. Correcting illumina data. Brief Bioinform. 2015;16(4):588\u201399.","journal-title":"Brief Bioinform"},{"issue":"1","key":"5681_CR11","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1038\/s41467-019-09406-4","volume":"10","author":"S Mangul","year":"2019","unstructured":"Mangul S, Martin LS, Hill BL, Lam AK-M, Distler MG, Zelikovsky A, Eskin E, Flint J. Systematic benchmarking of omics computational tools. Nat Commun. 2019;10(1):1393.","journal-title":"Nat Commun"},{"issue":"3","key":"5681_CR12","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/bioinformatics\/bts690","volume":"29","author":"Y Liu","year":"2013","unstructured":"Liu Y, Schr\u00f6der J, Schmidt B. Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data. Bioinformatics. 2013;29(3):308\u201315.","journal-title":"Bioinformatics"},{"issue":"11","key":"5681_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1186\/s13059-014-0509-9","volume":"15","author":"L Song","year":"2014","unstructured":"Song L, Florea L, Langmead B. Lighter: fast and memory-efficient sequencing error correction without counting. Genome Biol. 2014;15(11):509.","journal-title":"Genome Biol"},{"issue":"17","key":"5681_CR14","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1093\/bioinformatics\/btv290","volume":"31","author":"H Li","year":"2015","unstructured":"Li H. BFC: correcting Illumina sequencing errors. Bioinformatics. 2015;31(17):2885\u20137.","journal-title":"Bioinformatics"},{"issue":"7","key":"5681_CR15","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1093\/bioinformatics\/btw746","volume":"33","author":"M D\u0142ugosz","year":"2017","unstructured":"D\u0142ugosz M, Deorowicz S. RECKONER: read error corrector based on KMC. Bioinformatics. 2017;33(7):1086\u20139.","journal-title":"Bioinformatics"},{"issue":"19","key":"5681_CR16","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1093\/bioinformatics\/btu368","volume":"30","author":"P Greenfield","year":"2014","unstructured":"Greenfield P, Duesing K, Papanicolaou A, Bauer DC. Blue: correcting sequencing errors using consensus and context. Bioinformatics. 2014;30(19):2723\u201332.","journal-title":"Bioinformatics"},{"issue":"19","key":"5681_CR17","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1093\/bioinformatics\/btt407","volume":"29","author":"L Ilie","year":"2013","unstructured":"Ilie L, Molnar M. RACER: rapid and accurate correction of errors in reads. Bioinformatics. 2013;29(19):2490\u20133.","journal-title":"Bioinformatics"},{"issue":"1","key":"5681_CR18","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/s12859-014-0435-6","volume":"16","author":"E Marinier","year":"2015","unstructured":"Marinier E, Brown DG, McConkey BJ. Pollux: platform independent error correction of single and mixed genomes. BMC Bioinform. 2015;16(1):10.","journal-title":"BMC Bioinform"},{"issue":"15","key":"5681_CR19","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/bioinformatics\/btw146","volume":"32","author":"Y Heo","year":"2016","unstructured":"Heo Y, Ramachandran A, Hwu W-M, Ma J, Chen D. BLESS 2: accurate, memory-efficient and fast error correction method. Bioinformatics. 2016;32(15):2369\u201371.","journal-title":"Bioinformatics"},{"issue":"11","key":"5681_CR20","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1093\/bioinformatics\/btr170","volume":"27","author":"L Salmela","year":"2011","unstructured":"Salmela L, Schr\u00f6der J. Correcting errors in short reads by multiple alignments. Bioinformatics. 2011;27(11):1455\u201361.","journal-title":"Bioinformatics"},{"issue":"7","key":"5681_CR21","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1101\/gr.111351.110","volume":"21","author":"W-C Kao","year":"2011","unstructured":"Kao W-C, Chan AH, Song YS. ECHO: a reference-free short-read error correction algorithm. Genome Res. 2011;21(7):1181\u201392.","journal-title":"Genome Res"},{"issue":"17","key":"5681_CR22","doi-asserted-by":"publisher","first-page":"i356","DOI":"10.1093\/bioinformatics\/btu440","volume":"30","author":"MH Schulz","year":"2014","unstructured":"Schulz MH, Weese D, Holtgrewe M, Dimitrova V, Niu S, Reinert K, Richard H. Fiona: a parallel and automatic strategy for read error correction. Bioinformatics. 2014;30(17):i356\u201363.","journal-title":"Bioinformatics"},{"issue":"21","key":"5681_CR23","doi-asserted-by":"publisher","first-page":"3421","DOI":"10.1093\/bioinformatics\/btv415","volume":"31","author":"A Allam","year":"2015","unstructured":"Allam A, Kalnis P, Solovyev V. Karect: accurate correction of substitution, insertion and deletion errors for next-generation sequencing data. Bioinformatics. 2015;31(21):3421\u20138.","journal-title":"Bioinformatics"},{"issue":"5","key":"5681_CR24","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1093\/bioinformatics\/btz102","volume":"36","author":"A Limasset","year":"2020","unstructured":"Limasset A, Flot J-F, Peterlongo P. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. Bioinformatics. 2020;36(5):1374\u201381.","journal-title":"Bioinformatics"},{"issue":"1","key":"5681_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-2906-2","volume":"20","author":"M Heydari","year":"2019","unstructured":"Heydari M, Miclotte G, Van de Peer Y, Fostier J. Illumina error correction near highly repetitive DNA regions improves de novo genome assembly. BMC Bioinform. 2019;20(1):1\u201313.","journal-title":"BMC Bioinform"},{"issue":"7","key":"5681_CR26","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1093\/bioinformatics\/btaa738","volume":"37","author":"F Kallenborn","year":"2021","unstructured":"Kallenborn F, Hildebrandt A, Schmidt B. CARE: context-aware sequencing read error correction. Bioinformatics. 2021;37(7):889\u201395.","journal-title":"Bioinformatics"},{"issue":"8","key":"5681_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10916-018-1003-9","volume":"42","author":"K Lan","year":"2018","unstructured":"Lan K, Wang D-t, Fong S, Liu L-s, Wong KKL, Dey N. A survey of data mining and deep learning in bioinformatics. J Med Syst. 2018;42(8):139.","journal-title":"J Med Syst"},{"issue":"1","key":"5681_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.drudis.2020.10.002","volume":"26","author":"B Schmidt","year":"2021","unstructured":"Schmidt B, Hildebrandt A. Deep learning in next-generation sequencing. Drug Discov Today. 2021;26(1):173\u201380.","journal-title":"Drug Discov Today"},{"issue":"1","key":"5681_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1186\/s12859-022-04754-3","volume":"23","author":"F Kallenborn","year":"2022","unstructured":"Kallenborn F, Cascitti J, Schmidt B. CARE 2.0: reducing false-positive sequencing error corrections using machine learning. BMC Bioinf. 2022;23(1):227.","journal-title":"BMC Bioinf"},{"key":"5681_CR30","doi-asserted-by":"crossref","unstructured":"Krachunov M, Nisheva M, Vassilev D. Machine learning-driven noise separation in high variation genomics sequencing datasets. In: Artificial intelligence: methodology, systems, and applications: 18th international conference, AIMSA 2018, Varna, Bulgaria, September 12\u201314, 2018, Proceedings 18: 2018: Springer; 2018. p. 173\u201385.","DOI":"10.1007\/978-3-319-99344-7_16"},{"issue":"1","key":"5681_CR31","doi-asserted-by":"publisher","first-page":"16157","DOI":"10.1038\/s41598-019-52196-4","volume":"9","author":"M Abdallah","year":"2019","unstructured":"Abdallah M, Mahgoub A, Ahmed H, Chaterji S. Athena: automated tuning of k-mer based genomic error correction algorithms using language models. Sci Rep. 2019;9(1):16157.","journal-title":"Sci Rep"},{"issue":"1","key":"5681_CR32","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/s12859-021-04547-0","volume":"23","author":"A Sharma","year":"2022","unstructured":"Sharma A, Jain P, Mahgoub A, Zhou Z, Mahadik K, Chaterji S. Lerna: transformer architectures for configuring error correction tools for short- and long-read genome sequencing. BMC Bioinform. 2022;23(1):25.","journal-title":"BMC Bioinform"},{"key":"5681_CR33","unstructured":"Rish I. An empirical study of the naive Bayes classifier. In: IJCAI 2001 workshop on empirical methods in artificial intelligence: 2001; 2001. p. 41\u20136."},{"key":"5681_CR34","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V. Support-vector networks. Mach Learn. 1995;20:273\u201397.","journal-title":"Mach Learn"},{"key":"5681_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001;45:5\u201332.","journal-title":"Mach Learn"},{"issue":"2","key":"5681_CR36","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.2517-6161.1958.tb00292.x","volume":"20","author":"DR Cox","year":"1958","unstructured":"Cox DR. The regression analysis of binary sequences. J R Stat Soc Ser B Stat Methodol. 1958;20(2):215\u201332.","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"5681_CR37","doi-asserted-by":"crossref","unstructured":"Hosmer DW Jr, Lemeshow S, Sturdivant RX. Applied logistic regression, vol. 398. Wiley; 2013.","DOI":"10.1002\/9781118548387"},{"key":"5681_CR38","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C. Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining: 2016; 2016. p. 785\u201394.","DOI":"10.1145\/2939672.2939785"},{"issue":"16","key":"5681_CR39","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H Li","year":"2009","unstructured":"Li H, Handsaker B, Wysoker A, Fennell T, Ruan J, Homer N, Marth G, Abecasis G, Durbin R, Subgroup GPDP. The sequence alignment\/map format and SAMtools. Bioinformatics. 2009;25(16):2078\u20139.","journal-title":"Bioinformatics"},{"issue":"3","key":"5681_CR40","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","volume":"2","author":"ES Lander","year":"1988","unstructured":"Lander ES, Waterman MS. Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics. 1988;2(3):231\u20139.","journal-title":"Genomics"},{"key":"5681_CR41","unstructured":"Ramos J. Using tf-idf to determine word relevance in document queries. In: Proceedings of the first instructional conference on machine learning: 2003: Citeseer; 2003. p. 29\u201348."},{"issue":"14","key":"5681_CR42","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li H, Durbin R. Fast and accurate short read alignment with Burrows\u2013Wheeler transform. Bioinformatics. 2009;25(14):1754\u201360.","journal-title":"Bioinformatics"},{"issue":"4","key":"5681_CR43","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead B, Salzberg SL. Fast gapped-read alignment with Bowtie 2. Nat Methods. 2012;9(4):357\u20139.","journal-title":"Nat Methods"},{"issue":"5","key":"5681_CR44","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":"5","key":"5681_CR45","doi-asserted-by":"publisher","first-page":"644","DOI":"10.2174\/1574893615999201111140419","volume":"16","author":"S El-Metwally","year":"2021","unstructured":"El-Metwally S, Hamouda E, Tarek M. A roadmap to sequence assembly evaluation tools. Curr Bioinform. 2021;16(5):644\u201361.","journal-title":"Curr Bioinform"},{"issue":"2","key":"5681_CR46","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1093\/bioinformatics\/btab672","volume":"38","author":"M Karlicki","year":"2021","unstructured":"Karlicki M, Antonowicz S, Karnkowska A. Tiara: deep learning-based classification system for eukaryotic sequences. Bioinformatics. 2021;38(2):344\u201350.","journal-title":"Bioinformatics"},{"issue":"3","key":"5681_CR47","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1101\/gr.131383.111","volume":"22","author":"SL Salzberg","year":"2012","unstructured":"Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, Koren S, Treangen TJ, Schatz MC, Delcher AL, Roberts M. GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Res. 2012;22(3):557\u201367.","journal-title":"Genome Res"},{"issue":"8","key":"5681_CR48","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","volume":"29","author":"A Gurevich","year":"2013","unstructured":"Gurevich A, Saveliev V, Vyahhi N, Tesler G. QUAST: quality assessment tool for genome assemblies. Bioinformatics. 2013;29(8):1072\u20135.","journal-title":"Bioinformatics"},{"key":"5681_CR49","unstructured":"BBMap. https:\/\/sourceforge.net\/projects\/bbmap\/."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-024-05681-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-024-05681-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-024-05681-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T16:24:22Z","timestamp":1731255862000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-024-05681-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,7]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["5681"],"URL":"https:\/\/doi.org\/10.1186\/s12859-024-05681-1","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,7]]},"assertion":[{"value":"12 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 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":"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":"61"}}