|
Organizers |
Breakpoint graph: transposition rate
by
Nikita Alexeev
Computational Biology Institute, George Washington University
Coauthors: Anna Pologova, Rustem Aidagulov, Max A. Alekseyev
Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals, translocations, fusions, and fissions. While there are some more complex genome rearrangements such as transpositions, they are rarely observed and believed to constitute only a small fraction of genome rearrangements happening in the course of evolution. We propose a computational method for estimating the rate of transpositions in evolutionary scenarios between two genomes. In this talk we describe genome rearrangements in terms of graphs, define a breakpoint graph, corresponding to a pair of genomes, and explain, how its cycle structure allows to estimate the transposition rate. If we have enough time, we will also discuss an application of topological recursion to the enumeration of breakpoint graphs with a given structure.
Date received: February 24, 2015
Copyright © 2015 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbkp-13.