added another way (although incorrect) of backtracking for affine gap alignment.
final fix to affine gap alignment solver.
cleaned up affine gap alignment code, added comment.
added trie construction using a tree structure. added depth-first traversal algorithm for testing/printing.
added exact string matching via trie.
adjusted class names for later code clarity.
added longest repeated subsequence function. however, memory requirement is a hindrance.
added naive way of creating suffix tree (from suffix trie). works but takes just as much memory as a trie.
added naive suffix tree construction function. takes much less than space than when converting from suffix trie.
added suffix array generation. naive suffix sorting. failed on large dataset due to runtime/space requirements.
minor changes.
added main runner file for read mapping exercises.
utilized suffix tree to compute the longest repeat sequence. simply copied the function from suffix trie class.