Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.02125 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915004482060288 |
|---|---|
| author | Celikkanat, Abdulkadir Masegosa, Andres R. Nielsen, Thomas D. |
| author_facet | Celikkanat, Abdulkadir Masegosa, Andres R. Nielsen, Thomas D. |
| contents | Obtaining effective representations of DNA sequences is crucial for genome analysis. Metagenomic binning, for instance, relies on genome representations to cluster complex mixtures of DNA fragments from biological samples with the aim of determining their microbial compositions. In this paper, we revisit k-mer-based representations of genomes and provide a theoretical analysis of their use in representation learning. Based on the analysis, we propose a lightweight and scalable model for performing metagenomic binning at the genome read level, relying only on the k-mer compositions of the DNA fragments. We compare the model to recent genome foundation models and demonstrate that while the models are comparable in performance, the proposed model is significantly more effective in terms of scalability, a crucial aspect for performing metagenomic binning of real-world datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02125 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Revisiting K-mer Profile for Effective and Scalable Genome Representation Learning Celikkanat, Abdulkadir Masegosa, Andres R. Nielsen, Thomas D. Machine Learning Artificial Intelligence Computational Engineering, Finance, and Science Genomics Obtaining effective representations of DNA sequences is crucial for genome analysis. Metagenomic binning, for instance, relies on genome representations to cluster complex mixtures of DNA fragments from biological samples with the aim of determining their microbial compositions. In this paper, we revisit k-mer-based representations of genomes and provide a theoretical analysis of their use in representation learning. Based on the analysis, we propose a lightweight and scalable model for performing metagenomic binning at the genome read level, relying only on the k-mer compositions of the DNA fragments. We compare the model to recent genome foundation models and demonstrate that while the models are comparable in performance, the proposed model is significantly more effective in terms of scalability, a crucial aspect for performing metagenomic binning of real-world datasets. |
| title | Revisiting K-mer Profile for Effective and Scalable Genome Representation Learning |
| topic | Machine Learning Artificial Intelligence Computational Engineering, Finance, and Science Genomics |
| url | https://arxiv.org/abs/2411.02125 |