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.
机构:
Univ Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, EnglandUniv Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, England
Maniatis, N
论文数: 引用数:
h-index:
机构:
Collins, A
论文数: 引用数:
h-index:
机构:
Gibson, J
Zhang, WH
论文数: 0引用数: 0
h-index: 0
机构:
Univ Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, EnglandUniv Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, England
Zhang, WH
论文数: 引用数:
h-index:
机构:
Tapper, W
Morton, NE
论文数: 0引用数: 0
h-index: 0
机构:
Univ Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, EnglandUniv Southampton, Southampton Gen Hosp, Div Human Genet, Southampton SO16 6YD, Hants, England