4.7 Review

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

Journal

NATURE REVIEWS GENETICS
Volume 13, Issue 1, Pages 36-46

Publisher

NATURE PUBLISHING GROUP
DOI: 10.1038/nrg3117

Keywords

-

Funding

  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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available