A toy implementaion of the Needleman-Wunsch algorithm in Haskell using dynamics programming with lazy arrays, motivated by this page.
- calculates only one alignment with top scope
- cannot distinguish between gap opening penalty and gap extension penalty