{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:41:33Z","timestamp":1781854893860,"version":"3.54.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-03905-6","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:55:23Z","timestamp":1744199723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Biological Sequence Clustering: Novel Approaches and a Comparative Study"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0370-7741","authenticated-orcid":false,"given":"Johny","family":"Matar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hicham","family":"El Khoury","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Claude","family":"Charr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Guyeux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Chr\u00e9tien","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"issue":"9","key":"3905_CR1","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.","journal-title":"Bioinformatics"},{"key":"3905_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-1-59745-251-9_6","volume-title":"Estimating maximum likelihood phylogenies with PhyML","author":"S Guindon","year":"2009","unstructured":"Guindon S, Delsuc F, Dufayard J-F, Gascuel O. In: Posada D, editor. Estimating maximum likelihood phylogenies with PhyML. Totowa: Humana Press; 2009. p. 113\u201337. https:\/\/doi.org\/10.1007\/978-1-59745-251-9_6."},{"issue":"9","key":"3905_CR3","doi-asserted-by":"publisher","first-page":"2422","DOI":"10.1093\/molbev\/msx149","volume":"34","author":"V Lefort","year":"2017","unstructured":"Lefort V, Longueville J-E, Gascuel O. SMS: smart model selection in PhyML. Mol Biol Evol. 2017;34(9):2422\u20134.","journal-title":"Mol Biol Evol"},{"issue":"3","key":"3905_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/sysbio\/sys029","volume":"61","author":"F Ronquist","year":"2012","unstructured":"Ronquist F, Teslenko M, Van Der Mark P, Ayres DL, Darling A, H\u00f6hna S, Larget B, Liu L, Suchard MA, Huelsenbeck JP. MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large model space. Syst Biol. 2012;61(3):539\u201342.","journal-title":"Syst Biol"},{"issue":"13","key":"3905_CR5","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1093\/bioinformatics\/btl158","volume":"22","author":"W Li","year":"2006","unstructured":"Li W, Godzik A. Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics. 2006;22(13):1658\u20139.","journal-title":"Bioinformatics"},{"issue":"19","key":"3905_CR6","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1093\/bioinformatics\/btq461","volume":"26","author":"RC Edgar","year":"2010","unstructured":"Edgar RC. Search and clustering orders of magnitude faster than blast. Bioinformatics. 2010;26(19):2460\u20131.","journal-title":"Bioinformatics"},{"issue":"1","key":"3905_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1186\/1471-2105-12-271","volume":"12","author":"M Ghodsi","year":"2011","unstructured":"Ghodsi M, Liu B, Pop M. DNACLUST: accurate and efficient clustering of phylogenetic marker genes. BMC Bioinform. 2011;12(1):271. https:\/\/doi.org\/10.1186\/1471-2105-12-271.","journal-title":"BMC Bioinform"},{"key":"3905_CR8","unstructured":"Mercier C, Boyer F, Bonin A, Coissac E. SUMATRA and SUMACLUST: fast and exact comparison and clustering of sequences. In: Programs and abstracts of the SeqBio 2013 workshop. Abstract, 2013, 27\u201329. Citeseer."},{"issue":"6","key":"3905_CR9","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1093\/bioinformatics\/btw722","volume":"33","author":"L Jiang","year":"2016","unstructured":"Jiang L, Dong Y, Chen N, Chen T. DACE: a scalable DP-means algorithm for clustering extremely large sequence data. Bioinformatics. 2016;33(6):834\u201342. https:\/\/doi.org\/10.1093\/bioinformatics\/btw722.","journal-title":"Bioinformatics"},{"issue":"2","key":"3905_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1093\/bioinformatics\/btt657","volume":"30","author":"JF Matias Rodrigues","year":"2013","unstructured":"Matias Rodrigues JF, Mering C. HPC-CLUST: distributed hierarchical clustering for large sets of nucleotide sequences. Bioinformatics. 2013;30(2):287\u20138.","journal-title":"Bioinformatics"},{"key":"3905_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.compbiomed.2017.12.003","volume":"93","author":"M Bruneau","year":"2018","unstructured":"Bruneau M, Mottet T, Moulin S, Kerbiriou M, Chouly F, Chretien S, Guyeux C. A clustering package for nucleotide sequences using Laplacian eigenmaps and Gaussian mixture model. Comput Biol Med. 2018;93:66\u201374. https:\/\/doi.org\/10.1016\/j.compbiomed.2017.12.003.","journal-title":"Comput Biol Med"},{"key":"3905_CR12","doi-asserted-by":"publisher","first-page":"103439","DOI":"10.1016\/j.compbiomed.2019.103439","volume":"114","author":"J Matar","year":"2019","unstructured":"Matar J, Khoury HE, Charr J-C, Guyeux C, Chr\u00e9tien S. SpCLUST: towards a fast and reliable clustering for potentially divergent biological sequences. Comput Biol Med. 2019;114:103439.","journal-title":"Comput Biol Med"},{"issue":"3","key":"3905_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.32350\/sir.83.03","volume":"8","author":"J Matar","year":"2024","unstructured":"Matar J, ElKhoury H, Charr J-C, Guyeux C, Chr\u00e9tien S. Optimized spectral clustering methods for potentially divergent biological sequences. Sci Enq Rev. 2024;8(3):58\u201387. https:\/\/doi.org\/10.32350\/sir.83.03.","journal-title":"Sci Enq Rev"},{"key":"3905_CR14","doi-asserted-by":"publisher","unstructured":"Pipes L, Nielsen R. AncestralClust: clustering of divergent nucleotide sequences by ancestral sequence reconstruction using phylogenetic trees. bioRxiv 2021. https:\/\/doi.org\/10.1101\/2021.01.08.426008. https:\/\/arxiv.org\/abs\/https:\/\/www.biorxiv.org\/content\/early\/2021\/01\/09\/2021.01.08.426008.full.pdf.","DOI":"10.1101\/2021.01.08.426008"},{"key":"3905_CR15","doi-asserted-by":"publisher","unstructured":"Matar J, El Khoury H, Charr J-C, Guyeux C. Revisiting spectral clustering: assessments and extended capabilities. In: 2025 5th IEEE Middle East and North Africa Communications Conference (MENACOMM), pp. 1\u20136 (2025). https:\/\/doi.org\/10.1109\/MENACOMM62946.2025.10911002.","DOI":"10.1109\/MENACOMM62946.2025.10911002"},{"key":"3905_CR16","doi-asserted-by":"crossref","unstructured":"Khan K, Rehman SU, Aziz K, Fong S, Sarasvady S. Dbscan: past, present and future. In: The fifth international conference on the applications of digital information and web technologies (ICADIWT 2014), 2014, p. 232\u20138. IEEE.","DOI":"10.1109\/ICADIWT.2014.6814687"},{"key":"3905_CR17","doi-asserted-by":"crossref","unstructured":"Campello RJ, Moulavi D, Sander J. Density-based clustering based on hierarchical density estimates. In: Pacific-Asia conference on knowledge discovery and data mining; 2013. p. 160\u201372. Springer.","DOI":"10.1007\/978-3-642-37456-2_14"},{"issue":"6295","key":"3905_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J. Higher-order organization of complex networks. Science. 2016;353(6295):163\u20136.","journal-title":"Science"},{"issue":"12","key":"3905_CR19","doi-asserted-by":"publisher","first-page":"0200751","DOI":"10.1371\/journal.pone.0200751","volume":"13","author":"Y Zhao","year":"2018","unstructured":"Zhao Y, Liu X, Li X. An improved DBSCAN algorithm based on cell-like p systems with promoters and inhibitors. PLoS ONE. 2018;13(12):0200751.","journal-title":"PLoS ONE"},{"issue":"20","key":"3905_CR20","doi-asserted-by":"publisher","first-page":"15355","DOI":"10.3390\/ijms242015355","volume":"24","author":"GV Khvorykh","year":"2023","unstructured":"Khvorykh GV, Sapozhnikov NA, Limborska SA, Khrunin AV. Evaluation of density-based spatial clustering for identifying genomic loci associated with ischemic stroke in genome-wide data. Int J Mol Sci. 2023;24(20):15355.","journal-title":"Int J Mol Sci"},{"key":"3905_CR21","volume-title":"Clustering: a data recovery approach","author":"B Mirkin","year":"2012","unstructured":"Mirkin B. Clustering: a data recovery approach, vol. 19. Boca Raton: Chapman and Hall\/CRC; 2012."},{"issue":"1","key":"3905_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/widm.53","volume":"2","author":"F Murtagh","year":"2012","unstructured":"Murtagh F, Contreras P. Algorithms for hierarchical clustering: an overview. Wiley Interdiscip Rev Data Min Knowl Discov. 2012;2(1):86\u201397.","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"issue":"2","key":"3905_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas A, Vlassis N, Verbeek JJ. The global k-means clustering algorithm. Pattern Recognit. 2003;36(2):451\u201361.","journal-title":"Pattern Recognit"},{"key":"3905_CR24","unstructured":"Kulis B, Jordan MI. Revisiting k-means: new algorithms via Bayesian nonparametrics. arXiv preprint arXiv:1111.0352. 2011."},{"key":"3905_CR25","doi-asserted-by":"crossref","unstructured":"Guo C, Fu H, Luk W. A fully-pipelined expectation-maximization engine for Gaussian mixture models. In: 2012 international conference on field-programmable technology; 2012. p. 182\u20139. IEEE.","DOI":"10.1109\/FPT.2012.6412132"},{"issue":"4","key":"3905_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U. A tutorial on spectral clustering. Stat Comput. 2007;17(4):395\u2013416.","journal-title":"Stat Comput"},{"key":"3905_CR27","doi-asserted-by":"crossref","unstructured":"Malzer C, Baum M. A hybrid approach to hierarchical density-based cluster selection. In: 2020 IEEE international conference on multisensor fusion and integration for intelligent systems (MFI); 2020. p. 223\u20138. IEEE.","DOI":"10.1109\/MFI49285.2020.9235263"},{"issue":"2","key":"3905_CR28","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1037\/a0027127","volume":"17","author":"SI Vrieze","year":"2012","unstructured":"Vrieze SI. Model selection and psychological theory: a discussion of the differences between the Akaike information criterion (AIC) and the Bayesian information criterion (BIC). Psychol Methods. 2012;17(2):228.","journal-title":"Psychol Methods"},{"key":"3905_CR29","volume-title":"Introduction to information retrieval","author":"H Sch\u00fctze","year":"2008","unstructured":"Sch\u00fctze H, Manning CD, Raghavan P. Introduction to information retrieval, vol. 39. Cambridge: Cambridge University Press; 2008."},{"key":"3905_CR30","unstructured":"Cluster analysis\u2014Wikipedia. https:\/\/en.wikipedia.org\/wiki\/Cluster_analysis. Accessed 27 Feb 2021."},{"key":"3905_CR31","doi-asserted-by":"publisher","first-page":"052024","DOI":"10.1088\/1757-899X\/569\/5\/052024","volume":"569","author":"X Wang","year":"2019","unstructured":"Wang X, Xu Y. An improved index for clustering validation based on silhouette index and Calinski\u2013Harabasz index. IOP Conf Ser Mater Sci Eng. 2019;569:052024.","journal-title":"IOP Conf Ser Mater Sci Eng"},{"key":"3905_CR32","doi-asserted-by":"crossref","unstructured":"Santos JM, Embrechts M. On the use of the adjusted rand index as a metric for evaluating supervised classification. In: International conference on artificial neural networks. 2009. p. 175\u201384. Springer.","DOI":"10.1007\/978-3-642-04277-5_18"},{"key":"3905_CR33","unstructured":"Rosenberg A, Hirschberg J. V-measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning (EMNLP-CoNLL);2007. p. 410\u201320."},{"key":"3905_CR34","unstructured":"National center for biotechnology information. https:\/\/www.ncbi.nlm.nih.gov\/. Accessed 27 Feb 2018."},{"key":"3905_CR35","unstructured":"GISAID Data Science Initiative. https:\/\/gisaid.org\/. Accessed 21 May 2021."},{"issue":"5","key":"3905_CR36","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":"4","key":"3905_CR37","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1093\/molbev\/mst010","volume":"30","author":"K Katoh","year":"2013","unstructured":"Katoh K, Standley DM. MAFFT multiple sequence alignment software version 7: improvements in performance and usability. Mol Biol Evol. 2013;30(4):772\u201380.","journal-title":"Mol Biol Evol"},{"issue":"9","key":"3905_CR38","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1093\/bioinformatics\/btw753","volume":"33","author":"M \u0160o\u0161i\u0107","year":"2017","unstructured":"\u0160o\u0161i\u0107 M, \u0160iki\u0107 M. Edlib: a C\/C++ library for fast, exact sequence alignment using edit distance. Bioinformatics. 2017;33(9):1394\u20135.","journal-title":"Bioinformatics"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03905-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-03905-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03905-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:55:34Z","timestamp":1744199734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-03905-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,9]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["3905"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-03905-6","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,9]]},"assertion":[{"value":"3 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research Involving Human and\/or Animals"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"369"}}