# US 2026/0134950 A1 · Systems and methods for sequence encoding, storage, and compression

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

- Number: US 2026/0134950 A1
- Document ID: US20260134950A1
- Status: Published application
- Kind: A1
- Application number: 19/030,433
- Filed: 2025-01-17
- Published: 2026-05-14
- Earliest claimed: 2016-05-19
- Assignees: Seven Bridges Genomics Inc.
- Applicants: Seven Bridges Genomics, Inc.
- Inventors: Vladimir SEMENYUK
- Web page: https://patentgrep.com/patent/US20260134950A1

## CPC

- G16B 50/00: ICT programming tools or database systems specially adapted for bioinformatics
- G16B 50/50: Compression of genetic data
- G16B 20/00: ICT specially adapted for functional genomics or proteomics, e.g. genotype-phenotype associations
- G16B 20/20: Allele or variant detection, e.g. single nucleotide polymorphism [SNP] detection
- G16B 45/00: ICT specially adapted for bioinformatics-related data visualisation, e.g. displaying of maps or networks
- G16B 50/40: Encryption of genetic data
- G06F 3/0608: {Saving storage space on storage systems}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- H03M 7/40: Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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

Genomic data is written to disk in a compact format by dividing the data into segments and encoding each segment with the smallest number of bits per character necessary for whatever alphabet of characters appears in that segment. A computer system dynamically chooses the segment boundaries for maximum space savings. A first one of the segments may use a different number of bits per character than a second one of the segments. In one embodiment, dividing the data into segments comprises scanning the data and keeping track of a number of unique characters, noting positions in the sequence where the number increases to a power of two, calculating a compression that would be obtained by dividing the genomic data into one of the plurality of segments at ones of the noted positions, and dividing the genomic data into the plurality of segments at the positions that yield the best compression.

## Claims

### Claim 1

A method for encoding genomic data, the method comprising:
dividing genomic data into a plurality of segments; and
encoding characters within each of the plurality of segments with a smallest number of bits per character needed to represent all unique characters present in each segment, wherein an identity and number of each character is encoded.

### Claim 2 (depends on 1)

The method of claim 1, wherein a first one of the segments uses a different number of bits per character than a second one of the segments.

### Claim 3 (depends on 1)

The method of claim 1, wherein, within a segment, every character is encoded using the same number of bits.

### Claim 4 (depends on 1)

The method of claim 1, wherein dividing the genomic data into the plurality of segments comprises:
scanning the genomic data and keeping track of a number of unique characters scanned;
noting positions in the sequence where the number increases to a power of two;
calculating a compression that would be obtained by dividing the genomic data into one of the plurality of segments at ones of the noted positions; and
dividing the genomic data into the plurality of segments at the positions that yield the best compression.

### Claim 5 (depends on 1)

The method of claim 1, wherein encoding the characters within each of the plurality of segments comprises:
determining a number N of unique characters in the segment; and
encoding the segment using X bits per character, where 2{circumflex over ( )}(x−1)<N<2{circumflex over ( )}x.

### Claim 6 (depends on 1)

The method of claim 1, wherein encoding the characters within each of the plurality of segments further comprises: creating for each segment a segment header and a corresponding data portion, wherein the header comprises information about an alphabet of characters that is encoded by the corresponding data portion.

### Claim 7 (depends on 5)

The method of claim 5, wherein the header comprises at least two bits that indicate a length of the header and a plurality of flag bits, wherein the flag bits identify the alphabet of characters that is encoded by the corresponding data portion.

### Claim 8 (depends on 7)

The method of claim 7, wherein the flag bits identify the alphabet using a bitmap to identify included characters.

### Claim 9 (depends on 1)

The method of claim 1, wherein the genomic data comprises a directed graph representing at least a portion of a plurality of genomes, and wherein encoding the characters within each of the plurality of segments transforms the directed graph into a sequence of bit, the method further comprising transferring the sequence of bits serially from a computer memory device a computer system to a second computer system.

### Claim 10 (depends on 1)

The method of claim 1, wherein all of the genomic data are encoded into a final encoded data set, and wherein the genomic data consists of a number N of characters, and further wherein the final encoded data comprises fewer than 2N bits.

### Claim 11

A method of compressing metadata, the method comprising:
determining an order for a plurality of objects that each comprise a plurality of bytes;
placing the bytes in a sequence within which the bytes are grouped by their position within the objects and wherein bytes within a group are in the determined order;
dividing the sequence of bytes into a plurality of segments; and
encoding bytes within each of the plurality of segments with a smallest number of bits per byte needed to represent all unique bytes present in each segment, wherein at least a first segment and a second segment use a different number of bits per byte.

### Claim 12 (depends on 11)

The method of claim 11, further comprising transferring the encoded bytes serially from a memory of a computer system to a second computer system.

### Claim 13 (depends on 11)

The method of claim 11, wherein, within a segment, every byte is encoded with the same number of bits.

### Claim 14 (depends on 11)

The method of claim 11, wherein dividing the sequence of bytes into the plurality of segments comprises:
scanning the sequence of bytes and keeping track of a number of unique bytes scanned;
noting positions in the sequence of bytes where the number increases to a power of two;
calculating a compression that would be obtained by dividing the sequence of bytes into one of the plurality of segments at ones of the noted positions; and
dividing the sequence of bytes into the plurality of segments at the positions that yield the best compression.

### Claim 15 (depends on 11)

The method of claim 11, wherein encoding the bytes within each of the plurality of segments further comprises: creating for each segment a header and a corresponding data portion, wherein the header comprises information about a set of included bytes that is encoded by the corresponding data portion.

### Claim 16 (depends on 15)

The method of claim 15, wherein the header comprises at least two bits that indicate a length of the header and a plurality of flag bits, wherein the flag bits identify the set of included bytes that is encoded by the corresponding data portion.

### Claim 17 (depends on 11)

The method of claim 11, wherein encoding the bytes within each of the plurality of segments comprises:
determining a number N of unique bytes in the segment; and
encoding the segment using X bits per byte, where 2{circumflex over ( )}(x−1)<N<2{circumflex over ( )}x.

### Claim 18 (depends on 17)

The method of claim 17, wherein each object comprises metadata for a node or an edge of a graph.

### Claim 19 (depends on 18)

The method of claim 18, wherein the graph is a genome graph representing genetic sequences from a plurality of organisms.

### Claim 20 (depends on 19)

The method of claim 19, wherein the genome graph comprises a graph geometry and graph content, wherein the genome graph and the metadata are stored in a memory subsystem within a computer system, and the method further comprises:
serializing the genome graph by serializing the graph geometry and the graph content into a stream of bytes, wherein the stream of bytes can be deserialized into a clone of the genome graph.
