Abstract: We will survey some sorting algorithms whose original motivation came from evolutionary biology. Some questions related to these algorithms are very easy to understand, but very hard to solve. They can, unsurprisingly, be translated into the language of permutations. Much more surprisingly, permutations that are the products of maximal cycles play a major role in this area, and that makes sophisticated tools from algebraic combinatorics applicable.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: