Sequence alignment algorithms are widely used to infer similarirty
and the point of differences between pair of sequences. FOGSAA is a
 fast Global alignment algorithm. It is basically a branch and 
bound approach which starts branch expansion in a greedy way 
taking the symbols from the given pair of sequences (protein or
 nucleotide) and results in an optimal alignment faster than 
conventional dymanic programming techniques. It is also better 
than the heuristic methods with respect to alignment quality.

	     Obtaining high quality sequence alignment as well as
 minimizing the running time, is a real challenge in 
bioinformatics. FOGSAA is an invention in this direction.