...
首页> 外文期刊>Journal of Bioinformatics and Computational Biology >A SIMPLE SHORTCUT TO UNSUPERVISED ALIGNMENT-FREE PHYLOGENETIC GENOME GROUPINGS, EVEN FROM UNASSEMBLED SEQUENCING READS
【24h】

A SIMPLE SHORTCUT TO UNSUPERVISED ALIGNMENT-FREE PHYLOGENETIC GENOME GROUPINGS, EVEN FROM UNASSEMBLED SEQUENCING READS

机译:简单地选择无监督的无同源系统基因组,即使没有序列化读段

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We propose an extension to alignment-free approaches that can produce reasonably accurate phylogenetic groupings starting from unaligned genomes, for example, as fast as 1 min on a standard desktop computer for 25 bacterial genomes. A 6-fold speed-up and 11-fold reduction in memory requirements compared to previous alignment-free methods is achieved by reducing the comparison space to a representative sample of k-mers of optimal length and with specific tag motifs. This approach was applied to the test case of fitting the enterohemorrhagic O104:H4 E.coli strain from the 2011 outbreak in Germany into the phylogenetic network of previously known E.coli-related strains and extend the method to allow assigning any new strain to the correct phylogenetic group even directly from unassembled short sequence reads from next generation sequencing data. Hence, this approach is also useful to quickly identify the most suitable reference genome for subsequent assembly steps.
机译:我们提议扩展到无比对方法,该方法可以从未比对的基因组开始产生合理准确的系统发育分组,例如,在25个细菌基因组的标准台式计算机上,最快1分钟。通过将比较空间减少到具有最佳长度并带有特定标签基序的k-mers的代表性样本,与以前的无比对方法相比,内存需求提高了6倍,存储需求减少了11倍。该方法适用于将2011年德国爆发的肠出血性O104:H4大肠杆菌菌株装配到先前已知的与大肠杆菌相关的菌株的系统进化网络中的测试案例,并扩展了该方法以允许将任何新菌株分配给甚至直接从下一代测序数据中读取未组装的短序列,也可以纠正正确的系统发生群。因此,该方法对于快速识别最合适的参考基因组以用于后续组装步骤也是有用的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号