Display Settings:

Format

Send to:

Choose Destination
See comment in PubMed Commons below
Nat Rev Genet. 2011 Nov 29;13(1):36-46. doi: 10.1038/nrg3117.

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

Author information

  • 1McKusick-Nathans Institute for Genetic Medicine, Johns Hopkins University School of Medicine, Baltimore, Maryland 21205, USA.

Erratum in

  • Nat Rev Genet. 2012 Feb;13(2):146.

Abstract

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.

PMID:
22124482
[PubMed - indexed for MEDLINE]
PMCID:
PMC3324860
Free PMC Article

Images from this publication.See all images (5)Free text

Figure 1
Figure 2
Figure 3
Figure 4
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Icon for Nature Publishing Group Icon for PubMed Central
    Loading ...
    Write to the Help Desk