# US 2024/0404593 A1 · Fixed point number representation and computation circuits

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

- Number: US 2024/0404593 A1
- Document ID: US20240404593A1
- Status: Published application
- Kind: A1
- Application number: 18/282,825
- Filed: 2022-03-18
- Published: 2024-12-05
- Earliest claimed: 2021-03-24
- Assignees: Catalog Technologies, Inc.
- Applicants: Catalog Technologies, Inc.
- Inventors: Swapnil P. Bhatia; Michael Norsworthy; Tracy Kambara
- Web page: https://patentgrep.com/patent/US20240404593A1

## CPC

- G11C 13/0019: {comprising bio-molecules}
- C12N 15/1093: {General methods of preparing gene libraries, not provided for in other subgroups}
- C12Q 1/68: involving nucleic acids
- G16B 35/00: ICT specially adapted for in silico combinatorial libraries of nucleic acids, proteins or peptides
- G16B 50/00: ICT programming tools or database systems specially adapted for bioinformatics
- G06N 3/123: DNA computing
- H03M 7/3088: {employing the use of a dictionary, e.g. LZ78}
- G11C: STATIC STORES (semiconductor memory devices H10B)
- C12N: MICROORGANISMS OR ENZYMES; COMPOSITIONS THEREOF; PROPAGATING, PRESERVING, OR MAINTAINING MICROORGANISMS; MUTATION OR GENETIC ENGINEERING; CULTURE MEDIA (microbiological testing media C12Q1/00)
- C12Q: MEASURING OR TESTING PROCESSES INVOLVING ENZYMES, NUCLEIC ACIDS OR MICROORGANISMS (immunoassay G01N33/53); COMPOSITIONS OR TEST PAPERS THEREFOR; PROCESSES OF PREPARING SUCH COMPOSITIONS; CONDITION-RESPONSIVE CONTROL IN MICROBIOLOGICAL OR ENZYMOLOGICAL PROCESSES
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

The present disclosure provides systems and methods for storing digital information into nucleic acid molecules in various ways. Digital information may be received as a sting of symbols, wherein each symbol in the string of symbols has a symbol value and a symbol position within the string of symbols. A first identifier nucleic acid molecule may be formed by depositing M selected component nucleic acid molecules into a compartment, the M selected component nucleic acid molecules being selected from a set of distinct component nucleic acid molecules that are separated into M different layers, and physically assembling the M selected component nucleic acid molecules. A plurality of identifier nucleic acid molecules may be formed, each corresponding to a respective symbol position. The identifier nucleic acid molecules may be formed in a pool having powder, liquid, or solid form.

## Claims

### Claim 1

A method for writing information into nucleic acid sequences, the method comprising:
obtaining a first fixed point number;
obtaining a library of component nucleic acid sequences defining a combinatorial space of identifier nucleic acid sequences each comprising an ordered subset of the component nucleic acid sequences;
identifying a first subset of identifier nucleic acid sequences in the combinatorial space as a first codeword having a codeword size corresponding to the number of identifier nucleic acid sequences in the first subset;
forming a first set of one or more identifier nucleic acid molecules having distinct identifier nucleic acid sequences of the first subset, wherein a ratio of the number of distinct identifier nucleic acid sequences represented in the first set to the codeword size approximates the first fixed point number.

### Claim 2 (depends on 1)

The method of claim 1, wherein the library of component nucleic acid sequences comprises a plurality of layers, each layer comprising a subset of the component nucleic acid sequences, and wherein each identifier nucleic acid sequences comprises one component nucleic acid sequence from each layer.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first fixed point number has a value x, wherein the codeword size is w, and k identifier nucleic acid molecules are formed in the first set, such that the ratio is k/w and approximately equals x.

### Claim 4 (depends on 3)

The method of claim 3, wherein k/w is within plus or minus 20% of x.

### Claim 5 (depends on 1)

The method of claim 1, wherein the codeword size is at least 8.

### Claim 6 (depends on 5)

The method of claim 5, wherein the codeword size is at least 256.

### Claim 7 (depends on 6)

The method of claim 6, wherein the codeword size is at least 512.

### Claim 8 (depends on 7)

The method of claim 7, wherein the codeword size is at least 1024.

### Claim 9 (depends on 1)

The method of claim 1, the method further comprising:
obtaining a second fixed point number;
identifying a second subset of identifier nucleic acid sequences in the combinatorial space as a second codeword having the codeword size of the first codeword and corresponding to the number of identifier nucleic acid sequences in the second subset; and
forming a second set of one or more identifier nucleic acid molecules having distinct identifier nucleic acid sequences of the second subset, wherein a ratio of the number of distinct identifier nucleic acid sequences in the second set to the codeword size approximates the second fixed point number.

### Claim 10 (depends on 9)

The method of claim 9, further comprising adding the first fixed point number and the second fixed point number by:
pooling the first set and the second set to obtain a sum pool; and
diluting the pooled sets to obtain a scaled sum pool.

### Claim 11 (depends on 9)

The method of claim 9, further comprising multiplying the first fixed point number and the second fixed point number by:
pooling the first set and the second set to obtain a factor pool; and
applying a chemical AND operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

### Claim 12 (depends on 11)

The method of claim 11, wherein the chemical AND operation comprises:
converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules;
hybridizing complementary identifier nucleic acid molecules; and
selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool.

### Claim 13 (depends on 12)

The method of claim 12, wherein selecting comprises using at least one of an enzyme that selectively degrades single-stranded nucleic acid molecules or an enzyme that selectively degrades double-stranded nucleic acid molecules having sequence mismatches.

### Claim 14 (depends on 9)

The method of claim 9, further comprising:
pooling the first set and the second set to obtain a factor pool; and
applying a chemical OR operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

### Claim 15 (depends on 14)

The method of claim 14, comprising mixing the first set and the second set.

### Claim 16 (depends on 9)

The method of claim 9, further comprising:
pooling the first set and the second set to obtain a factor pool; and
applying a chemical NIMPLY operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

### Claim 17 (depends on 16)

The method of claim 16, wherein the chemical NIMPLY operation comprises
converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules, the single-stranded identifier nucleic acid molecules of the second set comprising an affinity tag;
providing a molar excess of single-stranded identifier nucleic acid molecules of the second set;
hybridizing complementary identifier nucleic acid molecules; and
selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool using a specific capture mechanism against the affinity tag.

### Claim 18 (depends on 9)

The method of claim 9, further comprising:
pooling the first set and the second set to obtain a factor pool; and
applying a chemical NOT operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

### Claim 19 (depends on 18)

The method of claim 18, wherein the chemical NOT operation comprises:
converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules, the single-stranded identifier nucleic acid molecules of the first set comprising an affinity tag;
providing a molar excess of single-stranded identifier nucleic acid molecules of the first set;
hybridizing complementary identifier nucleic acid molecules; and
selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool using a specific capture mechanism against the affinity tag.

### Claim 20 (depends on 9)

The method of claim 9, further comprising:
pooling the first set and the second set to obtain a factor pool; and
applying a chemical XOR operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

### Claim 21 (depends on 21)

The method of claim 21, wherein the chemical XOR operation comprises:
performing two NIMPLY operations followed by an OR operation.
