# US 2026/0074015 A1 · Sequence-graph based tool for determining variation in short tandem repeat regions

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

- Number: US 2026/0074015 A1
- Document ID: US20260074015A1
- Status: Published application
- Kind: A1
- Application number: 19/247,593
- Filed: 2025-06-24
- Published: 2026-03-12
- Earliest claimed: 2019-03-07
- Assignees: Illumina, Inc.
- Applicants: Illumina, Inc.
- Inventors: Egor Dolzhenko; Michael A. Eberle
- Web page: https://patentgrep.com/patent/US20260074015A1

## CPC

- 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
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G16B 5/20: Probabilistic models
- G16B 30/10: Sequence alignment; Homology search
- G16B 40/00: ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
- H04L 51/214: using selective forwarding
- 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
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The disclosed embodiments concern methods, apparatus, systems and computer program products for genotyping repeat sequences such as medically significant short tandem repeats (STRs). The methods involve aligning reads to a repeat sequence represented by a sequence graph, and using the aligned reads to genotype the repeat sequence. The sequence graph is a directed graph each including at least one self-loop representing a repeat sub-sequence. In some implementations, the reads are paired end reads, and both mates of each read pair may be used to genotype the repeat sequences. Some implementations can be used to determine degenerate codon repeats. Some implementations can be used to genotype repeat sequences each including two or more repeat sub-sequences. Some implementations can be used to genotype nucleic acid sequences each including at least one repeat sub-sequence and another genetic variant such as an insertion, deletion, or substitution.

## Claims

### Claim 1

A method, implemented using a computer comprising one or more processors and system memory, for characterizing one or more repeat sequences each including one or more repeat sub-sequences, the method comprising:
(a) obtaining a sequence graph, wherein the sequence graph has a data structure of a graph with vertices representing nucleic acid sequences and directed edges connecting the vertices, and wherein the sequence graph comprises one or more self-loops, each self-loop representing a repeat sub-sequence; and
(b) aligning, by the one or more processors, sequence reads of a test sample to a reference sequence that spans the one or more repeat sequences each represented by the sequence graph.

### Claim 2 (depends on 1)

The method of claim 1, wherein each repeat sub-sequence comprises repeats of a repeat unit of one or more nucleotides.

### Claim 3 (depends on 1)

The method of claim 1, wherein a repeat sequence of the one or more repeat sequences comprises a particular repeat unit comprising at least one incompletely specified nucleotide.

### Claim 4 (depends on 3)

The method of claim 3, wherein the particular repeat unit comprises degenerate codons.

### Claim 5 (depends on 1)

The method of claim 1, wherein the one or more self-loops comprise two or more self-loops representing two or more repeat sub-sequences.

### Claim 6 (depends on 1)

The method of claim 1, wherein the sequence graph further comprises two or more alternative paths for two or more alleles and further comprising genotyping the two or more alleles using sequence reads aligned to the two or more paths.

### Claim 7 (depends on 1)

The method of claim 1, further comprising generating the sequence graph based on a locus specification obtained from a variant catalog.

### Claim 8 (depends on 1)

The method of claim 1, further comprising generating a file indicating variant call information associated with the sequence reads of the test sample that are determined based on the alignment of the sequence reads to the reference sequence.

### Claim 9 (depends on 1)

The method of claim 1, wherein the sequence reads comprise paired end reads, and further comprising:
(c) identifying anchor reads and anchored reads in the paired end reads, wherein the anchor reads are reads aligned to or near a repeat sequence of the one or more repeat sequences, and wherein the anchored reads are unaligned reads that are paired with the anchor reads; and
(d) determining a likelihood of a repeat expansion in the test sample based at least in part on the identified anchored reads.

### Claim 10 (depends on 9)

The method of claim 9, wherein determining the likelihood of the repeat expansion is based on a comparison of a distribution of a number of repeats of the test sample from a distribution of one or more control samples.

### Claim 11 (depends on 9)

The method of claim 9, wherein the unaligned reads comprise reads that cannot be aligned or are aligned to the sequence graph with at least one mismatch.

### Claim 12 (depends on 9)

The method of claim 9, wherein determining the likelihood of the repeat expansion in the test sample is based on a determination that a number of the anchor reads and/or the anchored reads having repeats is greater than a predetermined threshold.

### Claim 13 (depends on 1)

The method of claim 1, wherein the reference sequence is at least about 2000 base pairs, and wherein at least one sequence read of the sequence reads has a length of at least 100 base pairs.

### Claim 14 (depends on 1)

The method of claim 1, further comprising, prior to (a), collecting the sequence reads from a database, wherein the sequence reads were obtained from a sequencing apparatus.

### Claim 15

A system for characterizing one or more repeat sequences each including one or more repeat sub-sequences, the system comprising:
a memory; and
one or more processors coupled to the memory, wherein the one or more processors are configured to:
(a) obtain a sequence graph, wherein the sequence graph has a data structure of a graph with vertices representing nucleic acid sequences and directed edges connecting the vertices, and wherein the sequence graph comprises one or more self-loops, each self-loop representing a repeat sub-sequence; and
(b) align sequence reads of a test sample to a reference sequence that spans the one or more repeat sequences each represented by the sequence graph.

### Claim 16 (depends on 15)

The system of claim 15, wherein each repeat sub-sequence comprises repeats of a repeat unit of one or more nucleotides.

### Claim 17 (depends on 15)

The system of claim 15, wherein the one or more processors are further configured to generate the sequence graph based on a locus specification obtained from a variant catalog.

### Claim 18 (depends on 15)

The system of claim 15, wherein the one or more processors are further configured to generate a file indicating variant call information associated with the sequence reads of the test sample that are determined based on the alignment of the sequence reads to the reference sequence.

### Claim 19 (depends on 15)

The system of claim 15, wherein the sequence reads comprise paired end reads, and wherein the one or more processors are further configured to:
(c) identify anchor reads and anchored reads in the paired end reads, wherein the anchor reads are reads aligned to or near a repeat sequence of the one or more repeat sequences, and wherein the anchored reads are unaligned reads that are paired with the anchor reads; and
(d) determine a likelihood of a repeat expansion in the test sample based at least in part on the identified anchored reads.

### Claim 20

A computer program product comprising a non-transitory computer readable medium storing program code that, when executed by one or more processors of a computer system, causes the computer system to implement a method for characterizing one or more repeat sequences each including one or more repeat sub-sequences, the method comprising:
(a) obtaining a sequence graph, wherein the sequence graph has a data structure of a graph with vertices representing nucleic acid sequences and directed edges connecting the vertices, and wherein the sequence graph comprises one or more self-loops, each self-loop representing a repeat sub-sequence; and
(b) aligning sequence reads of a test sample to a reference sequence that spans the one or more repeat sequences each represented by the sequence graph.
