edlib

Leverages Myers's bit-vector algorithm and Ukkonen's banded approach for super-fast edit distance calculations, ideal for large sequences.

Uses Hirschberg's algorithm to achieve linear space complexity, handling very large sequences with minimal memory consumption.

Supports global (NW), prefix (SHW), and infix (HW) alignment methods, providing versatility for different matching scenarios like read alignment in bioinformatics.

Allows definition of custom equality rules, such as wildcards or case-insensitive alignment, enabling specialized use cases.