• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of computational biology and drug design >Algorithms for mapping short degenerate and weighted sequences to a reference genome.
【24h】

Algorithms for mapping short degenerate and weighted sequences to a reference genome.

机译：将短简并加权序列映射到参考基因组的算法。

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Novel high-throughput (Deep) sequencing technologies have redefined the way genome sequencing is performed. They are able to produce millions of short sequences in a single experiment and with a much lower cost than previous methods. In this paper, we address the problem of efficiently mapping and classifying millions of short sequences to a reference genome, based on whether they occur exactly once in the genome or not, and by taking into consideration probability scores. In particular, we design algorithms for Massive Exact and Approximate Pattern Matching of short degenerate and weighted sequences, derived from Deep sequencing technologies, to a reference genome.
机译：新型的高通量（深度）测序技术重新定义了基因组测序的执行方式。他们能够在单个实验中产生数百万个短序列，并且成本要比以前的方法低得多。在本文中，我们基于将几百万个短序列在基因组中是否仅发生一次以及考虑概率分数的问题，有效地将数百万个短序列映射和分类到参考基因组中。特别是，我们设计了将短的简并序列和加权序列的大规模精确和近似模式匹配算法，这些算法源自深度测序技术，并与参考基因组匹配。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号