Format

Send to

Choose Destination
See comment in PubMed Commons below
Bioinformatics. 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.

Author information

1
Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel. dang@cs.technion.ac.il

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.

PMID:
19477987
PMCID:
PMC2687978
DOI:
10.1093/bioinformatics/btp224
[Indexed for MEDLINE]
Free PMC Article
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Silverchair Information Systems Icon for PubMed Central
    Loading ...
    Support Center