Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2009 Jun 15;25(12):i196-203.
doi: 10.1093/bioinformatics/btp224.

Speeding up HMM algorithms for genetic linkage analysis via chain reductions of the state space

Affiliations

Speeding up HMM algorithms for genetic linkage analysis via chain reductions of the state space

Dan Geiger et al. Bioinformatics. .

Abstract

We develop an hidden Markov model (HMM)-based algorithm for computing exact parametric and non-parametric linkage scores in larger pedigrees than was possible before. The algorithm is applicable whenever there are chains of persons in the pedigree with no genetic measurements and with unknown affection status. The algorithm is based on shrinking the state space of the HMM considerably using such chains. In a two g-degree cousins pedigree the reduction drops the state space from being exponential in g to being linear in g. For a Finnish family in which two affected children suffer from a rare cold-inducing sweating syndrome, we were able to reduce the state space by more than five orders of magnitude from 2(50) to 2(32). In another pedigree of state-space size of 2(27), used for a study of pituitary adenoma, the state space reduced by a factor of 8.5 and consequently exact linkage scores can now be computed, rather than approximated.

Supplementary information: Supplementary data are available at Bioinformatics online.

PubMed Disclaimer

Figures

Fig. 1.
Fig. 1.
A normalized pedigree with two founders (A and B) and three typed distant cousins (Dt, Eu and Fz, with genotypes g1, g2 and g3 respectively). The chains D, E and F can be reduced from a collection of selectors to one cluster each with number of states linear in the chain's length. In Pedigree II, the collection of the selectors in the two chains, can be reduced to a single cluster with number of states linear in the sum of lengths of the two chains.
Fig. 2.
Fig. 2.
A normalized pedigree used by Vierimaa et al. (2006) for the study of pituitary adenoma. There are six typed individuals in the pedigree that are marked in black stripes. We use chains 1, 2 and 3 to reduce the state space by a factor of 8.5 and speedup computations.
Fig. 3.
Fig. 3.
Runtime comparison for computations using the original model and the reduced state-space model for the pedigree in Figure 2, as a function of the length m of Chain 1.
Fig. 4.
Fig. 4.
Runtime comparison for computations using the original model and the reduced state-space model for the pedigree in Figure 2 across 6000 markers, where Chain 1 is of length 0.
Fig. 5.
Fig. 5.
The Finnish family studied by Knappskog et al. (2003), which includes two affected individuals that suffer from cold-inducing sweating syndrome (marked in black).

Similar articles

Cited by

References

    1. Abecasis GR, et al. Merlin-rapid analysis of dense genetic maps using sparse gene flow trees. Nat. Genet. 2002;30:97–101. - PubMed
    1. Albers C, et al. Multipoint approximations of identity-by-descent probabilities for accurate linkage analysis of distantly related individuals. Am. J. Hum. Genet. 2008;82:607–622. - PMC - PubMed
    1. Cottingham RW, et al. Faster sequential genetic linkage computations. Am. J. Hum. Genet. 1993;53:252–263. - PMC - PubMed
    1. Dechter R. Bucket elimination: a unifying framework for probabilistic inference. In: Jordan MI, editor. Learning in Graphical Models. Kluwer Academic Press; 1998. pp. 75–104.
    1. Elston R, Stewart J. A general model for the analysis of pedigree data. Hum. Hered. 1971;21:523–542. - PubMed