4.7 Review

Repetitive DNA and next-generation sequencing: computational challenges and solutions

期刊

NATURE REVIEWS GENETICS
卷 13, 期 1, 页码 36-46

出版社

NATURE PUBLISHING GROUP
DOI: 10.1038/nrg3117

关键词

-

资金

  1. NHGRI NIH HHS [R01 HG006677, R01 HG006102-02, R01 HG006677-12, R01 HG006102, R01 HG006102-01, R01 HG006677-13] Funding Source: Medline
  2. NIGMS NIH HHS [R01 GM083873] Funding Source: Medline
  3. NATIONAL HUMAN GENOME RESEARCH INSTITUTE [R01HG006677, R01HG006102] Funding Source: NIH RePORTER
  4. NATIONAL INSTITUTE OF GENERAL MEDICAL SCIENCES [R01GM083873] Funding Source: NIH RePORTER

向作者/读者索取更多资源

Repetitive DNA sequences are abundant in a broad range of species, from bacteria to mammals, and they cover nearly half of the human genome. Repeats have always presented technical challenges for sequence alignment and assembly programs. Next-generation sequencing projects, with their short read lengths and high data volumes, have made these challenges more difficult. From a computational perspective, repeats create ambiguities in alignment and assembly, which, in turn, can produce biases and errors when interpreting results. Simply ignoring repeats is not an option, as this creates problems of its own and may mean that important biological phenomena are missed. We discuss the computational problems surrounding repeats and describe strategies used by current bioinformatics systems to solve them.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据