The complexity of genome rearrangement combinatorics under the infinite sites model

Greenman, Christopher, Wu, Taoyang ORCID: https://orcid.org/0000-0002-2663-2001 and Penso Dolfin, Luca (2020) The complexity of genome rearrangement combinatorics under the infinite sites model. Journal of Theoretical Biology, 501. ISSN 0022-5193

Preview

PDF (Manuscript3) - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview

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
Uncontrolled Keywords:	sdg 3 - good health and well-being ,/dk/atira/pure/sustainabledevelopmentgoals/good_health_and_well_being
Faculty \ School:	Faculty of Science > School of Computing Sciences Faculty of Science > School of Natural Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computational Biology
Depositing User:	LivePure Connector
Date Deposited:	22 May 2020 00:23
Last Modified:	21 Apr 2023 00:35
URI:	https://ueaeprints.uea.ac.uk/id/eprint/75284
DOI:	10.1016/j.jtbi.2020.110335

Downloads

Actions (login required)

View Item