Dynamic-Programming

• Smith-Waterman

  Local sequence alignment algorithm with configurable match/mismatch/gap penalties. Standard in bioinformatics for finding conserved regions.

• Needleman-Wunsch

  Global sequence alignment algorithm computing optimal alignment across entire sequences. Foundation for sequence comparison in bioinformatics.

• Longest Common Substring

  Longest contiguous character sequence common to two strings. Useful for plagiarism detection and similarity measurement.

• Longest Common Subsequence

  Longest sequence of characters common to two strings in order (not necessarily contiguous). Foundation for sequence alignment and diff algorithms.