首页> 美国卫生研究院文献>BMC Genomics >Graph mining for next generation sequencing: leveraging the assembly graph for biological insights
【2h】

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights

机译:图挖掘用于下一代测序:利用装配图获得生物学见解

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

BackgroundThe assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes.
机译:背景技术下一代测序(NGS)读段的组装仍然是一项艰巨的任务。对于来源于环境样本的宏基因组学数据的汇编尤其如此,该环境样本可能包含成百上千的独特物种。当前组装工具的主要目标是将NGS读段组装为连续序列,称为重叠群,同时最大化准确性和重叠群长度。此过程的最终目标是制作更长的重叠群,其主要重点仅在于组装。序列读取组装是一个聚合过程,在此过程中,由于将读取合并为更长的序列或重叠群,因此读取的重叠关系信息会丢失。组装图信息丰富,并且能够捕获输入读取数据集的基因组架构。我们已经开发了一种新颖的混合图,其中节点代表不同粒度级别的序列区域。在组装和分析管道Focus中使用的该模型提供了给定输入数据集的简洁而功能丰富的视图,允许提取生物学相关的图结构以进行图挖掘。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号