The pedigree trimming problem

This report mathematically validates a fast algorithm for trimming irrelevant members from a pedigree. These individuals are typically dead or otherwise unavailable for study. Left in the pedigree, they slow likelihood evaluation. Of course, each pedigree of interest will have some core people who must be retained. The described algorithm retains just enough of the pedigree to maintain the proper relationships among the core people. Copyright (C) 2004 S. Karger AG, Basel.