IP Library Granted Patent US 11,250,931
Granted Patent B2
US 11,250,931 · App. 15/254,258 · Granted Feb 15, 2022

Systems and methods for detecting recombination

Inventor: Devin Locke (Medford, MA)
Assignee: Seven Bridges Genomics Inc.
G16B20/20G16B20/00G16B30/00G16B30/10G16H50/50
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,250,931
App. No.
15/254,258
Granted
Feb 15, 2022
Kind
B2
Abstract

A method for screening for disease in a genomic sample is includes receiving a representation of a reference genome comprising a sequence of symbols. The presence of a predicted mutational event is identified in a location of the reference genome. An alternate path is created in the reference genome representing the predicted mutational event. A plurality of sequence reads are obtained from a genomic sample, wherein at least one sequence read comprises at least a portion of the predicted mutational event. The at least one sequence read is then mapped to the reference genome and a location is determined corresponding to the predicted mutational event. The predicted mutational event is then identified as present in the genomic sample. The method may be used to detect evidence of non-allelic homologous recombination (NAHR) occurring in genomic samples.

Claims (47)

1. A method of detecting a non-allelic homologous recombination (NAHR), the method comprising:

accessing, by a computer system, a genomic reference stored in the computer system and including information specifying a graph having a plurality of nodes and edges, the nodes representing nucleotide sequences, wherein the plurality of nodes and edges is stored as a plurality of objects in a memory of the computer system, wherein a first object in the plurality of objects stores a list of pointers specifying one or more locations in the memory at which at least one other object in the plurality of objects is stored, wherein the at least one other object is adjacent to the first object in the graph;

identifying within the genomic reference a first pair of homologous nucleotide sequences;

modifying the genomic reference to include a new object connecting the first pair of homologous nucleotide sequences and storing the new object in the memory, wherein the new object specifies at least a part of a new path through nodes of the graph and indicates a nucleotide sequence that results from a predicted NAHR event, the new object including a pointer to an object, among the plurality of objects, representing one of the first pair of homologous nucleotide sequences;

accessing a sample nucleotide sequence associated with a subject;

aligning the sample nucleotide sequence from the subject to the first pair of homologous nucleotide sequences using the new object indicating the nucleotide sequence that results from the predicted NAHR event; and

determining, based on results of the aligning, whether the sample nucleotide sequence is indicative of a NAHR event in the subject.

2. The method of claim 1 , wherein the graph is a directed acyclic graph.

3. The method of claim 2 , wherein aligning the sample nucleotide sequence to the first pair of homologous nucleotide sequences comprises assigning a score to each of a plurality of paths through the first pair of homologous nucleotide sequences in the genomic reference modified to include the new object.

4. The method of claim 1 , further comprising: sequencing nucleic acid from the subject to generate a sequence read.

5. The method of claim 1 , wherein identifying the first pair of homologous nucleotide sequences comprises determining whether nucleotide sequences of the first pair have at least about 90% sequence similarity.

6. The method of claim 5 , wherein identifying the first pair of homologous nucleotide sequences comprises determining whether nucleotide sequences of the first pair are separated by a distance between 10 kilobases and 300 kilobases.

7. The method of claim 1 , further comprising identifying the first pair of homologous nucleotide sequences from a database of known repeats.

8. The method of claim 1 , further comprising:

identifying a plurality of low copy repeats, each low copy repeat comprising a pair of homologous nucleotide sequences, and

modifying the genomic reference to include, for a first low copy repeat of the identified plurality of low copy repeats, a second new object connecting the associated pair of homologous nucleotide sequences and storing the second new object in the memory.

9. The method of claim 1 , wherein identifying the first pair of homologous nucleotide sequences comprises:

reading a set of nodes and edges associated with a string of N bases from the genomic reference; and

aligning the set of nodes and edges to the genomic reference to determine that nucleotide sequences of the first pair of homologous nucleotide sequences are homologous.

10. The method of claim 9 , further comprising:

reading a second set of nodes and edges associated with a string of bases offset along the genomic reference from the string of N bases; and

aligning the second set of nodes and edges and the genomic reference.

11. The method of claim 10 , further comprising:

iteratively searching a window of nodes and edges of length N at a plurality of positions of the genomic reference; and

for each position of the plurality of positions, aligning the second set of nodes and edges to a third set of nodes and edges of length N at the position of the genomic reference.

12. The method of claim 11 , wherein each position of the plurality of positions is offset from a previous position by a fixed distance.

13. A computer system for detecting a non-allelic homologous recombination (NAHR), the computer system comprising:

at least one processor; and

at least one non-transitory computer-readable storage device storing processor-executable instructions that, when executed by the at least one processor, cause the at least one processor to perform:

accessing a genomic reference stored in the at least one non-transitory computer-readable storage device and including information specifying a graph having a plurality of nodes and edges, the nodes representing nucleotide sequences, wherein the plurality of nodes and edges is stored as a plurality of objects in a memory of the computer system, wherein a first object in the plurality of objects stores a list of pointers specifying one or more locations in the memory at which at least one other object in the plurality of objects is stored, wherein the at least one other object is adjacent to the first object in the graph;

identifying within the genomic reference a first pair of homologous nucleotide sequences;

modifying the genomic reference to include a new object connecting the first pair of homologous nucleotide sequences and storing the new object in the memory, wherein the new object specifies at least a part of a new path through nodes of the graph and indicates a nucleotide sequence that results from a predicted NAHR event, the new object including a pointer to an object, among the plurality of objects, representing one of the first pair of the homologous nucleotide sequences;

accessing a sample nucleotide sequence associated with a subject;

aligning the sample nucleotide sequence from the subject to the first pair of homologous nucleotide sequences using the new object indicating the nucleotide sequence that results from the predicted NAHR event; and

determining, based on results of the aligning, whether the sample nucleotide sequence is indicative of a NAHR event in the subject.

14. The computer system of claim 13 , wherein the graph is a directed acyclic graph.

15. The method of claim 1 , wherein the new object indicates a deletion of an intervening nucleotide sequence between the first pair of homologous nucleotide sequences.

16. The method of claim 1 , wherein two objects in the plurality of objects represent the first pair of homologous nucleotide sequences.

17. The method of claim 16 , the pointer is a pointer stored in a list of pointers in a first of the two objects and is a pointer to a physical location in the memory at which a second of the two objects is stored.

18. At least one computer readable storage device storing processor-executable instructions that, when executed by at least one processor, cause the at least one processor to perform:

accessing a genomic reference stored in the at least one non-transitory computer-readable storage device and including information specifying a graph having a plurality of nodes and edges, the nodes representing nucleotide sequences, wherein the plurality of nodes and edges is stored as a plurality of objects in a memory, wherein a first object in the plurality of objects stores a list of pointers specifying one or more locations in the memory at which at least one other object in the plurality of objects is stored, wherein the at least one other object is adjacent to the first object in the graph;

identifying within the genomic reference a first pair of homologous nucleotide sequences;

modifying the genomic reference to include a new object connecting the first pair of homologous nucleotide sequences and storing the new object in the memory, wherein the new object specifies at least a part of a new path through nodes of the graph and indicates a nucleotide sequence that results from a predicted NAHR event, the new object including a pointer to an object, among the plurality of objects, representing one of the first pair of homologous nucleotide sequences;

accessing a sample nucleotide sequence associated with a subject;

aligning the sample nucleotide sequence from the subject to the first pair of homologous nucleotide sequences using the new object indicating the nucleotide sequence that results from the predicted NAHR event; and

determining, based on results of the aligning, whether the sample nucleotide sequence is indicative of an NAHR event in the subject.

19. The at least one computer readable storage device of claim 18 , wherein the graph is a directed acyclic graph.

Assignments (10)
SECURITY INTEREST Recorded Aug 4, 2022
From: PIERIANDX, INC.; SEVEN BRIDGES GENOMICS INC.
To: ORBIMED ROYALTY & CREDIT OPPORTUNITIES III, LP
Reel/Frame 061084/0786 →
RELEASE OF SECURITY INTEREST Recorded Aug 2, 2022
From: IMPERIAL FINANCIAL SERVICES B.V.
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 061055/0078 →
RELEASE OF SECURITY INTEREST Recorded May 24, 2022
From: IMPERIAL FINANCIAL SERVICES B.V.
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 060173/0792 →
SECURITY INTEREST Recorded May 24, 2022
From: SEVEN BRIDGES GENOMICS INC.
To: IMPERIAL FINANCIAL SERVICES B.V.
Reel/Frame 060173/0803 →
SECURITY INTEREST Recorded Mar 30, 2022
From: SEVEN BRIDGES GENOMICS INC.
To: IMPERIAL FINANCIAL SERVICES B.V.
Reel/Frame 059554/0165 →
TERMINATION AND RELEASE OF NOTICE OF ATTORNEY'S LIEN Recorded Sep 13, 2018
From: BROWN RUDNICK LLP
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 046943/0683 →
RELEASE OF SECURITY INTEREST Recorded Apr 12, 2018
From: MJOLK HOLDING BV
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 045928/0013 →
SECURITY INTEREST Recorded Oct 17, 2017
From: SEVEN BRIDGES GENOMICS INC.
To: MJOLK HOLDING BV
Reel/Frame 044305/0871 →
NOTICE OF ATTORNEY'S LIEN Recorded Oct 11, 2017
From: SEVEN BRIDGES GENOMICS INC.
To: BROWN RUDNICK
Reel/Frame 044174/0113 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 2, 2017
From: LOCKE, DEVIN
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 041159/0014 →
Continuity (1)
Related Publication 20180060480A1 · Mar 1, 2018
Cited By (1)
US 12,482,535