The Complexity of Genome Rearrangement Combinatorics under the Infinite Sites Model

Greenman, Christopher, Wu, Taoyang and Penso Dolfin, Luca (2020) The Complexity of Genome Rearrangement Combinatorics under the Infinite Sites Model. Journal of Theoretical Biology, 501. ISSN 0022-5193

[img] PDF (Manuscript3) - Submitted Version
Restricted to Repository staff only until 22 May 2021.

Download (1MB) | Request a copy

Abstract

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 superexponential in size. These counts assume the infinite sites model of unique breakpoint usage.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: LivePure Connector
Date Deposited: 22 May 2020 00:23
Last Modified: 11 Jul 2020 00:11
URI: https://ueaeprints.uea.ac.uk/id/eprint/75284
DOI: 10.1016/j.jtbi.2020.110335

Actions (login required)

View Item View Item