Kruglyak L, Lander E S
Whitehead Institute for Biomedical Research, Cambridge, MA 02142, USA.
J Comput Biol. 1998 Spring;5(1):1-7. doi: 10.1089/cmb.1998.5.1.
Genetic linkage analysis of human pedigrees using many linked markers simultaneously is a difficult computational problem. We have previously described an approach to this problem that uses hidden Markov models (HMMs) and is quite efficient for pedigrees of moderate size. Here, we describe a new, faster algorithm for the key step in the HMM calculation. The algorithm employs a fast Fourier transform on the group of pedigree inheritance patterns. It substantially improves the overall performance of the software package GENEHUNTER for performing linkage analysis. The Fourier representation opens up new research directions for pedigree analysis.
同时使用多个连锁标记对人类家系进行遗传连锁分析是一个困难的计算问题。我们之前描述了一种解决该问题的方法,该方法使用隐马尔可夫模型(HMM),对于中等规模的家系相当有效。在这里,我们描述了一种用于HMM计算关键步骤的新的、更快的算法。该算法对家系遗传模式组采用快速傅里叶变换。它显著提高了用于进行连锁分析的软件包GENEHUNTER的整体性能。傅里叶表示为家系分析开辟了新的研究方向。