Cargando…
A scalable assembly-free variable selection algorithm for biomarker discovery from metagenomes
BACKGROUND: Metagenomics holds great promises for deepening our knowledge of key bacterial driven processes, but metagenome assembly remains problematic, typically resulting in representation biases and discarding significant amounts of non-redundant sequence information. In order to alleviate const...
Autores principales: | Gkanogiannis, Anestis, Gazut, Stéphane, Salanoubat, Marcel, Kanj, Sawsan, Brüls, Thomas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4992282/ https://www.ncbi.nlm.nih.gov/pubmed/27542753 http://dx.doi.org/10.1186/s12859-016-1186-3 |
Ejemplares similares
-
A zero inflated log-normal model for inference of sparse microbial association networks
por: Prost, Vincent, et al.
Publicado: (2021) -
METAMVGL: a multi-view graph-based metagenomic contig binning algorithm by integrating assembly and paired-end graphs
por: Zhang, Zhenmiao, et al.
Publicado: (2021) -
Binning unassembled short reads based on k-mer abundance covariance using sparse coding
por: Kyrgyzov, Olexiy, et al.
Publicado: (2020) -
Accurate prediction of metagenome-assembled genome completeness by MAGISTA, a random forest model built on alignment-free intra-bin statistics
por: Goussarov, Gleb, et al.
Publicado: (2022) -
ITD assembler: an algorithm for internal tandem duplication discovery from short-read sequencing data
por: Rustagi, Navin, et al.
Publicado: (2016)