A Faster and More General Hidden Markov Model Algorithm for Multipoint Likelihood Calculations
作者:
Ramana M. Idury,
Robert C. Elston,
期刊:
Human Heredity
(Karger Available online 1997)
卷期:
Volume 47,
issue 4
页码: 197-202
ISSN:0001-5652
年代: 1997
DOI:10.1159/000154413
出版商: S. Karger AG
关键词: Homozygosity mapping;Inheritance vectors;Linkage analysis;Recombination fraction
数据来源: Karger
摘要:
There are two basic algorithms for calculating multipoint linkage likelihoods: in one the computational effort increases linearly with the number of pedigree members and exponentially with the number of markers, in the other the effort increases exponentially with the number of persons but linearly with the number of markers. We describe a faster version of the latter algorithm for which there is no penalty in making the recombination fraction meiosis specific. This can lead to faster and potentially more powerful linkage analysis whenever the number of nonfounder meioses in a pedigree is not too large.
点击下载:
PDF
(1112KB)
返 回