# US 2023/0410939 A1 · Stable structure search system, stable structure search method, and computer-readable recording medium storing stable structure search program

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

- Number: US 2023/0410939 A1
- Document ID: US20230410939A1
- Status: Published application
- Kind: A1
- Application number: 18/171,127
- Filed: 2023-02-17
- Published: 2023-12-21
- Earliest claimed: 2022-06-16
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Kentaro KATAYAMA
- Web page: https://patentgrep.com/patent/US20230410939A1

## CPC

- G16B 15/30: Drug targeting using structural data; Docking or binding prediction
- G16C 20/30: Prediction of properties of chemical compounds, compositions or mixtures
- G16B 50/30: Data warehousing; Computing architectures
- G16C 20/40: Searching chemical structures or physicochemical data
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16C: COMPUTATIONAL CHEMISTRY; CHEMOINFORMATICS; COMPUTATIONAL MATERIALS SCIENCE

## Abstract

A stable structure search system including: a memory; and a processor coupled to the memory, the processor being configured to perform processing including: calculating, in a model in which N particles (N is an integer equal to or greater than two) arranged in a shape of a row are arranged in a lattice space, coordinates in the lattice space of an i+1-th particle in the row, by using the coordinates in the lattice space of an i-th particle in the row, and state variables represented by relative coordinates in the lattice space of the i-th particle and the i+1-th particle; computing a value of energy of the model, based on the coordinates in the lattice space of each of the N particles, every time the state variables are altered; and specifying the state variables with which the value of the energy has a local minimum value.

## Claims

### Claim 1

A stable structure search system comprising:
a memory; and
a processor coupled to the memory, the processor being configured to perform processing including:
calculating, in a model in which N particles (N is an integer equal to or greater than two) arranged in a shape of a row are arranged in a lattice space, coordinates in the lattice space of an i+1-th particle in the row, by using the coordinates in the lattice space of an i-th particle in the row, and state variables represented by relative coordinates in the lattice space of the i-th particle and the i+1-th particle;
computing a value of energy of the model, based on the coordinates in the lattice space of each of the N particles, every time the state variables are altered; and
specifying the state variables with which the value of the energy has a local minimum value.

### Claim 2 (depends on 1)

The stable structure search system according to claim 1, the processing further comprising performing search processing that includes altering any one variable among N−1 variables included in the state variables.

### Claim 3 (depends on 1)

The stable structure search system according to claim 1, wherein the relative coordinates are the coordinates of the i+1-th particle when the i-th particle is arranged at an origin in the lattice space.

### Claim 4 (depends on 3)

The stable structure search system according to claim 3, wherein the calculating of the coordinates includes calculating the coordinates of the i+1-th particle when the state variables are altered, based on the altered state variables.

### Claim 5 (depends on 4)

The stable structure search system according to claim 4, wherein the calculating of the coordinates includes calculating the coordinates of each of an i+2-th particle to an N-th particle, by assuming that each of the i+2-th particle to the N-th particle moves in parallel along with a movement of the i+1-th particle.

### Claim 6 (depends on 2)

The stable structure search system according to claim 2, wherein the computing of the value of the energy of the model includes computing the value of the energy based on an interaction between the N particles, based on the coordinates in the lattice space of each of the N particles.

### Claim 7 (depends on 6)

The stable structure search system according to claim 6, wherein the energy includes at least any one of: an energy according to angles between the N particles, an energy according to dihedral angles between the N particles, an energy according to a repulsive force or an attractive force between the N particles, and an energy according to a distance between the particles at two ends when the N particles have a cyclic structure.

### Claim 8 (depends on 5)

The stable structure search system according to claim 5, wherein the computing of the value of the energy of the model includes computing a difference between the energy after the state variables are altered and the energy before the state variables are altered.

### Claim 9 (depends on 6)

The stable structure search system according to claim 6, wherein the search processing includes determining that alteration of the state variables is permitted when the difference computed by the computing satisfies a predetermined condition.

### Claim 10 (depends on 9)

The stable structure search system according to claim 9, wherein the specifying of the state variables includes specifying, from among the state variables altered within a range of a predetermined number of updates, the state variables when determined by the search processing to be alterable and with which the energy that corresponds to the state variables has the local minimum value.

### Claim 11

A stable structure search method implemented by a computer, the method comprising:
calculating, in a model in which N particles (N is an integer equal to or greater than two) arranged in a shape of a row are arranged in a lattice space, coordinates in the lattice space of an i+1-th particle in the row, by using the coordinates in the lattice space of an i-th particle in the row, and state variables represented by relative coordinates in the lattice space of the i-th particle and the i+1-th particle;
computing a value of energy of the model, based on the coordinates in the lattice space of each of the N particles, every time the state variables are altered; and
specifying the state variables with which the value of the energy has a local minimum value.

### Claim 12

A non-transitory computer-readable recording medium storing a stable structure search program for causing a computer to perform processing comprising:
calculating, in a model in which N particles (N is an integer equal to or greater than two) arranged in a shape of a row are arranged in a lattice space, coordinates in the lattice space of an i+1-th particle in the row, by using the coordinates in the lattice space of an i-th particle in the row, and state variables represented by relative coordinates in the lattice space of the i-th particle and the i+1-th particle;
computing a value of energy of the model, based on the coordinates in the lattice space of each of the N particles, every time the state variables are altered; and
specifying the state variables with which the value of the energy has a local minimum value.
