# US 2026/0074020 A1 · Genetic data processing

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

- Number: US 2026/0074020 A1
- Document ID: US20260074020A1
- Status: Published application
- Kind: A1
- Application number: 19/322,814
- Filed: 2025-09-09
- Published: 2026-03-12
- Earliest claimed: 2024-09-09
- Assignees: Dassault Systemes
- Applicants: Dassault Systemes
- Inventors: Elie-Julien EL-HACHEM
- Web page: https://patentgrep.com/patent/US20260074020A1

## CPC

- G16B 25/10: Gene or protein expression profiling; Expression-ratio estimation or normalisation
- G16B 40/30: Unsupervised data analysis
- G16B 5/00: ICT specially adapted for modelling or simulations in systems biology, e.g. gene-regulatory networks, protein interaction networks or metabolic networks
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY

## Abstract

A computer-implemented method for genetic data processing. The processing method including obtaining a dataset comprising microbial gene expression data for a plurality of patients. The method comprises clustering the plurality of patients into a set of clusters based on the microbial gene expression data. The method comprises determining genes of which expression explains the clustering by selecting genes included in a set of metabolic pathways and/or by identifying genes exhibiting significantly different expressions across the clusters. The method forms an improved solution for patient stratification based on metagenomic data.

## Claims

### Claim 1

A computer-implemented method for genetic data processing, the method comprising:
obtaining a dataset comprising microbial gene expression data for a plurality of patients;
clustering the plurality of patients into a set of clusters based on the microbial gene expression data; and
determining genes of which expression explains the clustering by:
selecting genes included in a set of metabolic pathways and identifying genes exhibiting significantly different expressions across the clusters, or
selecting genes included in a set of metabolic pathways, or
identifying genes exhibiting significantly different expressions across the clusters.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the clustering further comprises:
performing several iterations of a Latent Dirichlet allocation, each iteration including assigning each patient to one of a plurality of topics;
determining a graph including nodes representing the plurality of patients and edges connecting pairs of nodes, a length of each edge connecting a pair of nodes being function of a number of occurrences of the patients represented by the connected nodes in a same topic over the several iterations of the latent Dirichlet allocation; and
performing a graph-based clustering of the determined graph.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the graph is determined based on Fruchterman-Reingold force-directed algorithm.

### Claim 4 (depends on 2)

The method of claim 2, wherein the graph-based clustering is performed based on Louvain clustering algorithm.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the identifying of genes exhibiting significantly different expressions across the clusters further comprises:
comparing the expression of each gene between each cluster; and
retaining genes with significantly different expressions between the clusters based on results of the comparing.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein the comparing the expression of each gene is performed based on a Kruskal-Wallis test computing a respective p-value for each gene, the retained genes having optionally p-values lower than 1%.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising selecting the set of metabolic pathways by extracting, from a database of existing metabolic pathways, the most significantly enriched metabolic pathways in terms of genes.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein the selecting of the set of metabolic pathways is performed based on a Fisher's exact test computing a respective p-value for each metabolic pathway, the selected metabolic pathways of the set having optionally p-values lower than 5%.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, further comprising filtering, from a database of genes, genes of which relative expression is above a threshold, the genes being determined from the genes remaining after the filtering.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, further comprising:
obtaining microbial gene expression data for a patient, the microbial gene expression data including the expression of the genes determined by the determining; and
determining the cluster to which the patient belongs based on the expression of the determined genes for the patient.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, further comprising determining a closest patient among the patients of the determined cluster.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein the closest patient is determined using Bray-Curtis distance.

### Claim 13

A device comprising:
a processor; and
a non-transitory computer-readable data storage medium having recorded thereon
a computer program having instructions for genetic data processing which, when the program is executed by the processor cause the processor to be configured to:
obtain a dataset comprising microbial gene expression data for a plurality of patients;
cluster the plurality of patients into a set of clusters based on the microbial gene expression data; and
determine genes of which expression explains the clustering by the processor being further configured to:
select genes included in a set of metabolic pathways and identifying genes exhibiting significantly different expressions across the clusters, or
select genes included in a set of metabolic pathways, or
identify genes exhibiting significantly different expressions across the clusters.

### Claim 14 (depends on 13)

The device of claim 13, wherein the non-transitory computer-readable data storage medium has further recorded thereon a second computer program having instructions for the clustering which, when the program is executed by the processor cause the processor to be configured to:
obtain microbial gene expression data for a patient, the microbial gene expression data including the expression of the determined genes; and
determine the cluster to which the patient belongs based on the expression of the determined genes for the patient.

### Claim 15 (depends on 13)

The device of claim 13, wherein the processor is further configured to cluster the plurality of patients by being configured to:
perform several iterations of a Latent Dirichlet allocation, each iteration comprising assigning each patient to one of a plurality of topics;
determine a graph including nodes representing the plurality of patients and edges connecting pairs of nodes, a length of each edge connecting a pair of nodes being function of a number of occurrences of the patients represented by the connected nodes in a same topic over the several iterations of the latent Dirichlet allocation; and
perform a graph-based clustering of the determined graph.

### Claim 16 (depends on 15)

The device of claim 15, wherein the graph is determined based on Fruchterman-Reingold force-directed algorithm.

### Claim 17 (depends on 15)

The device of claim 15, wherein the graph-based clustering is performed based on Louvain clustering algorithm.

### Claim 18

A non-transitory computer-readable memory having stored thereon a program that when executed by a computer causes the computer to implement a method for genetic data processing, the method comprising:
obtaining a dataset comprising microbial gene expression data for a plurality of patients;
clustering the plurality of patients into a set of clusters based on the microbial gene expression data; and
determining genes of which expression explains the clustering by:
selecting genes included in a set of metabolic pathways and identifying genes exhibiting significantly different expressions across the clusters, or
selecting genes included in a set of metabolic pathways, or
identifying genes exhibiting significantly different expressions across the clusters.

### Claim 19 (depends on 18)

The non-transitory computer-readable memory of claim 18, wherein the clustering further comprises:
performing several iterations of a Latent Dirichlet allocation, each iteration including assigning each patient to one of a plurality of topics;
determining a graph comprising nodes representing the plurality of patients and edges connecting pairs of nodes, a length of each edge connecting a pair of nodes being function of a number of occurrences of the patients represented by the connected nodes in a same topic over the several iterations of the latent Dirichlet allocation; and
performing a graph-based clustering of the determined graph.

### Claim 20 (depends on 19)

The non-transitory computer-readable memory of claim 19, wherein the graph is determined based on Fruchterman-Reingold force-directed algorithm.
