CSpace  > 应用数学研究所
A new method for modeling coalescent processes with recombination
Wang,Ying1; Zhou,Ying2; Li,Linfeng3; Chen,Xian1; Liu,Yuting4; Ma,Zhi-Ming1; Xu,Shuhua2
2014-08-11
Source PublicationBMC Bioinformatics
ISSN1471-2105
Volume15Issue:1
AbstractAbstractBackgroundRecombination plays an important role in the maintenance of genetic diversity in many types of organisms, especially diploid eukaryotes. Recombination can be studied and used to map diseases. However, recombination adds a great deal of complexity to the genetic information. This renders estimation of evolutionary parameters more difficult. After the coalescent process was formulated, models capable of describing recombination using graphs, such as ancestral recombination graphs (ARG) were also developed. There are two typical models based on which to simulate ARG: back-in-time model such as ms and spatial model including Wiuf&Hein’s, SMC, SMC’, and MaCS.ResultsIn this study, a new method of modeling coalescence with recombination, Spatial Coalescent simulator (SC), was developed, which considerably improved the algorithm described by Wiuf and Hein. The present algorithm constructs ARG spatially along the sequence, but it does not produce any redundant branches which are inevitable in Wiuf and Hein’s algorithm. Interestingly, the distribution of ARG generated by the present new algorithm is identical to that generated by a typical back-in-time model adopted by ms, an algorithm commonly used to model coalescence. It is here demonstrated that the existing approximate methods such as the sequentially Markov coalescent (SMC), a related method called SMC′, and Markovian coalescent simulator (MaCS) can be viewed as special cases of the present method. Using simulation analysis, the time to the most common ancestor (TMRCA) in the local trees of ARGs generated by the present algorithm was found to be closer to that produced by ms than time produced by MaCS. Sample-consistent ARGs can be generated using the present method. This may significantly reduce the computational burden.ConclusionIn summary, the present method and algorithm may facilitate the estimation and description of recombination in population genomics and evolutionary biology.
KeywordRecombination Coalescence Ancestral recombination graph (ARG) Sequentially markov coalescent (SMC)
DOI10.1186/1471-2105-15-273
Language英语
WOS IDBMC:10.1186/1471-2105-15-273
PublisherBioMed Central
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/203
Collection应用数学研究所
Corresponding AuthorMa,Zhi-Ming; Xu,Shuhua
Affiliation1.Chinese Academy of Sciences; Institute of Applied Mathematics, Academy of Mathematics and Systems Science
2.Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences; Max Planck Independent Research Group on Population Genomics, Chinese Academy of Sciences and Max Planck Society (CAS-MPG) Partner Institute for Computational Biology
3.Beijing Jiaotong University; School of Computer and Information Technology
4.Beijing Jiaotong University; Department of Mathematics, School of Science
Recommended Citation
GB/T 7714
Wang,Ying,Zhou,Ying,Li,Linfeng,et al. A new method for modeling coalescent processes with recombination[J]. BMC Bioinformatics,2014,15(1).
APA Wang,Ying.,Zhou,Ying.,Li,Linfeng.,Chen,Xian.,Liu,Yuting.,...&Xu,Shuhua.(2014).A new method for modeling coalescent processes with recombination.BMC Bioinformatics,15(1).
MLA Wang,Ying,et al."A new method for modeling coalescent processes with recombination".BMC Bioinformatics 15.1(2014).
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang,Ying]'s Articles
[Zhou,Ying]'s Articles
[Li,Linfeng]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang,Ying]'s Articles
[Zhou,Ying]'s Articles
[Li,Linfeng]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang,Ying]'s Articles
[Zhou,Ying]'s Articles
[Li,Linfeng]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.