{"title":"重组下的祖先系","authors":"E. Baake, M. Baake","doi":"10.4171/ecr/17-1/17","DOIUrl":null,"url":null,"abstract":"Solving the recombination equation has been a long-standing challenge of \\emph{deterministic} population genetics. We review recent progress obtained by introducing ancestral processes, as traditionally used in the context of \\emph{stochastic} models of population genetics, into the deterministic setting. With the help of an ancestral partitioning process, which is obtained by letting population size tend to infinity (without rescaling parameters or time) in an ancestral recombination graph, we obtain the solution to the recombination equation in a transparent form.","PeriodicalId":298855,"journal":{"name":"Probabilistic Structures in Evolution","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Ancestral lines under recombination\",\"authors\":\"E. Baake, M. Baake\",\"doi\":\"10.4171/ecr/17-1/17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solving the recombination equation has been a long-standing challenge of \\\\emph{deterministic} population genetics. We review recent progress obtained by introducing ancestral processes, as traditionally used in the context of \\\\emph{stochastic} models of population genetics, into the deterministic setting. With the help of an ancestral partitioning process, which is obtained by letting population size tend to infinity (without rescaling parameters or time) in an ancestral recombination graph, we obtain the solution to the recombination equation in a transparent form.\",\"PeriodicalId\":298855,\"journal\":{\"name\":\"Probabilistic Structures in Evolution\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Probabilistic Structures in Evolution\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4171/ecr/17-1/17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Probabilistic Structures in Evolution","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4171/ecr/17-1/17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving the recombination equation has been a long-standing challenge of \emph{deterministic} population genetics. We review recent progress obtained by introducing ancestral processes, as traditionally used in the context of \emph{stochastic} models of population genetics, into the deterministic setting. With the help of an ancestral partitioning process, which is obtained by letting population size tend to infinity (without rescaling parameters or time) in an ancestral recombination graph, we obtain the solution to the recombination equation in a transparent form.