首页> 外文会议>Annual international conference on research in computational molecular biology >ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching
【24h】

ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching

机译:ScaffMatch:基于最大权重匹配的脚手架算法

获取原文

摘要

Next-generation sequencing (NGS) is a powerful technology as it can produce millions of short read pairs covering whole genome; however, a complete genome assembly remains challenging. Usually, assembled genome pieces (i.e., contigs) are merged into chains (i.e., scaffolds) using read pairs mapped to pairs of con-tigs. A recent comprehensive evaluation of available software shows that the scaffolding problem is still open . In this paper we present a novel scaffolding tool ScaffMatch based on the maximum weight matching of pairs of reverse complement strands representing contigs and further filling the scaffold with skipped short contigs.
机译:下一代测序(NGS)是一项强大的技术,因为它可以产生覆盖整个基因组的数百万条短读对。然而,完整的基因组组装仍然具有挑战性。通常,组装的基因组片段(即重叠群)使用映射到重叠对的读对对合并成链(即支架)。最近对可用软件进行的全面评估表明,脚手架问题仍未解决。在本文中,我们提出了一种新颖的脚手架工具ScaffMatch,它基于代表重叠群的反向互补链对的最大重量匹配,并用跳过的短重叠群填充了脚手架。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号