Foreword: I know it’s quite a wall of text, so for those who don’t feel like subjecting themselves to it may skip straight to the sections marked as ‘the bottom line’ to get the basic idea of what I’m saying.
So I’ve been spending the last couple months primarily focused on identifying the flaws in the current bot algorithms, and I think I’ve got something that’s worth reviewing. I’ll be starting with Vienna, whose problem, I believe, would be the easiest to identify, confirm, and correct. I’ll finish with Infobot, whose problem I’ve identified, but don’t understand, and thus, cannot provide any recommendations for a fix.
Vienna: This one wasn’t so clear right away, particularly since Vienna’s semi-random algorithm caused some events that clouded the data by solving some surprisingly intense puzzles on occasion. Vienna seems to have the must trouble with puzzles that have either or both of two properties. The first property which tends to inflict failure is a high ratio of unpaired to paired bases, counting each residue as an individual as opposed to counting the pair as the unit. The second property which tends to inflict failure seems to be a fold which has closely placed internal loops and hairpins- at the very least 2-2 or 3-3 on internals, with a rough maximum of 7 nt’s distance in between at a glance (I’ve yet to pin down the exact specs). I believe that the two properties create failure for a related cause. Vienna has no protocol for leaving unpaired bases unmutated from their blank Adenine form. By comparison, humans are generally lazy, and won’t mutate the unpaired adenines unless they think it will help solve the fold. For this reason, I think, is why Vienna seems to fail some surprisingly simple puzzles, which human players have little trouble solving.
What I think is happening is that the randomly mutated unpaired bases keep reacting with with the randomly mutated unpaired bases in adjacent internal loops, or in relatively unstable short strings, which may be broken by a stronger bond wanting to form from a base in the internal loop or by raising the energy in the loop too high. Granted, this doesn’t always happen, and Vienna doesn’t fail consistently because of its nature. The fact that Vienna uses a random algorithm means that all states are possible, including the ‘correct’ unmutated unpaired base configuration.
-----The Bottom Line-----
If Vienna were given a protocol to first attempt to solve for a fold by leaving unpaired bases unmutated from Adenine, and then moving on to only mutating possible boost points, I expect that its performance would be greatly enhanced. Thus, therefor, is my recommendation.
Infobot: Infobot was a little trickier to pin down than Vienna, albeit that Vienna’s specific error sites hit me later on while testing for infobot. It seems to me that Vienna has trouble with 1 NT bulges under very specific conditions. These conditions, which do not always create a failure, but individually seem to raise the odds that Infobot will fail, and do seem to work in conjunction, are as follows.
-The first condition is that the RNA fold have sequential internal loops. Should the bulge be placed between these loops, Infobot is likely to fail. Whether the loops need be uneven, or the stacks between them need be a certain length is yet undetermined and requires more testing. Though I will say that the shorter stacks do seem to baffle infobot more effectively. Also, the bulge is more successful at baffling Infobot when it is placed within 1 NT of the internal loop. More 1 NT bulges or 1 nt bulges without adjacency to internal loops seems to have no effect on Infobot.
-The second condition seems to be a clockwise turn to the fold. That is to say that following from 9’ to 3’, the fold will turn primarily in a clockwise direction, such that the end hairpin of the RNA fold will be more right-wise or clockwise than the origin of the strand.
Other observations are that if Infobot fails the fold, Vienna typically will as well, though it stands to reason that this is due to the sequential, closely placed groups of unpaired bases.
-----The bottom line-----
I don’t know why infobot has trouble with these conditions, and therefor, I cannot suggest any solutions. I would ask my fellow eteRNA players to help me solve this mystery.
Thank you for your time in reading this, I welcome any criticisms, and I invite you all to test what I’ve here observed and suggested, as well as to use freely in any of your future research.