I am trying to infer a median string search for a sequence in the ACGT genome. The problem I have is to say AAAAAAAA AAAAAAAC and so on until I have tried all possible combinations.
In essence, I am in brute force by creating two lists, one of which contains A, C, G, T, and the other an 8-character sequence and after each repeated search and replacement of characters. The problem is that I do not test all combinations, because when two iterations simultaneously jump the letter.
Is there any way to go AAAAAAAA - AAAAAAAC - AAAAAAAG - AAAAAAAT - AAAAAACA etc. easy?
source
share