On reducing the statespace of hidden Markov models for the identity by descent process

DOI10.1006/TPBI.2002.1583zbMATH Open1064.92031OpenAlexW1966547481WikidataQ44877911 ScholiaQ44877911MaRDI QIDQ2483952FDOQ2483952

Authors: Sharon Guy Browning, Brian L. Browning 

Publication date: 1 August 2005

Published in: Theoretical Population Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/tpbi.2002.1583

Recommendations

• scientific article; zbMATH DE number 1750194
• Efficient computation of lod scores: genotype elimination, genotype redefinition, and hybrid maximum likelihood algorithms
• Efficient maximum likelihood pedigree reconstruction
• Algorithmic Learning Theory
• An Average-Case Sublinear Exact Li and Stephens Forward Algorithm

zbMATH Keywords

hidden Markov modelsrelationship inferenceidentity by descentgenetic linkage analysis

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Cites Work

• Statistical inference from genetic data on pedigrees
• A Markovian Function of a Markov Chain
• Gene Identities and Multiple Relationships
• The probability that related individuals share some section of genome identical by descent
• Finite Continuous Time Markov Chains
• Title not available (Why is that?)

Cited In (2)

• A sufficient condition for reducing recursions in hidden Markov models
• A sequential pruning strategy for the selection of the number of states in hidden Markov models

Uses Software

• GENEHUNTER

This page was built for publication: On reducing the statespace of hidden Markov models for the identity by descent process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483952)