String Matching using Burrows‑Wheeler Alignment (BWA)
Efficient string matching inspired by BWA: Burrows–Wheeler transform + alignment concepts — algorithmic rigor with real bioinformatics flavor.
Overview
An algorithm‑focused project implementing string matching based on the Burrows–Wheeler Transform and alignment ideas popularized in bioinformatics tooling.
Problem
Exact and approximate matching over large strings demands smart indexing. Naïve search is too slow when data scales (think genomes).
Approach
Implemented the Burrows–Wheeler Transform and supporting index structures. Built a matching workflow that leverages the transform for efficient lookup. Documented the algorithmic reasoning and complexity trade‑offs to make the project reviewer‑friendly.
Impact
A crisp demonstration of fundamentals: data structures + algorithms + performance thinking — and a great conversation starter for systems/algorithms interviews.