Back to Search Start Over

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

Authors :
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
Source :
Genome Biology, Vol 21, Iss 1, Pp 1-14 (2020)
Publication Year :
2020
Publisher :
BMC, 2020.

Abstract

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.

Details

Language :
English
ISSN :
1474760X
Volume :
21
Issue :
1
Database :
Directory of Open Access Journals
Journal :
Genome Biology
Publication Type :
Academic Journal
Accession number :
edsdoj.6a0e5f3dd2f430489a30306e1ab55af
Document Type :
article
Full Text :
https://doi.org/10.1186/s13059-020-02017-z