WISA'06 Proceedings of the 7th international conference on Information security applications: PartI
| Hi-index | 0.01 |
Many problems in bioinformatics relate to the comparison of two DNA or protein sequences. Given two sequences, we often wish to find the best way to align them together; this gives us insight on what role these sequences play in the viability of an organism and what mutations may have led to the formation of these particular strands. A few algorithms have approached the problem of pair-wise sequence alignment, and the implementation of these algorithms is fairly standard. This project examines Gotoh's version of the Needleman-Wunsch algorithm [1].