anaerobic digestor
Recently Published Documents


TOTAL DOCUMENTS

38
(FIVE YEARS 7)

H-INDEX

15
(FIVE YEARS 0)

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Christopher Quince ◽  
Sergey Nurk ◽  
Sebastien Raguideau ◽  
Robert James ◽  
Orkun S. Soyer ◽  
...  

AbstractWe introduce STrain Resolution ON assembly Graphs (STRONG), which identifies strains de novo, from multiple metagenome samples. STRONG performs coassembly, and binning into metagenome assembled genomes (MAGs), and stores the coassembly graph prior to variant simplification. This enables the subgraphs and their unitig per-sample coverages, for individual single-copy core genes (SCGs) in each MAG, to be extracted. A Bayesian algorithm, BayesPaths, determines the number of strains present, their haplotypes or sequences on the SCGs, and abundances. STRONG is validated using synthetic communities and for a real anaerobic digestor time series generates haplotypes that match those observed from long Nanopore reads.


Author(s):  
Lea Chua Tan ◽  
Piet N. L. Lens

Simply adding granular activated carbon (GAC) in an anaerobic digestor treating lipid-rich wastewater can improve acidogenesis and methanogenesis by more than 10 times compared to the control without GAC.


2020 ◽  
Author(s):  
Wagdy Mahmoud ◽  
Esther Ososanya ◽  
Pradeep Behera ◽  
Abiose Adebayo ◽  
Xueqing Song ◽  
...  

2020 ◽  
Author(s):  
Christopher Quince ◽  
Sergey Nurk ◽  
Sebastien Raguideau ◽  
Robert James ◽  
Orkun S. Soyer ◽  
...  

AbstractWe introduce a novel bioinformatics pipeline, STrain Resolution ON assembly Graphs (STRONG), which identifies strains de novo, when multiple metagenome samples from the same community are available. STRONG performs coassembly, followed by binning into metagenome assembled genomes (MAGs), but uniquely it stores the coassembly graph prior to simplification of variants. This enables the subgraphs for individual single-copy core genes (SCGs) in each MAG to be extracted. It can then thread back reads from the samples to compute per sample coverages for the unitigs in these graphs. These graphs and their unitig coverages are then used in a Bayesian algorithm, BayesPaths, that determines the number of strains present, their sequences or haplotypes on the SCGs and their abundances in each of the samples.Our approach both avoids the ambiguities of read mapping and allows more of the information on co-occurrence of variants in reads to be utilised than if variants were treated independently, whilst at the same time exploiting the correlation of variants across samples that occurs when they are linked in the same strain. We compare STRONG to the current state of the art on synthetic communities and demonstrate that we can recover more strains, more accurately, and with a realistic estimate of uncertainty deriving from the variational Bayesian algorithm employed for the strain resolution. On a real anaerobic digestor time series we obtained strain-resolved SCGs for over 300 MAGs that for abundant community members match those observed from long Nanopore reads.


2020 ◽  
Author(s):  
Esther Ososanya ◽  
Abiose Adebayo ◽  
Jean-Pierre Fodjouo ◽  
Steven Omoijuanfo ◽  
Francis Ayissi ◽  
...  

2016 ◽  
Vol 114 ◽  
pp. 147-154 ◽  
Author(s):  
Xianfeng Feng ◽  
Bing Tang ◽  
Liying Bin ◽  
Haoliang Song ◽  
Shaosong Huang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document