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

1.2kCitations
Citations of this article
2.8kReaders
Mendeley users who have this article in their library.
Get full text

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. © 2011 Macmillan Publishers Limited. All rights reserved.

Cite

CITATION STYLE

APA

Treangen, T. J., & Salzberg, S. L. (2012, January). Repetitive DNA and next-generation sequencing: Computational challenges and solutions. Nature Reviews Genetics. https://doi.org/10.1038/nrg3117

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free