|No such thing as a small change|
Calculating the number of possible matches with N mismatches for DNA? [Solved!]by BrowserUk (Patriarch)
|on May 27, 2015 at 04:24 UTC||Need Help??|
BrowserUk has asked for the wisdom of the Perl Monks concerning the following question:
Update: Realisation dawned
The solution is:
All my searches turned up algorithms for generating these sequences, but I haven't found, or been able to derive a formula for calculating them.
Given a string of (a|c|g|t)x8; and allowing for up to 2 mismatched characters, how many possible matches are there.
There are 4^8 = 65536 possible 8-base sequences.
By experiment I know that allowing for
I know I am probably missing the obvious, but I'm not seeing the formula?
If it helps, for L=9, total sequences is 4^9 = 262144; and the number of matches for various values of M is:
Do you know, or are you able to derive the formula in terms of T = f( L, M )?
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this
In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked