# US 2023/0274791 A1 · Codon de-optimization or optimization using genetic architecture

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

- Number: US 2023/0274791 A1
- Document ID: US20230274791A1
- Status: Published application
- Kind: A1
- Application number: 17/991,701
- Filed: 2022-11-21
- Published: 2023-08-31
- Earliest claimed: 2021-11-29
- Assignees: The Chinese University of Hong Kong
- Applicants: The Chinese University of Hong Kong
- Inventors: Maggie Haitian WANG; Hong ZHENG; Benny Chung-Ying ZEE
- Web page: https://patentgrep.com/patent/US20230274791A1

## CPC

- G16B 20/50: Mutagenesis
- G16B 40/20: Supervised data analysis
- G16B 20/00: ICT specially adapted for functional genomics or proteomics, e.g. genotype-phenotype associations
- G16B 20/40: Population genetics; Linkage disequilibrium
- G16B 25/00: ICT specially adapted for hybridisation; ICT specially adapted for gene or protein expression
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY

## Abstract

Replacement codons for modifying a genetic sequence are selected based on genetic architecture of a genome. For example, a location-specific estimation of codon usage can be generated, and preferred or un-preferred codons for a particular location can be identified statistically. A codon at a particular location can be replaced by a more-preferred or less-preferred synonymous codon. These techniques can be extended to replacement of k-mers of arbitrary length k within a segment of length s, where s is at least equal to k.

## Claims

### Claim 1

A method of modifying a genome, the method comprising:
obtaining a plurality of samples of a genetic sequence of a target organism;
determining, for each of a plurality of target locations in the genetic sequence, a location-specific probability score for each of a plurality of synonymous codons; and
for each target location:
selecting, based on the location-specific probability scores for the target location, a replacement codon; and
replacing, in a genomic molecule, an existing codon at the target location with the replacement codon.

### Claim 2 (depends on 1)

The method of claim 1 wherein determining the probability score for a particular synonymous codon includes determining a fraction of the samples of the genetic sequence that include the particular synonymous codon at the target segment.

### Claim 3 (depends on 1)

The method of claim 1 wherein the replacement codon has a highest probability score among the synonymous codons at the target segment.

### Claim 4 (depends on 1)

The method of claim 1 wherein the replacement codon has a lowest probability score among the synonymous codons at the target segment.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
computing, for each of a plurality of pairs of locations in the genetic sequence, a linkage disequilibrium parameter; and
selecting at least some of the target locations based on the linkage disequilibrium parameter.

### Claim 6 (depends on 5)

The method of claim 5 wherein the target locations are selected such that each target location has a linkage disequilibrium with respect to at least one other target location that is above a threshold.

### Claim 7 (depends on 1)

The method of claim 1 wherein the target locations include every location for which two or more synonymous codons exist.

### Claim 8 (depends on 1)

The method of claim 1 wherein the target organism is a pathogen.

### Claim 9 (depends on 1)

The method of claim 1 wherein the target organism is a virus and the location-specific probability scores are determined based on samples of the virus genetic sequence obtained from host organisms belonging to a first species.

### Claim 10 (depends on 9)

The method of claim 9 further comprising:
determining a global probability score for each of a plurality of synonymous codons based on samples of the virus genetic sequence obtained from host organisms belonging to a second species,
wherein the replacement codon is selected based in part on the location-specific probability scores and based in part on the global probability scores.

### Claim 11 (depends on 10)

The method of claim 10 further comprising:
computing, for each of a plurality of pairs of locations in the genetic sequence, a linkage disequilibrium parameter; and
selecting at least some of the target locations based on the linkage disequilibrium parameter.

### Claim 12

A method of modifying a genome, the method comprising:
obtaining a plurality of samples of a genetic sequence of a target organism;
determining, for each of a plurality of target segments in the genetic sequence, a probability score for each of a set of synonymous segments, wherein a synonymous segment is a segment obtained by replacing a k-mer in the target segment with a different k-mer without affecting a corresponding amino acid sequence, wherein each target segment has a length s and s≥k; and
for each target segment:
selecting, based on the probability scores for the target segment, a replacement segment from the set of synonymous segments; and
replacing, in a genomic molecule, the target segment with the replacement segment.

### Claim 13 (depends on 12)

The method of claim 12 wherein determining the probability score for a synonymous segment includes determining a sum of available k-mers in the segment, weighted by the k-mer frequencies observed in the samples.

### Claim 14 (depends on 12)

The method of claim 12 wherein the replacement segment has a highest probability score among the synonymous segments at the target segment.

### Claim 15 (depends on 12)

The method of claim 12 wherein the replacement segment has a lowest probability score among the synonymous segments at the target segment.

### Claim 16 (depends on 12)

The method of claim 12 wherein k=3 and each k-mer corresponds to a codon.

### Claim 17 (depends on 12)

The method of claim 12 wherein k=2 and each k-mer corresponds to a dinucleotide.

### Claim 18 (depends on 12)

The method of claim 12 wherein k=6.

### Claim 19 (depends on 18)

The method of claim 18 wherein each k-mer corresponds to a pair of adjacent codons.

### Claim 20 (depends on 12)

The method of claim 12 further comprising:
computing, for each of a plurality of pairs of segments in the genetic sequence, a linkage disequilibrium parameter; and
selecting at least some of the target segments based on the linkage disequilibrium parameter.

### Claim 21 (depends on 12)

The method of claim 12 wherein the target segments are selected such that each target segment has a linkage disequilibrium with respect to at least one other target segment that is above a threshold.

### Claim 22 (depends on 12)

The method of claim 12 wherein the target segments include every segment for which two or more synonymous segments exist.

### Claim 23 (depends on 12)

The method of claim 12 wherein the target organism is a pathogen.
