Given the following Burrows-Wheeler Transformed (BWT) string…
Given the following Burrows-Wheeler Transformed (BWT) string, suffix array, and first occurrences, determine all the positions where the sequence ‘AG’ matches the original string. You must create the counts array to help do this, but you MAY NOT invert the transformed string to its original, create the first column, or create any other data structures to find the locations AG matches in the string. Show all of your work. Equations you might need top = FirstOccurence(symbol) + Countsymbol(top, LastColumn) bottom = FirstOccurence(symbol) + Countsymbol(bottom + 1, LastColumn) – 1 BWT = TTG$AAAGTG First Occurence0147 Suffix Array9460571832