Haplotype Inference for Pedigrees with Few Recombinations

Abstract

Pedigrees, or family trees, are graphs of family relationships that are used to study inheritance. A fundamental problem in computational biology is to find, for a pedigree with n individuals genotyped at every site, a set of Mendelian-consistent haplotypes that have the minimum number of recombinations. This is an NP-hard problem and some pedigrees can… (More)
DOI: 10.1007/978-3-319-38782-6_23

Topics

6 Figures and Tables

Slides referencing similar topics