Although BLAST is quicker than any Smith-Waterman implementation for the majority of situations, it are not able to "warranty the exceptional alignments in the question and databases sequences" as Smith-Waterman algorithm does. The Smith-Waterman algorithm was an extension of a past optimal approach, the Needleman–Wunsch algorithm, which was the