 |
A number of algorithmic and heuristic
approaches have been taken to detect weak sequence similarities within
practicable computation times, including the Smith-Waterman algorithm, FASTA ,
BLAST and ParAlign. These bioinformatic tools, however, have been developed
with, and optimized for, long protein sequences. They are ill-suited for use in
the analysis of combinatorial phage display data which consist of short peptide
lengths. Weak sequence motifs within short peptide sequence
populations, however, can be readily identified with these three programs that
search for motifs within the peptide population.
|