当前位置: X-MOL 学术J. Theor. Biol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The complexity of genome rearrangement combinatorics under the infinite sites model.
Journal of Theoretical Biology ( IF 2 ) Pub Date : 2020-05-22 , DOI: 10.1016/j.jtbi.2020.110335
Chris D Greenman 1 , Luca Penso-Dolfin 1 , Taoyang Wu 1
Affiliation  

Rearrangements are discrete processes whereby discrete segments of DNA are deleted, replicated and inserted into novel positions. A sequence of such configurations, termed a rearrangement evolution, results in jumbled DNA arrangements, frequently observed in cancer genomes. We introduce a method that allows us to precisely count these different evolutions for a range of processes including breakage-fusion-bridge-cycles, tandem-duplications, inverted-duplications, reversals, transpositions and deletions, showing that the space of rearrangement evolution is super-exponential in size. These counts assume the infinite sites model of unique breakpoint usage.



中文翻译:

无限位点模型下基因组重排组合的复杂性。

重排是离散的过程,其中DNA的离散片段被删除,复制并插入到新的位置。这种配置的序列称为重排进化,导致混乱的DNA排列,经常在癌症基因组中观察到。我们介绍了一种方法,可以使我们精确地计算出一系列不同过程的不同进化,包括断裂-融合-桥环循环,串联重复,反向重复,逆转,转座和缺失,这表明重排进化的空间是超-大小指数。这些计数假设使用唯一断点的无限站点模型。

更新日期:2020-05-22
down
wechat
bug