Exact Decoding of a Sequentially Markov Coalescent Model in Genetics

溯祖理论 频数推理 计算机科学 推论 马尔可夫链 隐马尔可夫模型 马尔可夫模型 Python(编程语言) 群体遗传学 算法 贝叶斯概率 人口 贝叶斯推理 机器学习 人工智能 生物 遗传学 人口学 社会学 基因 系统发育树 操作系统
作者
Caleb Ki,Jonathan Terhorst
标识
DOI:10.1080/01621459.2023.2252570
摘要

AbstractIn statistical genetics, the sequentially Markov coalescent (SMC) is an important family of models for approximating the distribution of genetic variation data under complex evolutionary models. Methods based on SMC are widely used in genetics and evolutionary biology, with significant applications to genotype phasing and imputation, recombination rate estimation, and inferring population history. SMC allows for likelihood-based inference using hidden Markov models (HMMs), where the latent variable represents a genealogy. Because genealogies are continuous, while HMMs are discrete, SMC requires discretizing the space of trees in a way that is awkward and creates bias. In this work, we propose a method that circumvents this requirement, enabling SMC-based inference to be performed in the natural setting of a continuous state space. We derive fast, exact procedures for frequentist and Bayesian inference using SMC. Compared to existing methods, ours requires minimal user intervention or parameter tuning, no numerical optimization or E-M, and is faster and more accurate. Supplementary materials for this article are available online.Keywords: ChangepointCoalescentHidden Markov modelPopulation genetics Supplementary MaterialsIn the supplement we present supporting lemmas, proofs of the theorems, and additional plots and tables. (pdf)Disclosure StatementNo potential conflict of interest was reported by the author(s).Data Availability StatementAll of the data analyzed in this article are either simulated, or publicly available. A Python package implementing our method is available at https://terhorst.github.io/xsmc. Code which reproduces all of the figures and tables in this article is available at https://terhorst.github.io/xsmc/paper.Additional informationFundingThis research was supported by the National Science Foundation (grant number DMS-2052653, and a Graduate Research Fellowship), and the National Institute of General Medical Sciences of the National Institutes of Health under award number R35GM151145. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
南国之霄发布了新的文献求助10
1秒前
2秒前
mkljl发布了新的文献求助10
2秒前
3秒前
HDXHB发布了新的文献求助10
4秒前
张键豪发布了新的文献求助10
5秒前
fufu发布了新的文献求助10
6秒前
7秒前
柳亦诚应助坦率晓霜采纳,获得10
8秒前
8秒前
9秒前
周小鱼发布了新的文献求助10
11秒前
核桃应助fufu采纳,获得10
12秒前
浮游应助HOH采纳,获得10
12秒前
12秒前
13秒前
13秒前
14秒前
kk发布了新的文献求助10
15秒前
许晴发布了新的文献求助10
18秒前
nicole发布了新的文献求助10
18秒前
文艺水风完成签到 ,获得积分0
19秒前
19秒前
21秒前
21秒前
22秒前
微雨若,,完成签到 ,获得积分10
24秒前
羚羊完成签到,获得积分10
24秒前
25秒前
刘老哥6发布了新的文献求助10
25秒前
gougou发布了新的文献求助10
26秒前
顾矜应助科研通管家采纳,获得10
26秒前
鸣笛应助科研通管家采纳,获得10
26秒前
852应助科研通管家采纳,获得10
26秒前
orixero应助科研通管家采纳,获得10
27秒前
27秒前
小明应助科研通管家采纳,获得10
27秒前
Hello应助科研通管家采纳,获得10
27秒前
顾矜应助袁艺珊采纳,获得10
27秒前
思源应助科研通管家采纳,获得10
27秒前
高分求助中
(应助此贴封号)【重要!!请各位详细阅读】【科研通的精品贴汇总】 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
Determination of the boron concentration in diamond using optical spectroscopy 600
The Netter Collection of Medical Illustrations: Digestive System, Volume 9, Part III - Liver, Biliary Tract, and Pancreas (3rd Edition) 600
Founding Fathers The Shaping of America 500
A new house rat (Mammalia: Rodentia: Muridae) from the Andaman and Nicobar Islands 500
2025-2031全球及中国蛋黄lgY抗体行业研究及十五五规划分析报告(2025-2031 Global and China Chicken lgY Antibody Industry Research and 15th Five Year Plan Analysis Report) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4536579
求助须知:如何正确求助?哪些是违规求助? 3971805
关于积分的说明 12304920
捐赠科研通 3638619
什么是DOI,文献DOI怎么找? 2003355
邀请新用户注册赠送积分活动 1038791
科研通“疑难数据库(出版商)”最低求助积分说明 928215