Heuristic programs find approximate alignments
	• They are less sensitive than “dynamic programming” algorithms such as Smith- Waterman for detecting weak similarity • In practice they run much faster and are usually adequate • The BLAST program developed by Stephen Altschul and coworkers at the NCBI is the most widely used heuristic program