MemAlign: A Memory Structure to Accelerate Gene Sequencing
Bibliographic record
Abstract
Since 2003, when the human reference genome was discovered, several applications found gene sequencing a promising mechanism to help improve their results. These include studying hereditary diseases, prenatal monitoring and others. Gene sequencing in its typical configuration consists of several elaborate processing stages, each performed by a separate software package. The intermediate results are transferred via large files between gene sequencing different steps, hence making gene sequencing a processing and I/O demanding task. Taking advantage of advances memory speed and capacity and with the ultimate goal of pipelining the gene sequencing steps and avoiding utilizing file storage to communicate intermediate results, in this paper we present MemAlign, a novel pre-sorted memory structure to pipeline the first and second processing steps of gene sequencing; Alignment and Sort. The number of memory locations of MemAlign corresponds the positions on the human reference genome. Combined with techniques to compress the alignment results, MemAlign essentially eliminates the Sort step by storing alignment results in the memory location that corresponds to the alignment position. MemAlign not only speeds up the combined processing time of Alignment and Sort, but also saves the considerable amount of storage required to store the intermediate results between the two steps.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.009 | 0.004 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".