BioinformaticsGeneticsPeer-reviewed journal article
Optimal Linkage Disequilibrium Splitting
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 sub-optimal. Here we develop an optimal solution for this problem using dynamic programming. This is now implemented as function snp_ldplit as part of R package bigsnpr.
- Citations
- 23
- FWCI
- 2.97
- Field percentile
- top 8%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Approximately independent linkage disequilibrium blocks in human populations
Tomaz Berisa, Joseph K. Pickrell·BioinformaticsPeer-reviewed·Sep 22, 2015
- An Atlas of Linkage Disequilibrium Across Species
T. J. Zhu, Xing Huang, … Guo‐Bo Chen·bioRxiv·Sep 24, 2024
- How demography shapes linkage disequilibrium with or without recombination
E. Kerdoncuff, M. K. Ianni-Ravn, … G. Achaz·bioRxiv·Dec 13, 2023
- Constructing high-density linkage maps with MapDisto 2.0
Christopher Heffelfinger, Christopher Fragoso, Mathias Lorieux·BioinformaticsPeer-reviewed·Mar 25, 2017
- Scalable Bias-corrected Linkage Disequilibrium Estimation Under Genotype Uncertainty
David Gerard·HeredityPeer-reviewed·Aug 9, 2021
- Fast ordered sampling of DNA sequence variants
Anthony J. Greenberg·G3 Genes Genomes GeneticsPeer-reviewed·Mar 12, 2018