# US 2020/0286586 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 2020/0286586 A1
- Document ID: US20200286586A1
- Status: Published application
- Kind: A1
- Application number: 16/811,919
- Filed: 2020-03-06
- Published: 2020-09-10
- Earliest claimed: 2019-03-07
- Assignees: Illumina, Inc.
- Applicants: Illumina, Inc.
- Inventors: Egor Dolzhenko; Michael A. Eberle
- Web page: https://patentgrep.com/patent/US20200286586A1

## 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 genotyping one or more repeat sequences each including one or more repeat sub-sequences, the method comprising:
(a) collecting, using the one or more processors, sequence reads of a test sample from a database;
(b) aligning, by the one or more processors, the sequence reads to the one or more repeat sequences each represented by a sequence graph, wherein the sequence graph has a data structure of a directed 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, each repeat sub-sequence comprising repeats of a repeat unit of one or more nucleotides; and
(c) determining, by the one or more processors, one or more genotypes for the one or more repeat sequences using the sequence reads aligned to the one or more repeat sequences.

### Claim 2 (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 3 (depends on 2)

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

### Claim 4 (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 5 (depends on 1)

The method of claim 1, wherein the sequence graph further comprises two or more alternative paths for two or more alleles.

### Claim 6 (depends on 5)

The method of claim 5, wherein the two or more alleles comprise an indel or a substitution.

### Claim 7 (depends on 5)

The method of claim 5, wherein the substitution comprises a single nucleotide variant (SNV) or a single nucleotide polymorphism (SNP).

### Claim 8 (depends on 5)

The method of claim 5, further comprising genotyping the two or more alleles using sequence reads aligned to the two or more alternative paths.

### Claim 9 (depends on 8)

The method of claim 8, wherein genotyping the two or more alleles comprises providing coverages of the two or more alternative paths to a probabilistic model to determine the probabilities of the two or more alleles.

### Claim 10 (depends on 9)

The method of claim 9, wherein the probabilistic model simulates a probability of an allele as a function of the coverage of the allele, the function being selected from a Poisson distribution, negative-binomial distribution, a binomial distribution, or a beta-binomial distribution.

### Claim 11

(canceled)

### Claim 12 (depends on 1)

The method of claim 1, further comprising, aligning, before (b), the sequence reads to a reference genome to determine genomic coordinates of the sequence reads, and selecting a subset of sequence reads as the sequence reads to be aligned to the one or more repeat sequences each represented by a sequence graph.

### Claim at position 13

13-15. (canceled)

### Claim 16 (depends on 1)

The method of claim 1, wherein aligning a sequence read to the sequence graph comprises:
finding a kmer match between the sequence read and a path of the sequence graph; and
extending the kmer match to a full alignment of nodes and edges of the sequence graph including one or more self-loops.

### Claim 17 (depends on 1)

The method of claim 1, wherein aligning a sequence read to the sequence graph comprises graph shrinking by removing low confidence ends of the alignments.

### Claim 18 (depends on 1)

The method of claim 1, wherein aligning a sequence read to the sequence graph comprises alignment merging by:
aligning subsequences of the read to a sequence graph; and
merging alignments of the subsequences to form a full alignment of the sequence read.

### Claim 19 (depends on 1)

The method of claim 1, further comprising generating the sequence graph based on locus specification comprising a locus structure of the genomic locus.

### Claim 20 (depends on 1)

The method of claim 1, wherein the sequence reads comprise paired end reads, and operation (c) comprises:
(i) identifying anchor and anchored reads in the paired end reads, wherein the anchor reads are reads aligned to or near the one or more repeat sequences, and the anchored reads are unaligned reads that are paired with the anchor reads; and
(ii) determining the one or more genotypes for the one or more repeat sequences using at least the anchored reads.

### Claim at position 19

21-23. (canceled)

### Claim 24 (depends on 1)

The method of claim 1, wherein the one or more repeat sequences comprise a short tandem repeat (STR) sequence.

### Claim 25 (depends on 24)

The method of claim 24, wherein an expansion of the STR is associated with Fragile X syndrome, amyotrophic lateral sclerosis (ALS), Huntington's disease, Friedreich's ataxia, spinocerebellar ataxia, spino-bulbar muscular atrophy, myotonic dystrophy, Machado-Joseph disease, or dentatorubral pallidoluysian atrophy.

### Claim at position 22

26-30. (canceled)

### Claim 31

A system comprising:
system memory; and
one or more processors configured to:
(a) collect sequence reads of a test sample from a database;
(b) align the sequence reads to the one or more repeat sequences each represented by a sequence graph, wherein the sequence graph has a data structure of a directed 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, each repeat sub-sequence comprising repeats of a repeat unit of one or more nucleotides; and
(c) determine one or more genotypes for the one or more repeat sequences using the sequence reads aligned to the one or more repeat sequences.

### Claim 32

A computer program product comprising a non-transitory machine 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 genotyping a repeat sequence in a test sample comprising nucleic acids, said program code comprising:
(a) code for collecting sequence reads of a test sample from a database;
(b) code for aligning the sequence reads to the one or more repeat sequences each represented by a sequence graph, wherein the sequence graph has a data structure of a directed 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, each repeat sub-sequence comprising repeats of a repeat unit of one or more nucleotides; and
(c) code for determining one or more genotypes for the one or more repeat sequences using the sequence reads aligned to the one or more repeat sequences.
