Multiple Sequence Alignment Containing a Sequence of Regular Expressions

Abstract

A classical algorithm for the pairwise sequence alignment is the Smith Waterman algorithm which uses dynamic programming. The algorithm computes the maximum score of alignments that use insertions, deletions, and substitutions, with no consideration given in composition of the alignments. However, biologists favor applying their knowledge about common… (More)

7 Figures and Tables

Topics

  • Presentations referencing similar topics