Memory Allocation to Optimize Computer Operations of Seeding for Burrows Wheeler Alignment
AssigneeHuawei Technologies Co., Ltd.
InventorsMeysam Roodi, Zahra Lak
Life of this patent
Estimating the term…
Loading patent…
AssigneeHuawei Technologies Co., Ltd.
InventorsMeysam Roodi, Zahra Lak
Estimating the term…
In accordance with embodiments, a processing unit receives a count table and an occurrence table for a reference sequence generated using a Burrows Wheeler Transform (BWT) algorithm. The reference sequence comprises a sequence of base pairs (bps). The processing unit stores a first part of the occurrence table in a first type of memory. The size of the first part of the occurrence table is determined based on a size of the first type of memory and a first number of bps of short reads (SRs) to be processed using the first type of memory. The processing unit receives a short read (SR) of a sample sequence. The SR comprises the first number of bps and a second number of bps. The processing unit performs alignment of the short read (SR) against the reference sequence using the count table and the occurrence table.
A method comprising:
A hardware device comprising:
A non-transitory computer-readable medium having instructions stored thereon that, when executed by at least one processing unit of a hardware device comprising memory that includes a first type of memory, cause the at least one processing unit to perform operations, the operations comprising:
Dependencies are inferred from the claim text.