Optimal linkage disequilibrium splitting.
Where this comes from
- Record sourced from PubMed, PMID 34260708.
- Also identified by DOI 10.1093/bioinformatics/btab519 and PMC identifier 8696101.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. Here, we develop an optimal solution for this problem using dynamic programming. This is now implemented as function snp_ldsplit as part of R package bigsnpr. Supplementary data are available at Bioinformatics online.
Medical subject headings
- Algorithms
- Linkage Disequilibrium
- Software