𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Onion design and its application to a pharmaceutical QSAR problem

✍ Scribed by Lennart Eriksson; Thomas Arnhold; Bernd Beck; Thomas Fox; Erik Johansson; Jan M. Kriegl

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
842 KB
Volume
18
Category
Article
ISSN
0886-9383

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A packing problem its application to Bos
A packing problem its application to Bose's families
✍ Marco Buratti πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 906 KB

We propose and study the following problem: given X c z,, construct a maximum packing of devx (the development of X ) , i.e., a maximum set of pairwise disjoint translates of X. Such a packing is optimul when its size reaches the upper bound 1 & 1. In particular, it is perfect when its size is exact

An approximate Aβˆ— algorithm and its appl
An approximate Aβˆ— algorithm and its application to the SCS problem
✍ Gaia Nicosia; Gianpaolo Oriolo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 123 KB

In this paper we deal with algorithm A \* and its application to the problem of ΓΏnding the shortest common supersequence of a set of sequences. A \* is a powerful search algorithm which may be used to carry out concurrently the construction of a network and the solution of a shortest path problem on