S-Tier Computational
Biology & Bioinformatics
Test Bank | Elite
Questions (scRNA-seq,
MD, Genomics, Machine
Learning)
Table of Contents
Section Cognitive Tier Focus Area
PART I The Preview Critical Axioms & Core
Methodology
PART II Tier 1: Foundational Syntax Algorithms, Thermodynamics,
(Q1–18) Core Syntax
PART II Tier 2: Complex Application Transcriptomics, Simulation,
(Q19–37) Kinetics
PART II Tier 3: Grandmaster Multi-Omics, Pangenomics,
Synthesis (Q38–55) Neural Architectures
PART I: The Preview
Mastering this test bank translates directly to elite computational competence, bridging
theoretical biophysics with applied machine learning and genomic architectures. Precision in
these domains separates technicians from chief architects of biological discovery.
Core Axiom Theoretical Basis Algorithmic Execution
The Velocity Axiom Transcriptional kinetics can be Projection onto non-linear
inferred from spliced vs. manifolds inherently distorts
unspliced mRNA ratios. vector fields.
The Alignment Axiom The Burrows-Wheeler Hierarchical graph FM-indices
Transform (BWT) with extend this to spliced and
LF-mapping permits sub-linear pangenomic alignments.
search space reductions.
,Core Axiom Theoretical Basis Algorithmic Execution
The Equivariance Axiom 3D molecular conformation E(n)-Equivariant Graph Neural
prediction models must Networks (EGNNs) bypass
maintain spatial relationships coordinate-dependency traps.
under rotation/translation.
The Thermodynamic Axiom Jarzynski's equality maps Computations suffer from
non-equilibrium work exponential sensitivity to rare,
distributions to equilibrium free highly dissipative trajectories.
energy landscapes.
PART II: The Elite Test Bank
Q1: During global sequence alignment using the Needleman-Wunsch algorithm, a researcher
transitions from a linear gap penalty to an affine gap penalty model. Based on the principles of
dynamic programming, which algorithmic modification is the MOST CRITICAL to accurately
populate the matrix? A) Replacing the standard substitution matrix with a position-specific
scoring matrix (PSSM). B) Eliminating the initialization row and column to prevent negative
indexing. C) Tracking three separate matrices to decouple gap opening from gap extension
states. D) Restricting the traceback path to strictly diagonal movements.
● Answer: C (Tracking three separate matrices to decouple gap opening from gap extension
states)
● Distractor Analysis:
○ A is incorrect: While a PSSM alters match/mismatch scores, it does not manage the
distinct mathematical states required for affine gap penalties.
○ B is incorrect: Initialization is strictly required in global alignment to account for
leading gaps.
○ D is incorrect: Restricting diagonal movements disables the algorithm's ability to
model indels entirely.
The Mentor's Analysis: Affine gap penalties require the algorithm to "remember" if a gap is
already open, as the mathematical penalty shifts from the initiation cost to the extension cost.
When facing non-linear penalties, the immediate priority is tracking multiple computational
states simultaneously. By utilizing three coupled matrices (Match, Insert X, Insert Y), you bypass
the common trap of over-penalizing contiguous biological deletions. Professional Intuition:
Always separate the initiation cost from the extension cost algorithmically to preserve
long contiguous indels.
Q2: In estimating the statistical significance of a local sequence alignment, the BLAST algorithm
utilizes the Gumbel extreme value distribution. If the effective search space is doubled while the
scoring matrix remains constant, what is the MOST LOGICAL impact on the Karlin-Altschul
parameters and the resulting E-value? A) The \lambda parameter halves, exponentially
decreasing the E-value. B) The K parameter doubles, resulting in a proportionally lower E-value.
C) Both \lambda and K remain unchanged, but the E-value doubles. D) The E-value remains
constant because \lambda scales inversely with sequence length.
● Answer: C (Both \lambda and K remain unchanged, but the E-value doubles)
● Distractor Analysis:
○ A is incorrect: The scale parameter \lambda is defined exclusively by the scoring
matrix and background frequencies, not database size.
○ B is incorrect: K is a proportionality constant reflecting the search space geometry,
, not the database size itself.
○ D is incorrect: The E-value is directly proportional to the effective search space (E =
Kmn e^{-\lambda S}).
The Mentor's Analysis: Karlin-Altschul parameters are intrinsic to the scoring system and the
expected background nucleotide frequencies. When facing database expansions, the immediate
priority is adjusting the search space multiplier without altering the foundational statistical
matrices. By utilizing the linear relationship between space (m \times n) and E-value, you
bypass the common trap of misattributing significance loss to matrix parameters. Professional
Intuition: \lambda and K are matrix-specific constants; the E-value scales linearly with
database size.
Q3: When executing RNA-seq transcript quantification, the Kallisto algorithm bypasses
base-to-base alignment. Based on the principles of pseudoalignment, what is the PRIMARY
mechanism used to assign a read to an equivalence class? A) Determining the optimal
Needleman-Wunsch traceback against the reference genome. B) Hashing read k-mers and
intersecting their target transcript sets via a Transcriptome de Bruijn Graph (T-DBG). C)
Calculating the exact likelihood of transcript origin using a Hidden Markov Model. D) Aligning
read pairs using a Hierarchical Graph FM-index.
● Answer: B (Hashing read k-mers and intersecting their target transcript sets via a
Transcriptome de Bruijn Graph (T-DBG))
● Distractor Analysis:
○ A is incorrect: Kallisto specifically avoids dynamic programming alignments to
maximize speed.
○ C is incorrect: While Expectation-Maximization (EM) resolves abundances later, the
initial assignment relies on k-mer intersection, not HMMs.
○ D is incorrect: Hierarchical Graph FM-indices are used by HISAT2 for spliced
coordinate alignments, not Kallisto.
The Mentor's Analysis: Pseudoalignment identifies which transcripts a read is compatible with,
not how it physically aligns to the coordinates. When facing massive RNA-seq datasets, the
immediate priority is dimensionality reduction and computational speed. By utilizing k-mer
intersections on a T-DBG, you bypass the common trap of computationally expensive base-level
alignment, allowing downstream Expectation-Maximization to rapidly estimate abundances.
Professional Intuition: Equivalence classes group reads by transcript compatibility,
enabling ultra-fast EM quantification without BAM file generation.
Q4: In metagenomic binning, a researcher utilizes CheckM to assess the quality of a newly
assembled Metagenome-Assembled Genome (MAG). The tool reports 98% completeness and
45% contamination. Which biological feature is CheckM evaluating to derive these specific
metrics? A) The N50 contig length relative to reference genomes. B) The presence and
redundancy of lineage-specific, ubiquitous single-copy marker genes. C) The ratio of 16S rRNA
fragments to total genomic DNA. D) The depth of read coverage mapped across the assembly
graph.
● Answer: B (The presence and redundancy of lineage-specific, ubiquitous single-copy
marker genes)
● Distractor Analysis:
○ A is incorrect: N50 measures physical contiguity, not biological completeness or
contamination.
○ C is incorrect: 16S rRNA is highly conserved but often fails to assemble correctly in
MAGs; CheckM uses broader translated marker sets.
○ D is incorrect: Coverage depth guides the upstream binning process, but CheckM's
Biology & Bioinformatics
Test Bank | Elite
Questions (scRNA-seq,
MD, Genomics, Machine
Learning)
Table of Contents
Section Cognitive Tier Focus Area
PART I The Preview Critical Axioms & Core
Methodology
PART II Tier 1: Foundational Syntax Algorithms, Thermodynamics,
(Q1–18) Core Syntax
PART II Tier 2: Complex Application Transcriptomics, Simulation,
(Q19–37) Kinetics
PART II Tier 3: Grandmaster Multi-Omics, Pangenomics,
Synthesis (Q38–55) Neural Architectures
PART I: The Preview
Mastering this test bank translates directly to elite computational competence, bridging
theoretical biophysics with applied machine learning and genomic architectures. Precision in
these domains separates technicians from chief architects of biological discovery.
Core Axiom Theoretical Basis Algorithmic Execution
The Velocity Axiom Transcriptional kinetics can be Projection onto non-linear
inferred from spliced vs. manifolds inherently distorts
unspliced mRNA ratios. vector fields.
The Alignment Axiom The Burrows-Wheeler Hierarchical graph FM-indices
Transform (BWT) with extend this to spliced and
LF-mapping permits sub-linear pangenomic alignments.
search space reductions.
,Core Axiom Theoretical Basis Algorithmic Execution
The Equivariance Axiom 3D molecular conformation E(n)-Equivariant Graph Neural
prediction models must Networks (EGNNs) bypass
maintain spatial relationships coordinate-dependency traps.
under rotation/translation.
The Thermodynamic Axiom Jarzynski's equality maps Computations suffer from
non-equilibrium work exponential sensitivity to rare,
distributions to equilibrium free highly dissipative trajectories.
energy landscapes.
PART II: The Elite Test Bank
Q1: During global sequence alignment using the Needleman-Wunsch algorithm, a researcher
transitions from a linear gap penalty to an affine gap penalty model. Based on the principles of
dynamic programming, which algorithmic modification is the MOST CRITICAL to accurately
populate the matrix? A) Replacing the standard substitution matrix with a position-specific
scoring matrix (PSSM). B) Eliminating the initialization row and column to prevent negative
indexing. C) Tracking three separate matrices to decouple gap opening from gap extension
states. D) Restricting the traceback path to strictly diagonal movements.
● Answer: C (Tracking three separate matrices to decouple gap opening from gap extension
states)
● Distractor Analysis:
○ A is incorrect: While a PSSM alters match/mismatch scores, it does not manage the
distinct mathematical states required for affine gap penalties.
○ B is incorrect: Initialization is strictly required in global alignment to account for
leading gaps.
○ D is incorrect: Restricting diagonal movements disables the algorithm's ability to
model indels entirely.
The Mentor's Analysis: Affine gap penalties require the algorithm to "remember" if a gap is
already open, as the mathematical penalty shifts from the initiation cost to the extension cost.
When facing non-linear penalties, the immediate priority is tracking multiple computational
states simultaneously. By utilizing three coupled matrices (Match, Insert X, Insert Y), you bypass
the common trap of over-penalizing contiguous biological deletions. Professional Intuition:
Always separate the initiation cost from the extension cost algorithmically to preserve
long contiguous indels.
Q2: In estimating the statistical significance of a local sequence alignment, the BLAST algorithm
utilizes the Gumbel extreme value distribution. If the effective search space is doubled while the
scoring matrix remains constant, what is the MOST LOGICAL impact on the Karlin-Altschul
parameters and the resulting E-value? A) The \lambda parameter halves, exponentially
decreasing the E-value. B) The K parameter doubles, resulting in a proportionally lower E-value.
C) Both \lambda and K remain unchanged, but the E-value doubles. D) The E-value remains
constant because \lambda scales inversely with sequence length.
● Answer: C (Both \lambda and K remain unchanged, but the E-value doubles)
● Distractor Analysis:
○ A is incorrect: The scale parameter \lambda is defined exclusively by the scoring
matrix and background frequencies, not database size.
○ B is incorrect: K is a proportionality constant reflecting the search space geometry,
, not the database size itself.
○ D is incorrect: The E-value is directly proportional to the effective search space (E =
Kmn e^{-\lambda S}).
The Mentor's Analysis: Karlin-Altschul parameters are intrinsic to the scoring system and the
expected background nucleotide frequencies. When facing database expansions, the immediate
priority is adjusting the search space multiplier without altering the foundational statistical
matrices. By utilizing the linear relationship between space (m \times n) and E-value, you
bypass the common trap of misattributing significance loss to matrix parameters. Professional
Intuition: \lambda and K are matrix-specific constants; the E-value scales linearly with
database size.
Q3: When executing RNA-seq transcript quantification, the Kallisto algorithm bypasses
base-to-base alignment. Based on the principles of pseudoalignment, what is the PRIMARY
mechanism used to assign a read to an equivalence class? A) Determining the optimal
Needleman-Wunsch traceback against the reference genome. B) Hashing read k-mers and
intersecting their target transcript sets via a Transcriptome de Bruijn Graph (T-DBG). C)
Calculating the exact likelihood of transcript origin using a Hidden Markov Model. D) Aligning
read pairs using a Hierarchical Graph FM-index.
● Answer: B (Hashing read k-mers and intersecting their target transcript sets via a
Transcriptome de Bruijn Graph (T-DBG))
● Distractor Analysis:
○ A is incorrect: Kallisto specifically avoids dynamic programming alignments to
maximize speed.
○ C is incorrect: While Expectation-Maximization (EM) resolves abundances later, the
initial assignment relies on k-mer intersection, not HMMs.
○ D is incorrect: Hierarchical Graph FM-indices are used by HISAT2 for spliced
coordinate alignments, not Kallisto.
The Mentor's Analysis: Pseudoalignment identifies which transcripts a read is compatible with,
not how it physically aligns to the coordinates. When facing massive RNA-seq datasets, the
immediate priority is dimensionality reduction and computational speed. By utilizing k-mer
intersections on a T-DBG, you bypass the common trap of computationally expensive base-level
alignment, allowing downstream Expectation-Maximization to rapidly estimate abundances.
Professional Intuition: Equivalence classes group reads by transcript compatibility,
enabling ultra-fast EM quantification without BAM file generation.
Q4: In metagenomic binning, a researcher utilizes CheckM to assess the quality of a newly
assembled Metagenome-Assembled Genome (MAG). The tool reports 98% completeness and
45% contamination. Which biological feature is CheckM evaluating to derive these specific
metrics? A) The N50 contig length relative to reference genomes. B) The presence and
redundancy of lineage-specific, ubiquitous single-copy marker genes. C) The ratio of 16S rRNA
fragments to total genomic DNA. D) The depth of read coverage mapped across the assembly
graph.
● Answer: B (The presence and redundancy of lineage-specific, ubiquitous single-copy
marker genes)
● Distractor Analysis:
○ A is incorrect: N50 measures physical contiguity, not biological completeness or
contamination.
○ C is incorrect: 16S rRNA is highly conserved but often fails to assemble correctly in
MAGs; CheckM uses broader translated marker sets.
○ D is incorrect: Coverage depth guides the upstream binning process, but CheckM's
