Back to Search Start Over

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

Authors :
Dolzhenko, E
Bennett, MF
Richmond, PA
Trost, B
Chen, S
van Vugt, JJFA
Nguyen, C
Narzisi, G
Gainullin, VG
Gross, AM
Lajoie, BR
Taft, RJ
Wasserman, WW
Scherer, SW
Veldink, JH
Bentley, DR
Yuen, RKC
Bahlo, M
Eberle, MA
Dolzhenko, E
Bennett, MF
Richmond, PA
Trost, B
Chen, S
van Vugt, JJFA
Nguyen, C
Narzisi, G
Gainullin, VG
Gross, AM
Lajoie, BR
Taft, RJ
Wasserman, WW
Scherer, SW
Veldink, JH
Bentley, DR
Yuen, RKC
Bahlo, M
Eberle, MA
Publication Year :
2020

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

Database :
OAIster
Publication Type :
Electronic Resource
Accession number :
edsoai.on1315717167
Document Type :
Electronic Resource