A simple and efficient C++ implementation of three classic sequence alignment algorithms: Longest Common Subsequence (LCS), Global Alignment (Needleman-Wunsch), and Local Alignment (Smith-Waterman). The alignments are visualized with colored base-level matches and mismatches for clarity.