Searching with iterated maps
Searching with iterated maps
复制标题
DOI：
10.1073/pnas.0606359104
复制
发表时间：
2007-01-09
影响因子：
11.1
通讯作者：
Thibault, P.
中科院分区：
文献类型：
--
作者：
Elser, V.;Rankenburg, I.;Thibault, P.
在许多需要广泛搜索的问题中，解决方案可以描述为满足两个相互竞争的约束，其中独立满足每个约束并不构成挑战。作为基于树的随机搜索的替代方案，对于这些问题，我们提出了使用从投影到两个约束集的迭代映射。这类算法一直是各种信号处理应用程序的选择方法；我们在这里展示了这些算法的范围令人惊讶地广泛，应用范围从蛋白质折叠到Sucloku。
In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sucloku.