当前位置: X-MOL 学术Bioinformatics › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
GraphBin: refined binning of metagenomic contigs using assembly graphs.
Bioinformatics ( IF 4.4 ) Pub Date : 2020-03-13 , DOI: 10.1093/bioinformatics/btaa180
Vijini Mallawaarachchi 1 , Anuradha Wickramarachchi 1 , Yu Lin 1
Affiliation  

The field of metagenomics has provided valuable insights into the structure, diversity and ecology within microbial communities. One key step in metagenomics analysis is to assemble reads into longer contigs which are then binned into groups of contigs that belong to different species present in the metagenomic sample. Binning of contigs plays an important role in metagenomics and most available binning algorithms bin contigs using genomic features such as oligonucleotide/k-mer composition and contig coverage. As metagenomic contigs are derived from the assembly process, they are output from the underlying assembly graph which contains valuable connectivity information between contigs that can be used for binning.

中文翻译:

GraphBin:使用装配图精炼宏基因组重叠群。

宏基因组学领域为微生物群落内部的结构,多样性和生态学提供了宝贵的见解。宏基因组学分析的一个关键步骤是将读段组装成更长的重叠群,然后将其装箱成重叠群,这些重叠群属于宏基因组样本中存在的不同物种。重叠群的合并在宏基因组学中起着重要作用,并且大多数可用的合并算法使用基因组特征(例如寡核苷酸/ k-mer组成和重叠群覆盖)来对重叠群进行分类。由于宏基因组重叠群是从组装过程派生的,因此它们是从基础组装图输出的,该基础组装图包含可用于合并的重叠群之间的重要连接信息。
更新日期:2020-03-13
down
wechat
bug