| Speaker | Stadler, Peter |
| Title | Aligning Circularly Ordered Lists - Who Would Want To Do That? |
The sequence alignment problem can be generalized (in a rather trivial way) to aligning lists of arbitrary objects. This allows a notion of a consensus of lists. I'll briefly discuss an application to phylogenetic footprinting. An interesting extension is the alignment of lists of circularly instead of linearly ordered objects, such as the genes on a (mitochondrial) genome. I'll briefly describe a simple extension of the Gotoh algorithm to the circular problem, and (if I can find time to fix a nasty memory leak instead of sitting in meetings) I'll present a few first results for mitochondrial genome arrangements.