| Literature DB >> 31134279 |
Egor Dolzhenko1, Viraj Deshpande1, Felix Schlesinger1, Peter Krusche2, Roman Petrovski2, Sai Chen1, Dorothea Emig-Agius1, Andrew Gross1, Giuseppe Narzisi3, Brett Bowman1, Konrad Scheffler1, Joke J F A van Vugt4, Courtney French5, Alba Sanchis-Juan6,7, Kristina Ibáñez8, Arianna Tucci8, Bryan R Lajoie1, Jan H Veldink4, F Lucy Raymond5, Ryan J Taft1, David R Bentley2, Michael A Eberle1.
Abstract
SUMMARY: We describe a novel computational method for genotyping repeats using sequence graphs. This method addresses the long-standing need to accurately genotype medically important loci containing repeats adjacent to other variants or imperfect DNA repeats such as polyalanine repeats. Here we introduce a new version of our repeat genotyping software, ExpansionHunter, that uses this method to perform targeted genotyping of a broad class of such loci.Entities:
Mesh:
Year: 2019 PMID: 31134279 PMCID: PMC6853681 DOI: 10.1093/bioinformatics/btz431
Source DB: PubMed Journal: Bioinformatics ISSN: 1367-4803 Impact factor: 6.937
Fig. 1.Overview of ExpansionHunter. (a) A locus definition is read from the variant catalog file. (b) Sequence graph is constructed according to its specification in the variant catalog. (c) Relevant reads are extracted from the input binary alignment/map file. (d) Reads are aligned to the graph. (e) Alignments are pieced together to genotype each variant