efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes高效的算法分析节段在基因组重复删除和反演.pdfVIP

  • 3
  • 0
  • 约9.59万字
  • 约 12页
  • 2017-09-06 发布于上海
  • 举报

efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes高效的算法分析节段在基因组重复删除和反演.pdf

efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes高效的算法分析节段在基因组重复删除和反演

Kahn et al. Algorithms for Molecular Biology 2010, 5:11 /content/5/1/11 RESEARCH Open Access Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes Crystal L Kahn1*, Shay Mozes1*, Benjamin J Raphael1,2* Abstract Background: Segmental duplications, or low-copy repeats, are common in mammalian genomes. In the human genome, most segmental duplications are mosaics comprised of multiple duplicated fragments. This complex genomic org

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档