UM Math Graduate Students Seminar

Daniel Ryan
University of Miami

will present

Alignment of DNA Sequences

Friday, March 25, 2011, 2:30pm
Ungar Building Room 506


Abstract: Alignment of two strings refers to performing the operations of inserting, deleting and substituting the characters of one string to turn it into the other. Measuring the number and types of operations needed to align two strings can give an idea of the similarity between the strings.
Alignment of DNA sequences (strings composed of A’s, C’s, G’s and T’s) is an extraordinarily common task in modern biology. In this talk, I will describe the dynamic programming algorithms used to solve this alignment problem as well as the faster BLAST heuristic that has been developed to search large DNA sequence databases. The BLAST algorithm first appeared in the 1990’s and just two papers about this algorithm combine for a whopping 68,000 citations!


Back to the seminar's page