If you are interested in the seminar (for example, because you need a seminar to complement the Phylogenetics course) but missed our first session, please send me an e-mail detailing which topic you would like to cover with your presentation and summary.

The students will read influential research papers on Comparative Genomics from earlier periods. Each student will select one such paper and give a preferably concise oral presentation (~ 25 min). They will subsequently write a summary of their chosen paper. Whether the summary passes or not is decided primarily on its clarity and completeness, not its length.

Both the presentation and the summary are requested to be in English as it is the dominant language of the research in this area.

In the initial sessions after the assignment of topics, we will discuss the papers as a group and resolve any questions or difficulties together. Optionally (depending on the experience of the students), we will also cover an aspect of scientific reading and writing in each of these sessions.

The class will be held in person in U10-146 as long as the current situation is favorable enough. On student request or resulting from a change in the situation, the class may be transferred to a hybrid or Zoom class.

• The written summary is to be handed in at most two weeks after the presentation.
• If you are unsure whether your presentation fits the format, you should make an appointment with me approximately one week before the presentation.

• Sankoff 1992: Edit distance for genome comparison based on non-local operations
• Hannenhalli & Pevzner 1999: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
• (Hannenhalli & Pevzner 1995: Transforming men into mice (polynomial algorithm for genomic distance problem) )
• Caprara 1999: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Bergeron 2001 : A Very Elementary Presentation of the Hannenhalli-Pevzner Theory and Bergeron & Strasbourg 2001: Experiments in Computing Sequences of Reversals
• Bader, Moret & Yan 2001 : A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

• (Yancopoulos, Attie & Friedberg 2005 : Efficient sorting of genomic permutations by translocation, inversion and block interchange )
• Braga, Willing & Stoye 2011 : Double Cut and Join with Insertions and Deletions
• Compeau 2013 : DCJ-Indel sorting revisited

You might be inspired by

• the Algorithms in Genome Research Literature
• the Algorithms in Comparative Genomics Literature
• reading the references of the papers listed here
• …