Related Experiment Video
Updated: Aug 18, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
Published on: December 10, 2012
On reducing the statespace of hidden Markov models for the identity by descent process
Sharon Browning1, Brian L Browning
1Bioinformatics Research Center, North Carolina State University, Campus Box 7566, Raleigh, North Carolina 27695-7566, USA.
Abstract:
Important methods for calculating likelihoods of genealogical relationships and mapping genes are based on hidden Markov models for the process of identity by descent along chromosomes. The computational time for the algorithms depends critically on the size of the statespace of the hidden Markov model. We describe the maximal grouping together of states of the model to reduce the size of the statespace. This grouping is based on pedigree symmetries. We also present an efficient algorithm for finding the maximal grouping.
Related Concept Videos
Deactivation Processes: Jablonski Diagram
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Gaussian Elimination: Problem Solving

