Mark Kendell

Oct 26, 2024 | scholarsarchive.byu.edu | Mark Clement |Sean Warnick |Brigham Young |Mark Kendell

Keywordsoptimization analysis, Needleman-Wunsch algorithm, sequence alignmentCollegePhysical and Mathematical SciencesDepartmentComputer ScienceAbstractThe 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.