ϟ
 
DOI: 10.1038/nrg3117
¤ OpenAccess: Green
This work has “Green” OA status. This means it may cost money to access on the publisher landing page, but there is a free copy in an OA repository.

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

Todd J. Treangen,Steven L. Salzberg

Biology
DNA sequencing
Computational biology
2011
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.
Loading...
    Cite this:
Generate Citation
Powered by Citationsy*
    Repetitive DNA and next-generation sequencing: computational challenges and solutions” is a paper by Todd J. Treangen Steven L. Salzberg published in 2011. It has an Open Access status of “green”. You can read and download a PDF Full Text of this paper here.