The Needleman-Wunsch algorithm employs dynamic programming in order to align nucleotide sequences.
This process involves two steps - firstly, calculating the global max similarity matrix, and secondly, tracing back from the bottom right corner of the matrix to find the best global alignment.
This implementation provides the best global downmost alignment.
>cd <local repo>
>javac Main.java
>java Main
The back trace from the sample program occurs as follows:
