Integer programming for selecting set of informative markers in paternity inference.

ABSTRACT:

Background

Parentage information is fundamental to various life sciences. Recent advances in sequencing technologies have made it possible to accurately infer parentage even in non-model species. The optimization of sets of genome-wide markers is valuable for cost-effective applications but requires extremely large amounts of computation, which presses for the development of new efficient algorithms.

Results

Here, for a closed half-sib population, we generalized the process of marker loci selection as a binary integer programming problem. The proposed systematic formulation considered marker localization and the family structure of the potential parental population, resulting in an accurate assignment with a small set of markers. We also proposed an efficient heuristic appro

SUBMITTER: Nishiyama S 

PROVIDER: S-EPMC9264695 | biostudies-literature | 2022 Jul

REPOSITORIES: biostudies-literature