Whilst BLAST is quicker than any Smith-Waterman implementation for some situations, it cannot "warranty the optimum alignments with the question and database sequences" as Smith-Waterman algorithm does. The Smith-Waterman algorithm was an extension of a earlier optimal system, the Needleman–Wunsch algorithm, which was the very first sequence alig