mlsanityData to 14 Oct 2026

Effective and scalable clustering of SARS-CoV-2 sequences

arXiv 2108.08143 ↗First posted 18 Aug 2021q-bio.PE cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

SARS-CoV-2, like any other virus, continues to mutate as it spreads, according to an evolutionary process. Unlike any other virus, the number of currently available sequences of SARS-CoV-2 in public databases such as GISAID is already several million. This amount of data has the potential to uncover the evolutionary dynamics of a virus like never before. However, a million is already several orders of magnitude beyond what can be processed by the traditional methods designed to reconstruct a virus's evolutionary history, such as those that build a phylogenetic tree. Hence, new and scalable methods will need to be devised in order to make use of the ever increasing number of viral sequences being collected. Since identifying variants is an important part of understanding the evolution of a virus, in this paper, we propose an approach based on clustering sequences to identify the current major SARS-CoV-2 variants. Using a k-mer based feature vector generation and efficient feature selection methods, our approach is effective in identifying variants, as well as being efficient and scalable to millions of sequences. Such a clustering method allows us to show the relative proportion of each variant over time, giving the rate of spread of each variant in different locations -- something which is important for vaccine development and distribution. We also compute the importance of each amino acid position of the spike protein in identifying a given variant in terms of information gain. Positions of high variant-specific importance tend to agree with those reported by the USA's Centers for Disease Control and Prevention (CDC), further demonstrating our approach.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 15 of its 49 references that are in the map. First posted on arXiv 18 Aug 2021.

Builds on

15 of 49 references.

References · 15

  1. 2021A k-mer Based Approach for SARS-CoV-2 Variant Identificationcited by 23
  2. 2017Efficient Approximation Algorithms for String Kernel Based Sequence Classificationcited by 20
  3. 2019Predicting Attributes of Nodes Using Network Structurecited by 15
  4. 2019Detecting DDoS Attack on SDN Due to Vulnerabilities in OpenFlowcited by 14
  5. 2020Effect of Analysis Window and Feature Selection on Classification of Hand Movements Using EMG Signalcited by 14
  6. 2019Short-Term Load Forecasting Using AMI Datacited by 13
  7. 2019Combinatorial Trace Method for Network Immunizationcited by 12
  8. 2019A Multi-cascaded Model with Data Augmentation for Enhanced Paraphrase Detection in Short Textscited by 11
  9. 2019Language Independent Sentiment Analysiscited by 10
  10. 2017Spectral Methods for Immunization of Large Networkscited by 9
  11. 2017Scalable Approximation Algorithm for Network Immunizationcited by 8
  12. 2019A Multi-cascaded Deep Model for Bilingual SMS Classificationcited by 8
3 more
  1. 2020Estimating Descriptors for Large Graphscited by 7
  2. 2021Cache Replacement Algorithmcited by 5
  3. 2020Fair Allocation Based Soft Load Sheddingcited by 3

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 7; 2023: 2; 2024: 1.

15 papers.

Sort: