Finer Metagenomic Reconstruction via Biodiversity Optimization
Simon Foucart, David Koslicki
Abstract
When analyzing communities of microorganisms from their sequenced DNA, an important task is taxonomic profiling: enumerating the presence and relative abundance of all organisms, or merely of all taxa, contained in the sample. This task can be tackled via compressive-sensing-based approaches, which favor communities featuring the fewest organisms among those consistent with the observed DNA data. Despite their successes, these parsimonious approaches sometimes conflict with biological realism by overlooking organism similarities. Here, we leverage a recently developed notion of biological diversity that simultaneously accounts for organism similarities and retains the optimization strategy underlying compressive-sensing-based approaches. We demonstrate that minimizing biological diversity still produces sparse taxonomic profiles and we experimentally validate superiority to existing compressive-sensing-based approaches. Despite showing that the objective function is almost never convex and often concave, generally yielding NP-hard problems, we exhibit ways of representing organism similarities for which minimizing diversity can be performed via a sequence of linear programs guaranteed to decrease diversity. Better yet, when biological similarity is quantified by k-mer co-occurrence (a popular notion in bioinformatics), minimizing diversity actually reduces to one linear program that can utilize multiple k-mer sizes to enhance performance. In proof-of-concept experiments, we verify that the latter procedure can lead to significant gains when taxonomically profiling a metagenomic sample, both in terms of reconstruction accuracy and computational performance. Reproducible code is available at https://github.com/dkoslicki/MinimizeBiologicalDiversity.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 70d7f3ee-e787-491e-bf4d-dcb500e1150cRelated papers
- Revisiting K-mer Profile for Effective and Scalable Genome Representation LearningAbdulkadir Çelikkanat, Andrés R. Masegosa, Thomas D. NielsenNeurIPS 2024 · 9 citations
- One-Pass Diversified Sampling with Application to Terabyte-Scale Genomic Sequence StreamsBenjamin Coleman, Benito Geordie, Li Chou, Ryan A. Leo Elworth et al.ICML 2022 · 11 citations
- RepBin: Constraint-Based Graph Representation Learning for Metagenomic BinningHansheng Xue, Vijini Mallawaarachchi, Yujia Zhang, Vaibhav Rajan et al.AAAI 2022 · 18 citations
- Kernel Sufficient Dimension Reduction and Variable Selection for Compositional Data via AmalgamationJunyoung Park, Jeongyoun Ahn, Cheolwoo ParkICML 2023 · 3 citations
- RapidGKC: GPU-Accelerated K-Mer CountingYiran Cheng, Xibo Sun, Qiong LuoICDE 2024 · 4 citations
