Parallel processing database tree structure
US-2015379078-A1 · Dec 31, 2015 · US
US9384239B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9384239-B2 |
| Application number | US-201213716231-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 17, 2012 |
| Priority date | Dec 17, 2012 |
| Publication date | Jul 5, 2016 |
| Grant date | Jul 5, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Various technologies described herein pertain to parallel local sequence alignment that aligns a query sequence with a database sequence. The database sequence is segmented into a plurality of stripes. A first processing unit can compute Smith-Waterman values for a first stripe of the database sequence across the query sequence based on a cost function that models biological similarity between sequences. Moreover, a second processing unit can compute Smith-Waterman values for a second stripe of the database sequence across the query sequence based on the cost function. Further, a subset of the Smith-Waterman values for the second stripe of the database sequence across the query sequence can be re-computed based on the cost function (e.g., by the first processing unit or the second processing unit). The subset of the Smith-Waterman values to be re-computed can be determined based on a query sequence length and the cost function.
Opening claim text (preview).
What is claimed is: 1. A method of aligning a query sequence with a database sequence, the query sequence comprises a string of symbols having a query sequence length, the database sequence comprises a string of symbols having a database sequence length, and the database sequence being segmented into at least a first stripe and a second stripe, the method comprising: computing, utilizing a first processing unit, Smith-Waterman values for cells in a first column-wise partition of a…
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.