Counting Single Cut-or-Join Scenarios

Series: 
Combinatorics Seminar
Friday, November 20, 2015 - 15:00
1 hour (actually 50 minutes)
Location: 
Skiles 006
,  
Georgia Tech
,  
Organizer: 
Represent a genome with an edge-labelled, directed graph having maximum total degree two. We explore a number of questions regarding genome rearrangement, a common mode of molecular evolution. In the single cut-or-join model for genome rearrangement, a genome can mutate in one of two ways at any given time: a cut divides a degree two vertex into two degree one vertices while a join merges two degree one vertices into one degree two vertex. Fix a set of genomes, each having the same set of edge labels. The number of ways for one genome to mutate into another can be computed in polynomial time. The number of medians can also be computed in polynomial time. While single cut-or-join is, computationally, the simplest mathematical model for genome rearrangement, determining the number of most parsimonious median scenarios remains #P-complete. We will discuss these and other complexity results that arose from an abstraction of this problem. [This is joint work with Istvan Miklos.]