Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
BLAST
1.
2.
3. Local alignment Finds domains and short regions of similarity between a pair of sequences. The two sequences under comparison do not necessarily need to have high levels of similarity over their entire length in order to receive locally high similarity scores. This feature of local similarity searches give them the advantage of being useful when looking for domains within proteins or looking for regions of genomic DNA that contain introns. Local similarity searches do not have the constraint that similarity between two sequences needs to be observed over the entire length of each gene.
4. Global alignment Finds the optimal alignment over the entire length of the two sequences under comparison. Algorithms of this nature are not particularly suited to the identification of genes that have evolved by recombination or insertion of unrelated regions of DNA. In instances such as this, a global similarity score will be greatly reduced. In cases where genes are being aligned whose sequences are of comparable length and also whose entire gene is homologous (descendant from a common ancestor), global alignment might be considered appropriate.
5.
6. Needleman-Wunsch Exact global alignment method. Not particularly good in many cases (database searches, looking for small regions of similarity, alignment of sequences with vastly differing lengths), but the most rigorous and thorough method if the task is to align sequences that have not evolved by exon shuffling, domain insertion/deletion etc. In other words, it is the best method if you have sequences that are of ‘similar’ length and have evolved from a common ancestor by point processes (point mutation, small indels).
7. Smith-Waterman Exact local alignment There is no requirement for the alignment to extend along the entirety of the sequences. This is a very good algorithm for database searching, multiple alignment and pairwise alignment. It is exhaustive and can be very slow (compared to the heuristics described later). The difference between this and the N-W algorithm is that alignments starting at all possible positions must be considered, not just the ones that start at the beginning and end at the end.