Wesley R. Elsberry
Posts: 4991
Joined: May 2002
|
"weasel" versus "partitioned search"
I derived an equation for expectation of correct bases following mutation in "weasel" (see above for earlier reference):
| Quote |
expected correct bases after mutation in "weasel" = C + (u * (L - C) / K) - (u * C * (K - 1) / K)
|
"Partitioned search" would be the case where:
| Quote |
expected correct bases after mutation in PS = C + (u * (L - C) / K) - (0 * u * C * (K - 1) / K)
= C + (u * (L - C) / K) - 0
= C + (u * (L - C) / K)
|
"Locking" or "latching" is the same as removing the term that allows for correct bases to mutate to incorrect ones. What remains is an expectation that the number of correct bases can only monotonically increase.
--------------
"You can't teach an old dogma new tricks." - Dorothy Parker
|
