Skip to main content
. 2013 Apr 11;8(4):e61033. doi: 10.1371/journal.pone.0061033

Figure 3. An example AC automaton.

Figure 3

The frequent pattern string set F is {AA, AC, AG, C, G, T}. The grey nodes represent the leaf states. The bold “T” edge is connected as among all the prefixes of the 6 patterns, “T” is the longest suffix of “AT”. Given a short read W = “CAT”, the state transition sequence when querying W from the automaton is <R, LC, R, 1, LT>, which indicates the occurrence of frequent patterns ‘C’ and ‘T’.