I have the following quiz question, but the Pattern1 for both
(CGA|ACT) are unique (just grep for
CGA), which means it might be difficult to find the starting pattern for the DNA genome string in the following case. Do I need something like GapReduce algorithm ?
Quiz : There is a single (linear) string with the following (3,1)-mer composition. Find it.
(ACC|ATA) (ACT|ATT) (ATA|TGA) (ATT|TGA) (CAC|GAT) (CCG|TAC) (CGA|ACT) (CTG|AGC) (CTG|TTC) (GAA|CTT) (GAT|CTG) (GAT|CTG) (TAC|GAT) (TCT|AAG) (TGA|GCT) (TGA|TCT) (TTC|GAA)