WOLFRAM|DEMONSTRATIONS PROJECT

String Matching Automaton

​
length of selected input
64
length of pattern
2
3
4
random seed
input string
GACCATGAGGAGCGGTTGTATTCCATGCCACAGATTGTACAGGGCAGACTGCCATATAGCTTTT
CC
pattern to match
3
4
23
24
28
29
52
53
Matching of strings can be done by automata. The random string at the top is processed by the automaton shown in the graph. It implements recognition of the pattern to match. The automaton processes each input character once. Beginning and ending positions of matches are indicated at the bottom.