An efficient solution to Hidden Markov Models on trees with coupled branches
Center of Mathematical Sciences and Applications, Harvard University(哈佛大学数学科学与应用中心);Dana-Farber Cancer Institute(丹娜法伯癌症研究院);Harvard Medical School(哈佛医学院);Broad Institute of MIT and Harvard(麻省理工学院与哈佛大学布罗德研究所)
Hidden Markov Models (HMMs) are powerful tools for modeling sequential data, where the underlying states evolve in a stochastic manner and are only indirectly observable. Traditional HMM approaches are well-established for linear sequences, and have been extended to other structures such as trees. In this paper, we extend the framework of HMMs on trees to address scenarios where the tree-like structure of the data includes coupled branches -- a common feature in biological systems where entities within the same lineage exhibit dependent characteristics. We develop a dynamic programming algorithm that efficiently solves the likelihood, decoding, and parameter learning problems for tree-based HMMs with coupled branches. Our approach scales polynomially with the number of states and nodes, making it computationally feasible for a wide range of applications and does not suffer from the underflow problem. We demonstrate our algorithm by applying it to simulated data and propose self-consistency checks for validating the assumptions of the model used for inference. This work not only advances the theoretical understanding of HMMs on trees but also provides a practical tool for analyzing complex biological data where dependencies between branches cannot be ignored.
Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding
National Centre for Register-based Research, Department of Public Health, Aarhus University(丹麦奥胡斯大学公共卫生系注册基于研究国家中心);Bioinformatics Research Centre, Aarhus University(丹麦奥胡斯大学生物信息学研究中心);Section for Evolutionary Genomics, Globe Institute, University of Copenhagen(丹麦哥本哈根大学全球研究所进化基因组学部门);Department of Mathematics, Aarhus University(丹麦奥胡斯大学数学系)