Related Experiment Video
Updated: Dec 20, 2025

Design and Synthesis of a Reconfigurable DNA Accordion Rack
Published on: August 15, 2018
The complexity of genome rearrangement combinatorics under the infinite sites model
Chris D Greenman1, Luca Penso-Dolfin1, Taoyang Wu1
1School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK.
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 super-exponential in size. These counts assume the infinite sites model of unique breakpoint usage.
Related Concept Videos
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Overview of Transposition and Recombination
Viral Recombination
Exon Recombination
Exon shuffling follows “splice frame rules.” Each exon...
Genome Size and the Evolution of New Genes
Genome Size and the Evolution of New Genes

