Assume we encode A, T, C, and G as two bit codes A:00, T:01, C:10, and G:11, respectively. Given the sequence AATCGATAAGCAAAACCGGA, build a hash table with all possible 3-mers from this sequence.
Problem 2. Given the patterns listed below:
P1=ATCGAT, P2=CGATAT, P3=AAGCAA, P4=CCGCAT, and P5=ATCCAT.
1) Build a keyword tree based on these patterns;
2) Thread the sequence AATCGATAAGCAAAACCGGATTACGATATATAT through the tree. If any pattern is found in any position, identify that position and indicate what pattern is found.