Article
A sharp minimum on the mean number of steps taken in adaptive walks.
Journal of theoretical biology - 7 Nov 2005
Rosenberg Noah A
Abstract excerpt
It was recently conjectured by H.A. Orr that from a random initial point on a random fitness landscape of alphabetic sequences with one-mutation adjacency, chosen from a larger class of landscapes, no adaptive algorithm can arrive at a local optimum in fewer than on average e-1 steps. Here, using...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.
