Joined: May 2008
|Quote (WebHopper @ Feb. 10 2017,17:32)|
I am wondering if there is an analytical solution to the Weasel algorithm. I think of a probability distribution of the number of trials necessary to achieve a target sequence, the mean and variance implying the following parameters:
length of the alphabet
length of the target sequence
Have you seen a site where this is done? On evoinfo.org Dembski proposes a solution for what he calls "partitioned search". But I am looking for a solution of what he names "proximity reward search", which apparently is the Weasel algorithm. To be clear, I am not interested in a numerical but analytical solution of the mean and variance as a functions of the above-mentioned parameters.
Try "The probability of formation of a nucleotide sequence by random mutations" by Ulrich Utiger...