Crossover question from Coding Theory

I have a model that, given a bit code, produces a string result. An example is given 01010101, it might produce {1,11}, and given 01010000, it may produce {2, 11}.

I have a lot of these input / output pairs and I'd like to find, for each output number (the 1, 2, and 11 above), the most likely bits responsible for that number appearing. In the sparse example above, i would expect the algorithm to give as a possible result that 0101____ determines 11.

Note that these pairs aren't necessarily as easy as the example above. For example, there might be multiple bit ranges corresponding to a single number (among different codes).

I don't have experience with genetic algorithms, but this strikes me as being very similar to figuring out what genes are responsible for expressed phenotypes. Is this correct? What is an algorithm that would work for this setting?

• I believe this question is more appropriate for StackOverflow or CrossValidated. You can also ask Mathematica community for help (they are quite helpful) if you want to solve this in Mathematica. Moreover, Genetic algorithms can be used for this but another way to do it would be to use something like SVMs to "learn" the pattern resulting in a phenotype. – Siddharth Apr 24 at 12:56
• I'm voting to close this question as off-topic because it's not about bioinformatics. I agree that different SE might be more appropriate. – Kamil S Jaron Apr 24 at 13:22
• Ah I'm sorry. By genetic algorithms I was referring to algorithms for genetics, not Genetic Algorithms. – user592419 Apr 24 at 15:20
• Thanks for the feedback. I'll post elsewhere. – user592419 Apr 24 at 15:21
• I'm voting to close this question as off-topic because it belongs on StackOverflow or CrossValidated – Scott Gigante Jun 3 at 19:13