ExpansionHunter
ExpansionHunter genotypes short tandem repeat (STR) regions using sequence graphs to accurately characterize repeat expansions and adjacent variants for genetic research and clinical applications.
Key Features:
- Sequence-Graph-Based Methodology: Uses sequence graphs to model complex genomic regions containing STRs, enabling precise genotyping of repeats adjacent to other variants and imperfect repeats such as polyalanine.
- Targeted Genotyping of Medically Significant Loci: Performs targeted genotyping across a broad class of medically significant loci that contain repeats relevant to repeat-expansion disorders.
- C++ Implementation: Implemented in C++ to provide computational performance for analysis of STR regions.
Scientific Applications:
- Study of repeat-expansion disorders: Used to genotype and investigate genetic disorders linked to repeat expansions, including Huntington's disease and certain muscular dystrophies.
- Genomics research and STR characterization: Provides precise genotyping data for genomics studies that require accurate characterization of STRs and adjacent variation.
Methodology:
Models STR-containing regions using sequence graphs to genotype repeats, including those adjacent to other variants and imperfect repeats such as polyalanine, and is implemented in C++.
Topics
Details
- License:
- Apache-2.0
- Maturity:
- Mature
- Cost:
- Free of charge
- Tool Type:
- command-line tool
- Operating Systems:
- Linux, Mac
- Programming Languages:
- C++
- Added:
- 7/4/2019
- Last Updated:
- 11/25/2024
Operations
Data Inputs & Outputs
Publications
Dolzhenko E, Deshpande V, Schlesinger F, Krusche P, Petrovski R, Chen S, Emig-Agius D, Gross A, Narzisi G, Bowman B, Scheffler K, van Vugt JJFA, French C, Sanchis-Juan A, Ibáñez K, Tucci A, Lajoie BR, Veldink JH, Raymond FL, Taft RJ, Bentley DR, Eberle MA. ExpansionHunter: a sequence-graph-based tool to analyze variation in short tandem repeat regions. Bioinformatics. 2019;35(22):4754-4756. doi:10.1093/bioinformatics/btz431. PMID:31134279. PMCID:PMC6853681.