I've been asked: how does BLAST improve dynamic programming accuracy?
I do know that BLAST is based on heuristic approach that approximates the Smith-Waterman algorithm and that the Smith-Waterman is too slow for large databases but more accurate.
Can someone settle my conflict?