scholarly journals MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads

2012 ◽  
Vol 40 (20) ◽  
pp. e155-e155 ◽  
Author(s):  
Toshiaki Namiki ◽  
Tsuyoshi Hachiya ◽  
Hideaki Tanaka ◽  
Yasubumi Sakakibara
protocols.io ◽  
2015 ◽  
Author(s):  
Afiahayati not provided ◽  
Sato K ◽  
Namiki T ◽  
Hachiya T ◽  
Tanaka H ◽  
...  

2021 ◽  
Vol 22 (S10) ◽  
Author(s):  
Zhenmiao Zhang ◽  
Lu Zhang

Abstract Background Due to the complexity of microbial communities, de novo assembly on next generation sequencing data is commonly unable to produce complete microbial genomes. Metagenome assembly binning becomes an essential step that could group the fragmented contigs into clusters to represent microbial genomes based on contigs’ nucleotide compositions and read depths. These features work well on the long contigs, but are not stable for the short ones. Contigs can be linked by sequence overlap (assembly graph) or by the paired-end reads aligned to them (PE graph), where the linked contigs have high chance to be derived from the same clusters. Results We developed METAMVGL, a multi-view graph-based metagenomic contig binning algorithm by integrating both assembly and PE graphs. It could strikingly rescue the short contigs and correct the binning errors from dead ends. METAMVGL learns the two graphs’ weights automatically and predicts the contig labels in a uniform multi-view label propagation framework. In experiments, we observed METAMVGL made use of significantly more high-confidence edges from the combined graph and linked dead ends to the main graph. It also outperformed many state-of-the-art contig binning algorithms, including MaxBin2, MetaBAT2, MyCC, CONCOCT, SolidBin and GraphBin on the metagenomic sequencing data from simulation, two mock communities and Sharon infant fecal samples. Conclusions Our findings demonstrate METAMVGL outstandingly improves the short contig binning and outperforms the other existing contig binning tools on the metagenomic sequencing data from simulation, mock communities and infant fecal samples.


2018 ◽  
Vol 151 ◽  
pp. 99-105 ◽  
Author(s):  
Esmaeil Forouzan ◽  
Parvin Shariati ◽  
Masoumeh Sadat Mousavi Maleki ◽  
Ali Asghar Karkhane ◽  
Bagher Yakhchali

1996 ◽  
Vol 97 (5) ◽  
pp. 568-572 ◽  
Author(s):  
Thomas Eggermann ◽  
Hartmut Engels ◽  
Barbara Moskalonek ◽  
Markus M. Nöthen ◽  
Jutta Müller-Navia ◽  
...  

PLoS ONE ◽  
2016 ◽  
Vol 11 (3) ◽  
pp. e0150719 ◽  
Author(s):  
Chong Chu ◽  
Rasmus Nielsen ◽  
Yufeng Wu
Keyword(s):  
De Novo ◽  

2017 ◽  
Author(s):  
Roye Rozov ◽  
Gil Goldshlager ◽  
Eran Halperin ◽  
Ron Shamir

AbstractMotivationWe present Faucet, a 2-pass streaming algorithm for assembly graph construction. Faucet builds an assembly graph incrementally as each read is processed. Thus, reads need not be stored locally, as they can be processed while downloading data and then discarded. We demonstrate this functionality by performing streaming graph assembly of publicly available data, and observe that the ratio of disk use to raw data size decreases as coverage is increased.ResultsFaucet pairs the de Bruijn graph obtained from the reads with additional meta-data derived from them. We show these metadata - coverage counts collected at junction k-mers and connections bridging between junction pairs - contain most salient information needed for assembly, and demonstrate they enable cleaning of metagenome assembly graphs, greatly improving contiguity while maintaining accuracy. We compared Faucet’s resource use and assembly quality to state of the art metagenome assemblers, as well as leading resource-efficient genome assemblers. Faucet used orders of magnitude less time and disk space than the specialized metagenome assemblers MetaSPAdes and Megahit, while also improving on their memory use; this broadly matched performance of other assemblers optimizing resource efficiency - namely, Minia and LightAssembler. However, on metagenomes tested, Faucet’s outputs had 14-110% higher mean NGA50 lengths compared to Minia, and 2-11-fold higher mean NGA50 lengths compared to LightAssembler, the only other streaming assembler available.AvailabilityFaucet is available at https://github.com/Shamir-Lab/[email protected],[email protected] information:Supplementary data are available at Bioinformatics online.


2021 ◽  
Vol 10 (7) ◽  
Author(s):  
Tshepiso Pleasure Ateba ◽  
Kazeem Adekunle Alayande ◽  
Mulunda Mwanza

ABSTRACT The de novo metagenome assembly for C1-TPA is 68,577,389 bp long spread over 10,108 contigs, while that of C3-TPA is 55,517,929 bp distributed over 9,415 contigs. A total of 8 metagenome-assembled genomes (MAGs) were extracted from C1-TPA, and 10 were extracted from C3-TPA. Both samples have a Flavobacterium sp. and a Pseudomonas sp. in common among their bacterial communities.


2021 ◽  
Author(s):  
Rei Kajitani ◽  
Hideki Noguchi ◽  
Yasuhiro Gotoh ◽  
Yoshitoshi Ogura ◽  
Dai Yoshimura ◽  
...  

Abstract De novo metagenome assembly is effective in assembling multiple draft genomes, including those of uncultured organisms. However, heterogeneity in the metagenome hinders assembly and introduces interspecies misassembly deleterious for downstream analysis. For this purpose, we developed a hybrid metagenome assembler, MetaPlatanus. First, as a characteristic function, it assembles the basic contigs from accurate short reads and then iteratively utilizes long-range sequence links, species-specific sequence compositions, and coverage depth. The binning information was also used to improve contiguity. Benchmarking using mock datasets consisting of known bacteria with long reads or mate pairs revealed the high contiguity MetaPlatanus with a few interspecies misassemblies. For published human gut data with nanopore reads from potable sequencers, MetaPlatanus assembled many biologically important elements, such as coding genes, gene clusters, viral sequences, and over-half bacterial genomes. In the benchmark with published human saliva data with high-throughput nanopore reads, the superiority of MetaPlatanus was considerably more evident. We found that some high-abundance bacterial genomes were assembled only by MetaPlatanus as near-complete. Furthermore, MetaPlatanus can circumvent the limitations of highly fragmented assemblies and frequent interspecies misassembles obtained by the other tools. Overall, the study demonstrates that MetaPlatanus could be an effective approach for exploring large-scale structures in metagenomes.


Microbiome ◽  
2021 ◽  
Vol 9 (1) ◽  
Author(s):  
Lena Granehäll ◽  
Kun D. Huang ◽  
Adrian Tett ◽  
Paolo Manghi ◽  
Alice Paladin ◽  
...  

Abstract Background Dental calculus (mineralised dental plaque) preserves many types of microfossils and biomolecules, including microbial and host DNA, and ancient calculus are thus an important source of information regarding our ancestral human oral microbiome. In this study, we taxonomically characterised the dental calculus microbiome from 20 ancient human skeletal remains originating from Trentino-South Tyrol, Italy, dating from the Neolithic (6000–3500 BCE) to the Early Middle Ages (400–1000 CE). Results We found a high abundance of the archaeal genus Methanobrevibacter in the calculus. However, only a fraction of the sequences showed high similarity to Methanobrevibacter oralis, the only described Methanobrevibacter species in the human oral microbiome so far. To further investigate the diversity of this genus, we used de novo metagenome assembly to reconstruct 11 Methanobrevibacter genomes from the ancient calculus samples. Besides the presence of M. oralis in one of the samples, our phylogenetic analysis revealed two hitherto uncharacterised and unnamed oral Methanobrevibacter species that are prevalent in ancient calculus samples sampled from a broad range of geographical locations and time periods. Conclusions We have shown the potential of using de novo metagenomic assembly on ancient samples to explore microbial diversity and evolution. Our study suggests that there has been a possible shift in the human oral microbiome member Methanobrevibacter over the last millennia.


2019 ◽  
Author(s):  
Robert Vaser ◽  
Mile Šikić

AbstractAdvances in sequencing technologies have pushed the limits of genome assemblies beyond imagination. The sheer amount of long read data that is being generated enables the assembly for even the largest and most complex organism for which efficient algorithms are needed. We present a new tool, called Ra, for de novo genome assembly of long uncorrected reads. It is a fast and memory friendly assembler based on sequence classification and assembly graphs, developed with large genomes in mind. It is freely available at https://github.com/lbcb-sci/ra.This work has been supported in part by the Croatian Science Foundation under the project Single genome and metagenome assembly (IP-2018-01-5886), and in part by the European Regional Development Fund under the grant KK.01.1.1.01.0009 (DATACROSS). In addition, M.Š. is partly supported by funding from A*STAR, Singapore.


Sign in / Sign up

Export Citation Format

Share Document