# US 6,727,100 B1 · Method of identifying candidate molecules

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,727,100 B1
- Document ID: US6727100B1
- Status: Granted
- Kind: B1
- Application number: 09/693,731
- Filed: 2000-10-20
- Granted: 2004-04-27
- Earliest claimed: 1999-10-21
- Assignees: 4Sc AG
- Inventors: Daniel Vitt; Stefan Busemann; Ulrich Dauer
- Web page: https://patentgrep.com/patent/US6727100B1

## CPC

- G16C 20/30: Prediction of properties of chemical compounds, compositions or mixtures
- G16B 35/20: Screening of libraries
- G16B 35/00: ICT specially adapted for in silico combinatorial libraries of nucleic acids, proteins or peptides
- G16C 20/60: In silico combinatorial chemistry
- G16C 20/70: Machine learning, data mining or chemometrics
- G16C: COMPUTATIONAL CHEMISTRY; CHEMOINFORMATICS; COMPUTATIONAL MATERIALS SCIENCE
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY

## Abstract

A method of identifying candidate molecules expected to be biologically active comprises the following steps: Creating a set consisting of different molecules; to each of said molecules of said set, assigning a descriptor representing a predetermined number of molecular properties; mapping said set of molecules onto points of a two-dimensional grid with regard to a predetermined similarity relation of the respective assigned descriptors such that the grid distance between grid points of two molecules is a measure for the similarity of said two molecule descriptors; forming a three-dimensional surface over said grid of molecules, said surface representing the distribution of biological activity of the molecules on the grid approximatively according to a predetermined quality criterion; selecting from said three-dimensional surface candidate molecules satisfying a predetermined criterion with respect to their biological activity.

## Claims

### Claim 1

A computer-implemented method of identifying candidate molecules expected to be biologically active, said method comprising the following steps:
a) creating a set consisting of different molecules;
b) to each of said molecules of said set, assigning a descriptor representing a predetermined number of molecular properties;
c) mapping said set of molecules onto points of a two-dimensional grid with regard to a predetermined similarity relation of the respective assigned descriptors such that the grid distance between grid points of two molecules is a measure for the similarity of said two molecule descriptors;
d) forming a three-dimensional surface over said grid of molecules, said surface representing the distribution of biological activity of the molecules on the grid approximatively according to a predetermined quality criterion;
e) selecting from said three-dimensional surface candidate molecules satisfying a predetermined criterion with respect to their biological activity.

### Claim 2 (depends on 1)

The method according to claim 1, wherein said three-dimensional surface in step d) is formed by applying the following steps:
da) taking the whole two-dimensional grid as initial region of approximation;
db) selecting molecules on predetermined grid points of said region, and calculating their respective values of biological activity;
dc) approximating the surface over said region using said previously determined values of biological activity of said molecules on said predetermined grid points;
dd) determining whether said approximated surface satisfies a predetermined quality criterion; if so, goto step e); if not so, refining the approximation of the surface by selecting molecules on further grid points, calculating their respective values of biological activity, and repeating step dc) and this step dd).

### Claim 3 (depends on 1)

The method according to claim 1, wherein said three-dimensional surface in step d) is formed by an approximation by triangles according to a method of the Delauney Triangulation type.

### Claim 4 (depends on 1)

The method according to claim 1, wherein said selected candidate molecules are suitable for chemical synthesis.

### Claim 5 (depends on 1)

The method according to claim 1, whereby the molecular properties represented by said descriptors are at least two of:
molecular weight,
number of rotatable bonds,
number of hydrophobic groups,
number of hydrophilic groups,
number of acid groups,
number of basic groups,
number of neutral groups,
number of zwitter groups,
number of heavy atoms,
number of H-bond donors,
number of H-bond acceptors,
number of 1-2 dipoles,
number of 1-3 dipoles,
number of 1-4 dipoles.

### Claim 6 (depends on 1)

The method according to claim 1, whereby the molecular properties represented by said descriptors are:
molecular weight,
number of rotatable bonds,
number of hydrophobic groups,
number of heavy atoms,
number of H-bond donors,
number of H-bond acceptors.

### Claim 7 (depends on 1)

The method according to claim 1, whereby the molecular properties represented by said descriptors are at least two of:
molecular weight,
number of rotatable bonds,
number of hydrophobic groups,
number of heavy atoms,
number of H-bond donors,
number of H-bond acceptors.

### Claim 8 (depends on 1)

The method according to claim 1, wherein said molecule-mapping is performed using self-organizing maps within a neural network or statistical methods.

### Claim 9 (depends on 1)

The method according to claim 1, wherein said similarity relation is defined by a metric measure of the molecular properties represented by said descriptors.

### Claim 10 (depends on 1)

The method according to claim 1, wherein between step c) and d) there is a step of re-mapping said molecules on said grid such that no grid point is occupied by more than one molecule, whereby said similarity relation between each two points is conserved.

### Claim 11 (depends on 1)

The method according to claim 1, wherein forming said three-dimensional surface is performed using computational or experimental identification of biological activity.

### Claim 12 (depends on 1)

The method according to claim 1, wherein said predetermined criterion of biological activity is minimum value of biological activity.

### Claim 13 (depends on 1)

The method according to claim 1, wherein said set of molecules is held in a computerized database.

### Claim 14 (depends on 1)

The method according to claim 1, wherein said predetermined locations of step db) are corner points of the respective region.

### Claim 15 (depends on 3)

The method according to claim 3, wherein the quality criterion is defined by: DF ⁢ ⁢ ( i ) = ∑ j ⁢ ⁢ ε ⁢ ⁢ n ⁢ ⁢ b i ⁢ ⁢ [LeftDoubleBracketingBar] ∇ i ⁢ - ∇ j [RightDoubleBracketingBar] · ∑ j ⁢ ⁢ ε ⁢ ⁢ n ⁢ ⁢ b i ⁢ ⁢ [LeftDoubleBracketingBar] f ⁡ ( j ) [RightDoubleBracketingBar] # ⁢ n ⁢ ⁢ b i ⁢ λ ⁢ ⁢ ( i ) · κ
with
i: the respective triangle,
j: the corner points of triangle i,
f(j): the value of biological activity of point j,
∇i, ∇j: value of a gradient operation applied on point i, j,
λ(i): surface area of triangle i,
κ: a scaling factor,
#nb: number of corner points.

### Claim 16 (depends on 2)

The method according to claim 2, wherein said stop criterion is defined by the sum over all values of the quality criterion calculated in one step.

### Claim 17 (depends on 2)

The method according to claim 2, wherein said stop criterion is defined by a predetermined number of calculated grid points.

### Claim 18 (depends on 1)

The method according to claim 1, wherein on the grid around each selected molecule in step e), biological activity values of a predetermined number of adjacent molecules are calculated.

### Claim 19 (depends on 1)

The method according to claim 1, comprising a step of visualizing the assigned points of said 2-D grid.

### Claim 20 (depends on 1)

The method according to claim 1, comprising a step of visualizing the resulting 3-D surfaces.

### Claim 21 (depends on 1)

A computer system comprising means for performing the method according to claim 1.

### Claim 22 (depends on 21)

The computer system according to claim 21 comprising means for communicating with a database comprising said set of molecules.

### Claim 23 (depends on 1)

A data storage means storing a program for performing the method according to claim 1.

### Claim 24 (depends on 1)

A program for storing a database comprising the set of molecules for use with the method according to claim 1.

### Claim 25 (depends on 1)

A Method of producing molecules determined by the method according to claim 1.

### Claim 26 (depends on 25)

The method according to claim 25, further comprising step f) of testing said found candidate molecules in a suitable biological assay.

### Claim 27 (depends on 8)

The method according to claim 8 wherein the statistical methods include linear vector quantization.
