Algorithms for Genome Rearrangement by Double Cut and Join
published: Oct. 2, 2012, recorded: September 2012, views: 4452
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Genome evolution on the basis of gene order has been modeled by a variety of rearrangement operations such as inversions, translocations, transpositions, block interchanges, fusions and fissions. The double cut and join (DCJ) operation, introduced by Yancopoulos et al. (2005), allows to model all these classical operations while allowing for very simple algorithms, compared to earlier ones for more restricted models. In this talk, we present several of our algorithmic results related to genome rearrangement based on the DCJ model and also address some interesting mathematical modeling questions.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !