The title of this project (as of Dec 5, 2012) is a bit misleading. I originally intended for this to be merely a simple yet 'uncompromisingly fast' implementation of the Needleman-Wunsch algorithm (built in C) to retrieve the optimal global alignment between two sequences of nucleotides(the building blocks for DNA). Very simple. But, from the bottom up, the current algorithm is designed to a be bit more complex, maybe even unecessarily so, I don't know, we'll see.
Plus there's too much alliteration there in the title to let go of...so 'naive-needleman-wunsch' it is!