The complexity of genome rearrangement combinatorics under the infinite sites model

JOURNAL OF THEORETICAL BIOLOGY

卷:501

Article

Greenman, Chris D.¹  Penso-Dolfin, Luca¹  Wu, Taoyang¹ 

[1] Univ East Anglia, Sch Comp Sci, Norwich NR4 7TJ, Norfolk, England

关键词: Rearrangements;    Complexity;    Combinatorics;    Cancer;   

DOI  :  10.1016/j.jtbi.2020.110335

来源: Elsevier

【 摘 要 】

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. (C) 2020 Elsevier Ltd. All rights reserved.

【 授权许可】

Free