Clustering local sequence alignment

It should be noted that, for both global and local alignment, the time complexity is 0(nm), highly computationally expensive, in particular for clustering problems (Xu and Wuncsh, 2005) or when processing a large volume of nucleic acids and amino acid sequences in a database. Alternatively, sequence comparison could be achieved via heuristic approaches, such as FASTA, BLAST, and their variants (Altschul et al., 1990, 1997 Lipman and Pearson, 1985 Pearson and Lipman, 1988). To achieve low... 

---