IP Library Granted Patent US 8,271,206
Granted Patent B2
US 8,271,206 · App. 12/427,409 · Granted Sep 18, 2012

DNA sequence assembly methods of short reads

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 8,271,206
App. No.
12/427,409
Granted
Sep 18, 2012
Kind
B2
Abstract

Certain embodiments of the invention provide systems and methods for the automated assembly of DNA sequence data into contiguous DNA segments using a computer a system. DNA sequence data is entered into the system. The system indexes and groups a plurality of DNA fragment reads utilizing an anchor sequence and consolidates the fragments into larger sequences by merging the fragment reads within a group.

Claims (32)

1. A method for automated assembly of DNA sequence data comprising of DNA fragment reads into contiguous DNA segments using a computer system with processing and information storage capabilities, the method comprising the steps of:

entering into the computer system a plurality of DNA fragment reads;

identifying a plurality of n-mers within each DNA fragment read of a plurality of the DNA fragment reads and compiling an index of the of n-mers;

identifying one or more anchor sequences common to a plurality of the reads among the indexed n-mers; and

generating a consolidated sequence using a plurality of reads comprising the same indexed anchor sequence,

wherein the consolidated sequence is generated by sub-grouping the plurality of reads comprising the same indexed anchor sequence according to two or more different shoulder sequences thereby producing two or more subgroups of reads and generating one or more consolidated sequences, wherein each of the one or more consolidated sequences is generated using reads of one of the two or more subgroups.

2. A method as claimed in claim 1 , further including the step of elongating a selected fragment read by pooling consolidated regions of the plurality of fragment reads.

3. A method as claimed in claim 2 , wherein an average read length is increased in the range of 1.4-1.6.

4. A method as claimed in claim 2 , further including preservation of Indels and/or SNPs.

5. A method as claimed in claim 4 , further including the step of aligning an elongated fragment read to a user defined sequence read to determine SNP and Indels.

6. A method as claimed in claim 1 , in which the step of identifying a plurality of n-mers within each nucleic acid fragment of a plurality of nucleic acid fragment reads comprises identifying all n-mers within each nucleic acid fragment of a plurality of the nucleic acid fragment reads.

7. A method as claimed in claim 5 , wherein low frequency errors are eliminated.

8. A method as claimed in claim 5 , wherein total read count is reduced.

9. A method as claimed in claim 1 , wherein consensus sequence errors are reduced below 0.5%.

10. A method as claimed in claim 1 , wherein the anchor sequence has a length of 12 bases.

11. A sequence assembly system for transforming DNA sequence information from DNA fragment reads into contigs of contiguous DNA sequence, the system comprising a computer processor, memory, and data storage devices, the memory having programming instructions to operate the computer processor to consolidate a set of fragment reads by:

identifying a plurality of n-mers within each DNA fragment read of a plurality of DNA fragment reads and compiling an index of the of n-mers;

identifying one or more anchor sequences common to a plurality of the reads among the indexed n-mers; and

generating a consolidated sequence using a plurality of reads comprising the same indexed anchor sequence,

wherein the consolidated sequence is generated by sub-grouping the plurality of reads comprising the same indexed anchor sequence according to two or more different shoulder sequences thereby producing two or more subgroups of reads and generating one or more consolidated sequences, wherein each of the one or more consolidated sequences is generated using reads of one of the two or more subgroups.

12. A system as claimed in claim 11 , further comprising using said computer processor to output to a display a user interface window, said window further displaying one or more of a whole genome pane, an aligned sequence pane, and a consensus sequence pane.

13. A system as claimed in claim 11 , further comprising using said computer processor to output to a display a user preferences window, said preferences including choices to programmatically control said processor of said assembly system with rules, said rules comprising:

Counts Selection Rules;

Directional Limitations;

Shoulder Selection Rules; and

jumping rules.

14. A system as claimed in claim 13 , wherein the rules include an anchor sequence dynamically adjustable.

15. A system as claimed in claim 14 wherein a 5′ end is given more statistical weight than a 3′ end of the fragment reads.

16. A system as claimed in claim 11 , further comprising jumping rules, said jumping rules comprising slicing the plurality of DNA sequences into multiple sections wherein at least one section includes an at least 12-mer fragment and the DNA sequences are sliced at positions having greater than 2 homopolymers, and conserving a portion of the DNA sequences without large homopolymers.

17. A system as claimed in claim 11 , further including programming instructions operable to calculate a known Indel by aligning the consolidated sequence or an elongated version thereof having an anchor sequence with a known reference sequence having the anchor sequence to determine the Indel location.

18. A system as claimed in claim 11 , further including programming instructions operable to calculate a known single-nucleotide polymorphism (SNP) by aligning the consolidated sequence or an elongated version thereof with a known reference sequence to determine the SNP location.

19. A method as claimed in claim 1 , comprising generating a plurality of consolidated sequences, wherein each of the plurality of consolidated sequences is generated using a different anchor sequence.

Assignments (6)
RELEASE OF SECURITY INTEREST Recorded Jul 1, 2025
From: ARES CAPITAL CORPORATION, AS COLLATERAL AGENT
To: PROTEIN METRICS, LLC; SOFTGENETICS, LLC
Reel/Frame 071582/0907 →
RELEASE OF SECURITY INTEREST Recorded Jul 2, 2024
From: BARINGS FINANCE LLC, AS COLLATERAL AGENT
To: SOFTGENETICS, LLC
Reel/Frame 067895/0174 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Jul 1, 2024
From: PROTEIN METRICS, LLC; SOFTGENETICS, LLC
To: ARES CAPITAL CORPORATION, AS COLLATERAL AGENT
Reel/Frame 068102/0180 →
TERMINATION OF PATENT SECURITY AGREEMENT AT REEL 64174/FRAME 0240 Recorded Jul 1, 2024
From: BARINGS FINANCE LLC, AS ADMINISTRATIVE AGENT AND COLLATERAL AGENT
To: SOFTGENETICS, LLC
Reel/Frame 068102/0265 →
SECURITY INTEREST Recorded Jul 6, 2023
From: SOFTGENETICS, LLC
To: BARINGS FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 064174/0240 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2009
From: LIU, CHANGSHENG JONATHAN; WU, YIQIONG; LEVAN, KEVIN JAY
To: SOFTGENETICS LLC
Reel/Frame 023137/0968 →