ExpansionHunter Denovo: A computational method for locating known and novel repeat expansions in short-read sequencing data

Egor Dolzhenko, Mark F. Bennett, Phillip A. Richmond, Brett Trost, Sai Chen, Joke J.F.A. Van Vugt, Charlotte Nguyen, Giuseppe Narzisi, Vladimir G. Gainullin, Andrew M. Gross, Bryan R. Lajoie, Ryan J. Taft, Wyeth W. Wasserman, Stephen W. Scherer, Jan H. Veldink, David R. Bentley, Ryan K.C. Yuen, Melanie Bahlo, Michael A. Eberle*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

4 Downloads (Pure)

Abstract

Repeat expansions are responsible for over 40 monogenic disorders, and undoubtedly more pathogenic repeat expansions remain to be discovered. Existing methods for detecting repeat expansions in short-read sequencing data require predefined repeat catalogs. Recent discoveries emphasize the need for methods that do not require pre-specified candidate repeats. To address this need, we introduce ExpansionHunter Denovo, an efficient catalog-free method for genome-wide repeat expansion detection. Analysis of real and simulated data shows that our method can identify large expansions of 41 out of 44 pathogenic repeats, including nine recently reported non-reference repeat expansions not discoverable via existing methods.

Original languageEnglish
Article number102
Number of pages14
JournalGenome Biology
Volume21
Issue number1
DOIs
Publication statusPublished - 28 Apr 2020

Keywords

  • Fragile X syndrome
  • Friedreich ataxia
  • Genome-wide analysis
  • Huntington disease
  • Myotonic dystrophy type 1
  • Repeat expansions
  • Short tandem repeats
  • Whole-genome sequencing data
  • Fragile X Syndrome/genetics
  • Humans
  • Myotonic Dystrophy/genetics
  • Case-Control Studies
  • Whole Genome Sequencing
  • DNA Repeat Expansion
  • Huntington Disease/genetics
  • High-Throughput Nucleotide Sequencing
  • Software
  • Friedreich Ataxia/genetics
  • Microsatellite Repeats

Cite this