|
Organizers |
Whole genome duplication and embedded graphs
by
Nikita Alexeev
GWU
Coauthors: Pavel Avdeyev and Max A. Alekseyev
Genome median and genome halving are combinatorial optimization problems that aim at reconstructing ancestral genomes by minimizing the number of evolutionary events between them and the genomes of extant species. In the talk we will give a formulation of these comparative genomics problems in terms of embedded graphs. Namely, we introduce the following problem: for a given embedded graph G, find the shortest sequence of surgeries (operations, which cut the surface along two edges of G and glue the resulting four sides in a new order) that results in an graph G' such that it has the maximal possible number of connected components and each of its connected components is embedded into a sphere.
Date received: December 9, 2016
Copyright © 2016 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 # cbnq-42.