| Stage 0: input + k-mering |
Builds candidate transcripts from k-mers (k=25 default) in reads; constructs a de Bruijn graph and tracks candidate transcripts via a Burrows–Wheeler index. |
k=25 default (paper); supports single/paired reads and strand-specific/ambiguous inputs. |
k-mer-based candidate generation can be sensitive to sequencing error and coverage distribution; it also determines which regions become “possible candidates” before full-length filtering. |
| Stage 1: graph size control + greedy extraction |
Limits de Bruijn graph growth by assembling candidate transcripts when memory is low; greedily traverses paths starting from highest-frequency edges using thresholds α and β. |
α=50, β=5 (empirically determined); removes traversed edges; paths become candidate transcripts. |
Greedy high-frequency pathing can suppress error-driven low-frequency k-mers (boost specificity) but may also truncate rare/lowly expressed transcripts (reducing sensitivity for low-expression reference genes). |
| Stage 1 index storage |
Stores candidate transcripts in a Burrows–Wheeler index for rapid alignment in stage 2. |
Burrows–Wheeler index integration is presented as enabling speed/minimal memory. |
Not directly about biological truth, but affects the practical “can run on laptop” claim and throughput for broader datasets. |
| Stage 2: full-length support filtering |
Maps reads back to candidate transcripts; retains “high quality finalized transcripts” for sufficiently long regions if at least ε reads align throughout the region. |
ε=20 default (paper). |
Full-length support filtering should reduce false positives from k-mer collisions/overlaps, increasing specificity while preserving sensitivity for transcripts with adequate full-length coverage. |
| Normalization + quantification |
Normalizes using upper quartile transcript expression; abundance estimated using an RPKM-like measure (reads/length and normalization factor). |
Upper quartile normalization (paper); RPKM-like measure. |
Improves comparability across experiments, which matters for differential expression downstream (not directly assembly correctness). |
| Differential expression model |
Uses DESeq-style negative binomial model; controls FDR with Benjamini–Hochberg. |
Benjamini–Hochberg FDR control (paper); negative binomial likelihood with q-values. |
Impacts downstream statistical claims; assembly errors can propagate into DE results if transcript boundaries/abundances are wrong. |
| Evaluation: reference genes, specificity, sensitivity, contiguity, RMBT |
Defines reference genes as those whose every k-mer appears in ≥1 read; assesses specificity by transcript→genome alignment; sensitivity by reference gene coverage by assembled transcripts; contiguity via single longest transcript ≥δ (δ=0.8); RMBT by read mapping back to transcripts. |
k=25 for reference genes; contiguity uses δ=80%; other δ/indicator parameters defined in equations. |
This evaluation design can favor methods that reconstruct the oracle subset while potentially under-penalizing misassembly relative to genes whose k-mers are absent from data. |