Selecting loop breakers in general pedigrees.

Abstract excerpt

The presence of loops in pedigrees poses severe computational problems in likelihood calculation that can be solved by creating an equivalent unlooped pedigree. We introduce a heuristic polynomial-time dynamic-programming algorithm, called SFH, that addresses the problem of selecting a minimal-cost set of loop breakers. We report computational experiments on simulated pedigrees with up to 1000 individuals and 361...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Statistics as Topic
• Share to Time Factors
• Share to Algorithms