I'm working on a genetic algorithm and would like to map each function to a set of "codons". So + -> 011. Given this, I would like to figure out how easy it would be for any given codon set to mutate into another codon set.
If you were to take two combinations, say 012 and 111, they would have a distance of 2 since because it would take 2 mutations to move from one to the other. Eg. 012 - > 011 - > 111.
So, here's my question : given an (n, k) combination set, what is the average distance between any two combinations?
I think you might be able to model this as a small world network, but if there is a better approach I'm all ears.