This merge introduces high-performance vectorized and striped variations of the Smith-Waterman algorithm for sequence alignment. The update includes significant optimizations, such as replacing cell-based matrix structures with raw memory representations to reduce overhead, alongside improvements to parallel execution patterns. These additions provide researchers with multiple strategies for exploring hardware acceleration and cache-efficient sequence analysis.