• DOI:10.1007/978-1-62703-646-7_1
• Corpus ID: 40708173

Dynamic programming.

@article{Nalbantoglu2014DynamicP,
  title={Dynamic programming.},
  author={{\"O}zkan U. Nalbantoglu},
  journal={Methods in molecular biology},
  year={2014},
  volume={1079},
  pages={
          3-27
        }
}

• Ö. U. Nalbantoglu
• Published 2014
• Computer Science
• Methods in molecular biology

Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms. Dynamic programming is an efficient problem solving technique for a class of problems that can be solved by dividing into overlapping subproblems. Pairwise sequence alignment techniques such as Needleman-Wunsch and Smith-Waterman algorithms are applications of dynamic programming on pairwise sequence alignment problems. These algorithms offer polynomial time and space solutions. In this chapter, we introduce the basic dynamic programming solutions for global, semi-global, and local alignment problems. Algorithmic improvements offering quadratic-time and linear-space programs and approximate solutions with space-reduction and seeding heuristics are discussed. We finally introduce the application of these techniques on multiple sequence alignment briefly.