Molecular path for ligand search
β Scribed by Tao Lu; Yuan Yuan Qiao; Pan Wen Shen
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2011
- Tongue
- English
- Weight
- 175 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1001-8417
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Three algorithms for the search of oriented paths in digraphs are described, based in the generation of a tree, in which an BFS is done, in the first one, and a DFS is done, in the other two algorithms. The first one is aimed at finding all the optimum paths between two vertices. The second one is a
## Abstract Review: about 100 refs.
A new approach to drug discovery is based on the generation of high diversity libraries of DNA, RNA, peptides or small molecules. Search of such libraries for useful molecules is an optimization problem on high-dimensional molecular fitness landscapes. We utilize a spin-glass-like model, the NK mode