Though BLAST is faster than any Smith-Waterman implementation for the majority of cases, it are not able to "guarantee the optimum alignments in the question and databases sequences" as Smith-Waterman algorithm does. The Smith-Waterman algorithm was an extension of the previous optimal method, the Needleman–Wunsch algorithm, which was the initial