On pp. 47-48 of THE BLIND WATCHMAKER, Richard Dawkins gives two runs of his WEASEL program (note that there were typos in both initial seeds — one had 27 characters, the other 29 whereas they should have 28; I’ve corrected that). Here are the two runs using the Courier typeface, which assigns equal width to each character (spaces are represented by asterisks): WDL*MNLT*DTJBKWIRZREZLMQCO*P WDLTMNLT*DTJBSWIRZREZLMQCO*P MDLDMNLS*ITJISWHRZREZ*MECS*P MELDINLS*IT*ISWPRKE*Z*WECSEL METHINGS*IT*ISWLIKE*B*WECSEL METHINKS*IT*IS*LIKE*I*WEASEL METHINKS*IT*IS*LIKE*A*WEASEL Y*YVMQKZPFJXWVHGLAWFVCHQXYPY Y*YVMQKSPFTXWSHLIKEFV*HQYSPY YETHINKSPITXISHLIKEFA*WQYSEY METHINKS*IT*ISSLIKE*A*WEFSEY METHINKS*IT*ISBLIKE*A*WEASES METHINKS*IT*ISJLIKE*A*WEASEO METHINKS*IT*IS*LIKE*A*WEASEP METHINKS*IT*IS*LIKE*A*WEASEL These runs are incomplete. The first, according to Dawkins, required 43 iterations to converge, the second 64 (Dawkins omitted the other iterates to save space). As you can see, by using the Courier font, one can read up from the target sequence METHINKS*IT*IS*LIKE*A*WEASEL, … Continue reading Dawkins’ WEASEL: Proximity Search With or Without Locking?