Monday, February 23, 20153:15 PM - 4:15 PMChallenge Conference Room (TA-3, Bldg 200, Room 256)|
From molecules to permutations
Christian ReidysVirginia Bioinformatics Institute, Dept. of Mathematics at Virginia Tech University
NEW TIME: In this talk, we discuss molecular representations as fatgraphs and their
implications for efficient folding of RNA structures. We analyze recursive decompositions of the space of structures filtered by topological genus. Thereafter we relate such decompositions to the problem of sorting permutations by either reversals or tanspositions. For the former we outline a fatgraph model in which Pevzner's distance formula for sorting by reversals obtains a new interpretation.
Host: Stephan Eidenbenz