Estimation of Rearrangement Break Rates Across the Genome
Keyword(s):
A Genome
◽
Genomic rearrangements provide an important source of variation, but reconstructing the history of rearrangements often has many solutions. We answer the question of where rearrangements occur by solving the simpler problem of estimating the rate of double-strand breaks at every site in a genome. This problem is a special case of the minimum cover problem for an interval graph. We implement this method as a Python program, BRAG, and use it to estimate break rates in the genome of Neurospora crassa. We find that more frequent rearrangement in the subtelomeres facilitates the evolution of novel genes.