- Series
- SIAM Student Seminar
- Time
- Friday, October 16, 2009 - 1:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 255
- Speaker
- Tianjun Ye – Georgia Tech
- Organizer
- Linwei Xin

This talk considers the following sequence shufling problem: Given a biological sequence (either DNA or protein) s, generate a random instance among all the permutations of s that exhibit the same frequencies of k-lets (e.g. dinucleotides, doublets of amino acids, triplets, etc.). Since certain biases in the usage of k-lets are fundamental to biological sequences, effective generation of such sequences is essential for the evaluation of the results of many sequence analysis tools. This talk introduces two sequence shuffling algorithms: A simple swapping-based algorithm is shown to generate a near-random instance and appears to work well, although its efficiency is unproven; a generation algorithm based on Euler tours is proven to produce a precisely uniforminstance, and hence solve the sequence shuffling problem, in time not much more than linear in the sequence length.