SEK: Sparsity exploiting $k$-mer-based estimation of bacterial community composition
Saikat Chatterjee, David Koslicki, Siyuan Dong, Nicolas Innocenti, Lu, Cheng, Yueheng Lan, Mikko Vehkaper\"a, Mikael Skoglund, Lars K. Rasmussen,, Erik Aurell, Jukka Corander

TL;DR
This paper introduces a novel, fast, and robust method for estimating bacterial community composition from high-throughput sequencing data by leveraging sparsity and convex optimization techniques, improving efficiency and robustness over existing methods.
Contribution
The paper presents a sparsity-based estimation approach using convex optimization and greedy algorithms for rapid and robust bacterial community analysis from sequencing data.
Findings
The method is significantly faster than traditional approaches.
It demonstrates higher robustness to data variation.
The approach achieves accurate community composition estimation.
Abstract
Motivation: Estimation of bacterial community composition from a high-throughput sequenced sample is an important task in metagenomics applications. Since the sample sequence data typically harbors reads of variable lengths and different levels of biological and technical noise, accurate statistical analysis of such data is challenging. Currently popular estimation methods are typically very time consuming in a desktop computing environment. Results: Using sparsity enforcing methods from the general sparse signal processing field (such as compressed sensing), we derive a solution to the community composition estimation problem by a simultaneous assignment of all sample reads to a pre-processed reference database. A general statistical model based on kernel density estimation techniques is introduced for the assignment task and the model solution is obtained using convex optimization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
