Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 32 Vassar Street, Cambridge, MA 02139, USA.
Genome Biol. 2010;11(10):R108. doi: 10.1186/gb-2010-11-10-r108. Epub 2010 Oct 29.
Hapi is a new dynamic programming algorithm that ignores uninformative states and state transitions in order to efficiently compute minimum-recombinant and maximum likelihood haplotypes. When applied to a dataset containing 103 families, Hapi performs 3.8 and 320 times faster than state-of-the-art algorithms. Because Hapi infers both minimum-recombinant and maximum likelihood haplotypes and applies to related individuals, the haplotypes it infers are highly accurate over extended genomic distances.
Hapi 是一种新的动态编程算法,它忽略无信息的状态和状态转换,以便有效地计算最小重组和最大似然单倍型。当应用于包含 103 个家族的数据集时,Hapi 的速度比最先进的算法快 3.8 倍和 320 倍。由于 Hapi 同时推断最小重组和最大似然单倍型,并适用于相关个体,因此它推断的单倍型在扩展的基因组距离上具有高度准确性。