Optimization Analysis of the Needleman-Wunsch Algorithm

Authors

Mark Kendell Clement, Brigham Young University
Dr. Sean Warnick, Brigham Young University

Keywords

optimization analysis, Needleman-Wunsch algorithm, sequence alignment

College

Physical and Mathematical Sciences

Department

Computer Science

Abstract

The Needleman-Wunsch algorithm is a classic example of dynamic programming – a technique that solves large problems by breaking them down into small problems. The simplest problems are solved first and are then used to solve the larger problems. Over this past year, I studied the impact of computer science optimization techniques on the Needleman-Wunsch algorithm as applied to DNA sequence alignment.

Recommended Citation

Clement, Mark Kendell and Warnick, Dr. Sean (2013) "Optimization Analysis of the Needleman-Wunsch Algorithm," Journal of Undergraduate Research: Vol. 2013: Iss. 1, Article 2653.
Available at: https://scholarsarchive.byu.edu/jur/vol2013/iss1/2653