The second iteration of this program improved its efficiency by lowering the threshold to abandon its possible results. Particularly novel or divergent inputs to this program can be analyzed with its PSI (“P-S-I”) or Pfam (10[1])(“P-fam”) forms. This program aims to obtain results that maximize bit values while minimizing (10[1])E-values. (10[1]-5[1])Clustal is generally preferred (10[1])to this program when using multiple (-5[1])queries simultaneously. (10[1])Mismatches in this program are accounted for by calculating (10[1])similarity using a BLOSUM matrix. (10[2])This program is suffixed “n” or “p” (10[1])depending on whether its (10[1])plaintext or FASTA (“fasta”) input (10[1])contains either (10[1])4 (10[1])or 20 (10[1])different possible characters. This program hosted by NCBI (10[1])can create phylogenetic (10[3])trees based on (10[1])sequence homology (10[1])after (10[1])completion. For 10 points, name this search tool that performs sequence alignments on publicly available (10[1])genetic data. ■END■ (10[2])