Rose J A, Hagiya M, Deaton R J, Suyama A
Department of Computer Science, The Universityof Tokyo, Japan.
J Biol Phys. 2002 Sep;28(3):493-8. doi: 10.1023/A:1020353731036.
In PNA-mediated Whiplash PCR (PWPCR), autonomous molecular computation is implemented by the recursive polymerase extension of a mixture of DNA hairpins. Like other methods based on exhaustive search, however, application to problem instances of realistic size is prevented by the exponential scaling of thesolution space. The tendency of evolving populations to minimize the sampling of large, low fitness basins suggests that a DNA-based evolutionary approach might be an effective alternative to exhaustive search. In this work, PWPCR is modified to support the evolution of a population of finite state machines. A practical, in vitroalgorithm for applying this architecture to evolve approximate solutions to instances of the NP-complete problem, Hamiltonian Pathis described in detail.
在肽核酸介导的鞭打式聚合酶链反应(PWPCR)中,自主分子计算通过DNA发夹混合物的递归聚合酶延伸来实现。然而,与其他基于穷举搜索的方法一样,现实规模问题实例的应用因解空间的指数级增长而受到阻碍。进化种群倾向于尽量减少对大型、低适应度盆地的采样,这表明基于DNA的进化方法可能是穷举搜索的有效替代方案。在这项工作中,对PWPCR进行了修改,以支持有限状态机种群的进化。详细描述了一种将这种架构应用于进化NP完全问题实例(哈密顿路径)近似解的实用体外算法。