Optimal linkage disequilibrium splitting

MOTIVATION: A few algorithms have been developed for splitting the genome in nearly independent blocks of linkage disequilibrium. Due to the complexity of this problem, these algorithms rely on heuristics, which makes them suboptimal. RESULTS: Here, we develop an optimal solution for this problem us...

Descripción completa

Detalles Bibliográficos
Autor principal: Privé, Florian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2021
Materias:
Applications Notes
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8696101/
https://www.ncbi.nlm.nih.gov/pubmed/34260708
http://dx.doi.org/10.1093/bioinformatics/btab519
Descripción
Sumario:MOTIVATION: A few algorithms have been developed for splitting the genome in nearly independent blocks of linkage disequilibrium. Due to the complexity of this problem, these algorithms rely on heuristics, which makes them suboptimal. RESULTS: Here, we develop an optimal solution for this problem using dynamic programming. AVAILABILITY: This is now implemented as function snp_ldsplit as part of R package bigsnpr. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Ejemplares similares