Optimal Pair-wise Sequence Alignment
It implements Smith-Waterman with affine gap penalties. It requires at least one blank line between the two sequences. Ignores input lines with non-alphabetical characters
This program is provided as is with no warranty. The author is not responsible for any damage caused either directly or indirectly by using this program. Anybody is free to do whatever he/she wants with this program as long as this header section is preserved.
Created on 2005-02-01 by Roger Zhang (rogerz@cs.dal.ca)

Last compiled under Linux with gcc-3