Skip to content

Evolving Grammar Rules

January 2, 2014


Work continues on several fronts. I have designed an application that reads my grammars from a file and modifies them as needed. 
A sample rule set printed to a file looks like this:

rule –> “%^%^%”$%’x’^%4(%(%([‘T’$%’RHO’;’x’;’`\”A\”+x’.%)%|%(%([‘A’$%’RHO’;’x’;’`\”T\”+x’.%)%|%(%([‘G’$%’RHO’;’x’;’`\”C\”+x’.%)%|%(%([‘C’$%’RHO’;’x’;’`\”G\”+x’.%)%)%)%)%)%)[6’AGCT’#%’x’!%’stem’^”

(This simple grammar matches an rna stem-loop structure where stem size = 4, loop size =6)

Variables may be placed anywhere in the grammar and manipulated by the accompanying C++ code. Combined with ML and/or GA algorithms, this makes for an extremely powerful pattern matching machine. 

From → Uncategorized

Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: