Rhombic tiling, permutation plot, subset gamegraph, permutahedron, hyperplane arrangement, structure diagram, three-dimensional heap, Cayley diagram, braid graph, and L-tromino tiling.

Welcome

Welcome to the course web page for the Spring 2022 manifestation of MAT 690: Combinatorics of Genome Rearrangements at Northern Arizona University.

Course Info

Title: MAT 690: Combinatorics of Genome Rearrangements
Semester: Spring 2022
Credits: 3
Section: 1
Time: 12:40-1:30PM MWF
Location: AMB 207

Instructor Info

  Dana C. Ernst, PhD
  AMB 176
  10-11:15AM MWF, 11:30-1PM Th
  dana.ernst@nau.edu
  928.523.6852
  danaernst.com

Don’t fear failure. Not failure, but low aim, is the crime. In great attempts it is glorious even to fail.

What is This Course All About?

When comparing two genomes, the content of the DNA molecules is often similar, but the way in which it is arranged may differ substantially. The mutations that led to these differences are called genome rearrangements, and the structural differences between two genomes motivates the study of their combinatorics. In this course, we will study several combinatorial optimization problems that arise out of the evolutionary events that lead to genome rearrangements. In addition, we will study related permutation sorting problems that are independent of biology.

The mathematician does not study pure mathematics because it is useful; he studies it because he delights in it, and he delights in it because it is beautiful.