Notice: Information and plans for upcoming academic terms. Learn more.

Subscribe by RSS Subscribe by RSS

Seminar: An exact pattern matching algorithm for a finite set of DNA patterns

Mon., Mar. 6, 2017 2:30 p.m.

Location: CL 408

Speaker: Shawn Andrews

Date: Monday, March 6, 2017

Time: 2:30-3:15 PM

Location: CL 408

Title: An exact pattern matching algorithm for a finite set of DNA patterns

Abstract: In this seminar, we will begin by reviewing algorithms for exact pattern matching as well as a brief introduction to DNA base pairing. The difference between exact and approximate matching is whether there is zero or more mismatched characters in the matched pattern, respectively. Additionally, we must examine the unique strategies employed by modern pattern matching algorithms before developing our own algorithm. I will introduce a new algorithm for efficiently matching a finite set of DNA patterns that leverages the techniques used by modern algorithms in conjunction with my own approach. Finally, I will analyze the algorithm with respect to time complexity and its real-world applications.