NOT KNOWN FACTUAL STATEMENTS ABOUT DONOR MATCHING

When BLAST is faster than any Smith-Waterman implementation for the majority of conditions, it can not "ensure the optimal alignments from the query and databases sequences" as Smith-Waterman algorithm does. The Smith-Waterman algorithm was an extension of the previous optimum strategy, the Needleman–Wunsch algorithm, which was the first sequence