โญ 10/10 Life Sciences Learning • B10logy = 10 out of 10 in Biology • High-Yield Visual Notes Across 23 Disciplines Explore Subjects →

Bioinformatics Laboratory Manual: Algorithms, Modeling & Omics Pipelines

๐Ÿ’ป Computational Biology • Bioinformatics Practical Manual

Bioinformatics & Computational Biology Laboratory Manual: Algorithms, Modeling & Omics Pipelines

Rigorous hands-on computational protocols in heuristic database search (NCBI BLASTn/BLASTp with Karlin-Altschul E-value statistics), progressive multiple sequence alignment and Shannon entropy logos (Clustal Omega • WebLogo), molecular phylogenetics and non-parametric bootstrap resampling (Neighbor-Joining • MEGA/PhyML), automated homology modeling and Ramachandran validation (SWISS-MODEL • PROCHECK), flexible molecular docking and binding free energy scoring (AutoDock Vina • PyMOL), and next-generation RNA-Seq differential expression modeling (Salmon • DESeq2) aligned with CSIR-NET Unit 13 and GATE curricula.

๐Ÿงฌ 6 Core Computational Protocolsโฑ๏ธ 48 Lab Hours๐Ÿ“Š Sequence Alignment • Phylogenetics • Docking • RNA-Seq๐Ÿ’ฌ 20-Question Viva-Voce Bank๐Ÿ“‹ Reproducible Bioinformatic SOPs • Conda / Docker / Git
Bioinformatic HygieneReproducibility & FAIR Standards

Computational Standards, Version Pinning & Reproducible Omics Workflows

NIH • EMBL-EBI Computational Best Practices

In silico bioinformatics workflows require the same rigorous experimental controls and documentation as wet-bench biological assays:

  • Conda & Docker Environment Versioning: Lock exact package versions in environment.yml files (e.g., Python, Biopython, BLAST+, AutoDock Vina, R/Bioconductor) to eliminate stochastic changes resulting from software updates.
  • Data Integrity & FASTA Checksums: Always record MD5 checksums for raw sequencing runs (FASTQ) and reference assemblies. Maintain read-only permissions for raw experimental sequencing data.
  • FAIR Data Principles: Ensure all digital assets are Findable, Accessible, Interoperable, and Reusable by depositing raw reads in NCBI SRA/ENA and reproducible R/Python analysis scripts in public version-controlled repositories (GitHub/Zenodo).
  • Random Seed Pinning: When running stochastic algorithms (e.g., Markov Chain Monte Carlo phylogenetic searches, non-parametric bootstrapping, or genetic algorithm docking poses), explicitly fix random number generator seeds (set.seed(42)) to ensure exact computational reproducibility.
Experiment 01Sequence SearchHeuristic Algorithms

Pairwise & Database Heuristic Sequence Search: NCBI BLAST (BLASTn, BLASTp), Bit Score Normalization & Karlin-Altschul E-Value Statistics

Duration: 4 Hours • Command-Line & Web BLAST
๐ŸŽฏ Experimental Aim & Learning Objectives
To perform local sequence similarity searches of unknown protein and nucleotide queries against NCBI reference databases using BLASTp and BLASTn; understand the 3-phase seed-extend heuristic algorithm; calibrate substitution matrices (BLOSUM62 vs PAM250); and mathematically evaluate statistical significance via raw alignment score ($S$), normalized bit score ($S’$), and the Karlin-Altschul Expectation value ($E$).
๐Ÿ”ฌ Theoretical Foundation & Statistical Equations

Exact dynamic programming algorithms (Smith-Waterman) are computationally prohibitive ($O(m times n)$) for querying massive genomic databases ($>10^{11}$ letters). The Basic Local Alignment Search Tool (BLAST) achieves orders-of-magnitude acceleration using a heuristic 3-phase strategy:

  • Phase 1 (Seeding / Word Generation): The query sequence is broken into sliding words of length $W$ ($W=3$ amino acids for BLASTp, $W=11$ nucleotides for BLASTn). A neighborhood of similar words scoring $ge T$ when compared with the BLOSUM62 matrix is pre-computed.
  • Phase 2 (Scanning & Two-Hit Triggering): The database is scanned for exact matches to the neighborhood words. Under the Two-Hit method, an extension is triggered only if two non-overlapping words occur on the same diagonal within window distance $A$.
  • Phase 3 (Gapped Extension): The seed is extended bidirectionally without gaps, and then with a restricted dynamic programming band allowing insertions/deletions until the score drops by more than $X$ below the running maximum.
  • Karlin-Altschul Statistical Model: The Expectation value ($E$) represents the number of distinct alignments with score $ge S$ expected to occur by chance alone in a random database search:
    $$E = K cdot m cdot n cdot e^{-lambda S}$$
    where $m$ is effective query length, $n$ is effective database size, and $K$ and $lambda$ are Karlin-Altschul extreme value distribution (Gumbel) scaling parameters.
  • Normalized Bit Score ($S’$): Converts raw score $S$ into an information-theoretic metric independent of scoring matrix or database scale:
    $$S’ = frac{lambda S – ln(K)}{ln(2)} implies E = m cdot n cdot 2^{-S’}$$
    A doubling of the database size requires an increase of 1 bit in $S’$ to maintain the same $E$-value threshold.
HEURISTIC SEQUENCE ALIGNMENT: NCBI BLAST & KARLIN-ALTSCHUL STATISTICSBLAST Heuristic Alignment Pipeline (Seed & Extend)Phase 1: Word Generation (K-mers, W=3 for aa, W=11 for nt)Query: P E P T I D E → Words: PEP, EPT, PTI, TID, IDENeighborhood words matching BLOSUM62 score ≥ Threshold TPhase 2: High-Scoring Segment Pair (HSP) SeedingTwo-hit trigger within window APhase 3: Bidirectional Gapped Dynamic Programming• Extend in both directions• Terminate when score falls > X below maxFinal HSP: Optimal Local AlignmentKARLIN-ALTSCHUL STATISTICAL SIGNIFICANCE1. Expectation Value (E-value):E = K × m × n × e^(−λ × S)m = query length | n = database size | K, λ = Karlin-Altschul parameters2. Normalized Bit Score (S’):S’ = [ (λ × S) − ln(K) ] / ln(2)Independent of scoring matrix and database scale3. E-value Interpretation Thresholds:• E < 10⁻⁵: Extremely significant homology; true evolutionary orthology• 10⁻⁵ ≤ E ≤ 10⁻²: Putative homology; inspect domain architectures• E > 10⁻²: Statistically indistinguishable from random noise

Figure 1.1: NCBI BLAST 3-phase seed-and-extend heuristic search architecture and Karlin-Altschul extreme value distribution statistics for raw alignment score ($S$), normalized bit score ($S’$), and expect value ($E$).
๐Ÿงช Computational Tools & Data Sets
  • Platforms: NCBI Web BLAST Server (blast.ncbi.nlm.nih.gov) and Local NCBI BLAST+ command-line suite (blastp, blastn, makeblastdb version 2.14+).
  • Databases: RefSeq non-redundant protein database (nr), Swiss-Prot/UniProtKB, and PDB sequence database.
  • Query Test Case: Unknown human hemoglobin subunit beta FASTA sequence (P68871) harboring the sickle-cell Glu6Val substitution.
๐Ÿ“‹ Step-by-Step Computational Protocol
  1. FASTA Acquisition: Retrieve the uncharacterized test FASTA sequence. Validate file formatting (single header line starting with >, standard IUPAC single-letter amino acid code).
  2. BLASTp Configuration: Open BLASTp. Select Database: UniProtKB/Swiss-Prot (curated gold-standard). Set Algorithm parameters: Matrix = BLOSUM62, Gap Costs = Existence: 11, Extension: 1, Word size = 6, Expect threshold = 0.05.
  3. Search Execution: Submit query. Inspect the Graphical Distribution of Hits, Hit Table, and pairwise High-Scoring Segment Pair (HSP) alignments.
  4. Matrix Sensitivity Comparison: Re-run the same query using BLOSUM45 (sensitive for distantly related homologs) and PAM30 (strict for close orthologs). Observe how bit scores and identity percentages shift.
  5. Command-Line Execution: Run equivalent search in bash:

    blastp -query query.fasta -db swissprot -out results.tsv -outfmt "6 qseqid sseqid pident length mismatch gapopen qstart qend sstart send evalue bitscore" -evalue 1e-5
๐Ÿ“Š Representative Output & Statistical Evaluation
Subject AccessionDescriptionQuery CoverIdentityRaw Score ($S$)Bit Score ($S’$)$E$-Value
P68871.2Hemoglobin subunit beta [Homo sapiens]100%99.3%774301 bits$4.0 times 10^{-105}$
P02088.2Hemoglobin subunit beta-1 [Mus musculus]100%84.4%642251 bits$1.2 times 10^{-85}$
P69905.2Hemoglobin subunit alpha [Homo sapiens]96%44.1% (Paralog)310124 bits$6.8 times 10^{-35}$

Biological Conclusion: The query is definitively identified as human hemoglobin beta chain with extreme statistical confidence ($E ll 10^{-100}$). The alpha subunit match demonstrates ancient gene duplication paralogy with significant sequence divergence.

Experiment 02Multiple AlignmentInformation Theory

Multiple Sequence Alignment (MSA) & Conservation Profiling: Clustal Omega / MUSCLE & Shannon Entropy WebLogo

Duration: 4 Hours • Bench In Silico Protocol
๐ŸŽฏ Experimental Aim & Learning Objectives
To generate multiple sequence alignments across orthologous and paralogous protein families using Clustal Omega and MUSCLE; evaluate progressive alignment guide tree topologies; identify catalytic triads and invariant active site motifs; and generate information-theoretic WebLogo representations based on Shannon entropy bits ($R_{text{seq}}$).
๐Ÿ”ฌ Theoretical Foundation & Algorithmic Principles

Multiple sequence alignment (MSA) reveals evolutionary conservation, catalytic residues, and functional motifs across diverged lineages:

  • Progressive Alignment Algorithm: Pairwise distances between all sequence pairs are calculated to build a distance matrix. A guide tree is constructed using Neighbor-Joining or UPGMA. Alignments are built progressively from the closest sister taxa outward to distant nodes using profile-profile alignments.
  • Clustal Omega Innovations: Uses mBed-like embedding algorithms ($O(N log N)$ complexity) to cluster thousands of sequences rapidly and uses profile Hidden Markov Models (HMMs) from HHalign for superior alignment quality.
  • Shannon Entropy & Information Content: In WebLogo, the height of a stack of letters at position $i$ represents the sequence conservation measured in bits:
    $$R_{text{seq}}(i) = S_{max} – H(i) – e_n$$
    where $S_{max} = log_2(20) approx 4.32text{ bits}$ for proteins (or $2.0text{ bits}$ for DNA/RNA), $e_n$ is a small-sample correction, and $H(i)$ is the Shannon entropy:
    $$H(i) = – sum_{a=1}^{20} p_a log_2(p_a)$$
    An invariant residue (e.g., catalytic Aspartate $p=1.0$) yields $H = 0$, producing a maximum stack height of $sim 4.32text{ bits}$.
MULTIPLE SEQUENCE ALIGNMENT (MSA) & INFORMATION-THEORETIC CONSERVATION LOGOPROGRESSIVE CLUSTAL OMEGA MSA • KINASE CATALYTIC LOOP (HRD MOTIF)H_sapiens_PKAY R D L K P E N L L I D Q Q G Y I Q V T D F G F A K RM_musculus_PKAY R D L K P E N L L I D Q Q G Y I Q V T D F G F A K RD_melanogasterY R D L K P E N L L I D H N G N I K I T D F G F A K KC_elegans_PKAF R D L K P E N L L I D Q Q G Y L K I T D F G F A K QS_cerevisiae_TPKY R D L K P E N L L L D R D G H I K I T D F G F A K RConsensus (*:.). * * * * * * * * * * * : . * : : * * * * * * * .Shannon Entropy Sequence Logo (R_seq = 4.32 – H_i bits)Bits →4.32.00.0Rpos 2Dpos 3Lpos 4Kpos 5DD184FF185GG186Residue Chemistry Color Code:• Red: Acidic (D, E)• Blue: Basic (K, R, H)• Green: Aliphatic (L, I, V)• Cyan: Aromatic (F, Y, W)• Orange: Neutral / Small (G, P)

Figure 1.2: Clustal Omega multiple sequence alignment of eukaryotic protein kinase catalytic cores and corresponding WebLogo information-theoretic conservation stack ($R_{seq} = 4.32 – H_i$ bits).
๐Ÿงช Computational Tools & Data Sets
  • Alignment Suites: EMBL-EBI Clustal Omega (ebi.ac.uk/Tools/msa/clustalo), MUSCLE 5.1, and Jalview/UGENE alignment viewers.
  • Logo Generator: WebLogo 3.7.12 (weblogo.threeplusone.com).
  • Benchmark Dataset: Serine/threonine protein kinase catalytic core sequences across eukaryotes (PKA catalytic subunits: Human, Mouse, Drosophila, C. elegans, S. cerevisiae).
๐Ÿ“‹ Step-by-Step Computational Protocol
  1. Multi-FASTA Preparation: Compile 10-15 homologous protein kinase sequences into a single kinases.fasta file. Ensure no non-standard characters exist.
  2. Clustal Omega Alignment: Submit sequences to Clustal Omega. Select Output Format: Clustalw with character counts. Under Options, set Guide Tree iterations to 2.
  3. Visualization in Jalview: Open the aligned FASTA in Jalview. Color by Clustalx or Zappo residue chemistry. Apply conservation shading threshold ($ge 70%$).
  4. Motif Identification: Locate the conserved catalytic loop containing the HRD motif ($H-R-D-L-K-x-x-N$) and the activation loop DFG triad ($D-F-G$). Note absolute conservation of catalytic Asp (D).
  5. WebLogo Generation: Upload the aligned block to WebLogo. Configure: Units = Bits, Error bars = True, Color scheme = Chemistry. Export high-resolution SVG/PNG logo.
๐Ÿ“Š Representative Alignment & Conservation Output

Consensus Motif:Y-R-D-L-K-P-E-N-L-L-I-D-x-x-G-x-x-K-I-T-D-F-G-F-A-K-R
Shannon Information Stack Heights:
• Residue 3 (Catalytic Aspartate, D): $4.32text{ bits}$ (100% Invariant, proton acceptor for substrate -OH attack).

• Residue 5 (Lysine, K): $4.25text{ bits}$ (Neutralizes phosphate charge on transition state).

• Residue 21 (DFG Aspartate, D): $4.32text{ bits}$ (Coordinates catalytic divalent cation $Mg^{2+}$).

• Variable loop positions: $0.2 – 0.8text{ bits}$ (Permits divergent kinase substrate specificities).

Experiment 03PhylogeneticsTree Inference

Molecular Phylogenetics & Tree Reconstruction: Neighbor-Joining, Maximum Likelihood & Bootstrap Resampling

Duration: 4 Hours • Computational Evolution Lab
๐ŸŽฏ Experimental Aim & Learning Objectives
To construct distance-based (Neighbor-Joining) and character-based (Maximum Likelihood) phylogenetic trees from orthologous molecular sequences; select optimal nucleotide/amino acid substitution models using Bayesian Information Criterion (BIC); apply outgroup rooting; and test branch reliability using Felsenstein non-parametric bootstrap resampling ($N = 1000$ replicates).
๐Ÿ”ฌ Theoretical Foundation & Algorithmic Principles

Molecular phylogenetics reconstructs the evolutionary genealogical histories of species and gene families:

  • Evolutionary Substitution Models: Observed pairwise distance must be corrected for multiple substitutions at the same site (saturation). The Kimura 2-Parameter (K2P) model distinguishes transitions ($A leftrightarrow G, C leftrightarrow T$) from transversions ($A/G leftrightarrow C/T$). For protein sequences, the JTT, WAG, or LG substitution models with gamma-distributed rate variation across sites ($+Gamma$) are standard.
  • Saitou-Nei Neighbor-Joining (NJ) Algorithm: A bottom-up star-decomposition clustering method. It calculates the $Q$-matrix from pairwise distances:
    $$Q(i, j) = (n – 2) cdot d(i, j) – sum_{k=1}^n d(i, k) – sum_{k=1}^n d(j, k)$$
    The pair $(i, j)$ with the minimum $Q$-value is merged into a new composite node, and branch lengths from the node are computed. NJ produces an unrooted additive tree where branch lengths correspond to evolutionary change.
  • Felsenstein Bootstrap Resampling: Tests clade statistical robustness. The alignment columns (sites) are resampled with replacement to create 1000 pseudo-alignments. A tree is built for each. The percentage of trees supporting each bipartition is the bootstrap proportion:
    $$text{Support} ge 70% implies text{Moderately supported}; quad ge 95% implies text{Statistically robust}.$$
MOLECULAR PHYLOGENETICS: NEIGHBOR-JOINING & FELSENSTEIN BOOTSTRAP RESAMPLINGDistance Matrix & Saitou-Nei Q-Matrix Criterion

TaxaHumanChimpGorillaGibbonHuman0.0000.0160.0350.082Chimp0.0160.0000.0380.084Gorilla0.0350.0380.0000.089Gibbon0.0820.0840.0890.000

Q(i, j) = (n – 2) × d(i, j) − R_i − R_jSelect pair (i, j) that minimizes Q → Form composite node uFelsenstein Non-Parametric Bootstrapping (1000 Reps):• Resample alignment columns with replacement• Calculate clade replication proportion: ≥ 70% supported, ≥ 95% robustResolved Neighbor-Joining Tree (Phylogram Topology)Gibbon (Outgroup)100%Gorilla gorilla98%Homo sapiens (Human)Pan troglodytes (Chimp)0.02 substitutions/site

Figure 1.3: Evolutionary distance matrix reduction via the Saitou-Nei Neighbor-Joining (NJ) clustering algorithm, yielding a resolved phylogram with Felsenstein bootstrap support percentages.
๐Ÿงช Computational Tools & Data Sets
  • Software: MEGA 11 (Molecular Evolutionary Genetics Analysis), PhyML 3.3, IQ-TREE 2 (ultrafast bootstrap), and FigTree/iTOL tree visualizers.
  • Sequence Dataset: Primate mitochondrial Cytochrome b (Cytb) gene sequences: Human (Homo sapiens), Chimpanzee (Pan troglodytes), Gorilla (Gorilla gorilla), Orangutan (Pongo abelii), and Gibbon (Hylobates lar, designated outgroup).
๐Ÿ“‹ Step-by-Step Computational Protocol
  1. Sequence Import & Model Selection: Open MEGA 11. Load aligned Cytb FASTA. Select Models → Find Best DNA/Protein Models (ML). Identify the model with lowest BIC (e.g., Kimura 2-Parameter + Gamma, $K2P + G$).
  2. Distance Matrix Computation: Compute Pairwise Distance matrix under the K2P model with Gamma parameter $alpha = 0.5$. Note shortest evolutionary distance between Human and Chimpanzee ($d approx 0.016$).
  3. Neighbor-Joining Tree Construction: Click Phylogeny → Construct/Test Neighbor-Joining Tree. Set Test of Phylogeny: Bootstrap method, No. of Replications = 1000. Model: K2P + G.
  4. Outgroup Rooting & Display: In the Tree Explorer, select the Gibbon branch and click Re-root Tree. Toggle between Cladogram and Phylogram (where branch lengths represent substitutions per site).
  5. Maximum Likelihood Validation: Construct a comparative Maximum Likelihood tree using IQ-TREE with 1000 ultrafast bootstrap replicates:

    iqtree2 -s primate_cytb.fasta -m MFP -B 1000 -T AUTO
๐Ÿ“Š Representative Phylogenetic Topology & Clade Support

Newick Tree Format:
((((Homo_sapiens:0.015, Pan_troglodytes:0.018)98:0.012, Gorilla_gorilla:0.022)100:0.035, Pongo_abelii:0.058)100:0.024, Hylobates_lar:0.082);
Clade Confidence Assessment:
• Hominini Node (Human + Chimpanzee sister relationship): 98% Bootstrap Support. Confirms closest evolutionary lineage divergence.

• Homininae Node ((Human + Chimpanzee) + Gorilla): 100% Bootstrap Support.

• Root divergence to Gibbon outgroup: Total branch length = $0.082$ substitutions per site.

Experiment 04Structural BioinformaticsHomology Modeling

Comparative Protein Structure Homology Modeling & Stereochemical Validation: SWISS-MODEL & Ramachandran / ERRAT Evaluation

Duration: 5 Hours • 3D In Silico Modeling
๐ŸŽฏ Experimental Aim & Learning Objectives
To build a high-resolution 3D tertiary structure model of an uncharacterized target protein using automated comparative homology modeling (SWISS-MODEL / MODELLER); perform template search, target-template sequence alignment, loop building, and energy minimization; and evaluate stereochemical quality using PROCHECK Ramachandran dihedral plots ($Phi, Psi$), QMEANDisCo, and ERRAT non-bonded interaction scores.
๐Ÿ”ฌ Theoretical Foundation & Structural Principles

Protein tertiary structure is more conserved during evolution than primary sequence. Homology modeling relies on the observation that sequences with $>30%$ identity share identical global backbone folds:

  • The ‘Twilight Zone’ of Sequence Identity: Above 30% sequence identity, homology modeling yields reliable atomic models ($C_alpha text{ RMSD} < 2text{ AA}$). Between 20-30% lies the twilight zone where threading/fold recognition is needed. Below 20% is the midnight zone requiring deep-learning ab initio methods (AlphaFold2 / ESMFold).
  • Modeling Stages:
    1. Template Identification: Searching the Protein Data Bank (PDB) via BLASTp/HHblits.

    2. Alignment & Backbone Threading: Superimposing structurally conserved regions (SCRs).

    3. Loop Modeling & Side-Chain Rotamer Placement: Building insertions/deletions via fragment databases and packing side chains using rotamer libraries.

    4. Molecular Mechanics Minimization: Removing steric clashes using force fields (e.g., CHARMM27/GROMOS).
  • Stereochemical Validation Metrics:
    • Ramachandran Dihedral Angles ($Phi, Psi$): A high-quality model requires $ge 90%$ of non-glycine/proline residues in most favored regions and $< 2%$ in disallowed regions.
    • QMEANDisCo Global Score: A composite scoring function (values $0.0 – 1.0$) evaluating torsion angles, solvation, and distance constraints; scores $> 0.70$ denote reliable models.

    • ERRAT Overall Quality Factor: Analyzes statistics of non-bonded atomic interactions ($C-C, C-N, C-O, N-O$). Scores $> 90%$ reflect crystallography-grade geometry.
PROTEIN HOMOLOGY MODELING (SWISS-MODEL) & RAMACHANDRAN VALIDATIONSWISS-MODEL Automated Homology Pipeline1. BLAST/HHblits Search of PDB:Threshold: >30% Sequence Identity (Twilight Zone <25%)2. Alignment & Core Backbone Threading:Map target coordinates onto structurally conserved regions (SCRs)3. Loop Building & Rotamer Library Placement:Ab initio/database loop closure + SCWRL side-chain rotamers4. Molecular Mechanics Energy Minimization:Resolve steric clashes with CHARMM/GROMOS force fieldQMEANDisCo Global Score > 0.70 • Cβ RMSD < 2.0 ÅPROCHECK / MolProbity Ramachandran Plot (Φ, Ψ)β-Sheetα-HelixL-αΦ (Phi) Angle (-180° to +180°) →Ψ (Psi) →Validation:• Favored:92.4% (>90%)• Allowed:6.8%• Outliers:0.8% (<2%)• ERRAT:94.2 ScorePASSED

Figure 1.4: SWISS-MODEL comparative homology modeling pipeline and PROCHECK stereochemical dihedral angle ($Phi, Psi$) Ramachandran validation plot.
๐Ÿงช Computational Tools & Data Sets
  • Servers & Software: SWISS-MODEL Automated Server (swissmodel.expasy.org), PyMOL Molecular Graphics System, and PROCHECK / MolProbity / ERRAT validation suites.
  • Target Case Study: Novel plant chitinase target sequence from Arabidopsis thaliana lacking an experimental crystallographic PDB entry.
๐Ÿ“‹ Step-by-Step Computational Protocol
  1. Target Sequence Submission: Paste target amino acid sequence into SWISS-MODEL workspace. Click Search For Templates.
  2. Template Selection: Review candidate templates. Select template with highest sequence identity ($>50%$), high crystallographic resolution ($< 2.0text{ AA}$), and complete coverage (e.g., PDB ID: 2A3E, resolution $1.75text{ AA}$, sequence identity $68.4%$).
  3. Model Building: Run Build Model. The server generates the 3D atomic coordinate PDB file, threading the backbone and predicting side-chain conformations.
  4. Model Download & Visual Superposition: Download model.pdb. Open in PyMOL alongside the template PDB. Execute align model, 2A3E. Calculate backbone Root Mean Square Deviation (RMSD).
  5. PROCHECK Validation: Upload model.pdb to the PROCHECK / MolProbity server. Inspect the Ramachandran plot and note percentages of residues in core, allowed, generously allowed, and disallowed quadrants.
๐Ÿ“Š Representative Structural Validation Results
Validation MetricTarget Model ScoreAcceptance StandardStatus
Ramachandran Favored Regions92.4% (218 residues)≥ 90.0%PASSED
Ramachandran Additional Allowed6.8% (16 residues)≤ 10.0%PASSED
Ramachandran Disallowed Outliers0.8% (2 loop residues)≤ 2.0%PASSED
QMEANDisCo Global Score0.78 ± 0.05≥ 0.70PASSED
Backbone RMSD to Template (2A3E)0.84 Å (over 230 Cα)≤ 2.0 ÅPASSED
ERRAT Overall Quality Factor94.2%≥ 90.0%PASSED

Stereochemical Conclusion: The generated model displays crystallographic-grade geometry suitable for downstream structure-based virtual screening and molecular docking.

Experiment 05Molecular DockingDrug Discovery

In Silico Molecular Docking & Binding Affinity Profiling: AutoDock Vina Grid Search & Binding Free Energy ($Delta G$)

Duration: 5 Hours • Computational Drug Design Lab
๐ŸŽฏ Experimental Aim & Learning Objectives
To prepare macromolecular receptor targets and small-molecule ligand files; define 3D active site affinity search grid boxes; execute flexible-ligand semi-flexible receptor docking simulations using AutoDock Vina; cluster conformational binding poses; and calculate binding free energies ($Delta G_{text{bind}}$), dissociation constants ($K_d$), and intermolecular non-bonded interaction networks.
๐Ÿ”ฌ Theoretical Foundation & Thermodynamic Principles

Molecular docking predicts the preferred orientation (pose) and binding affinity of a small molecule drug candidate within an enzyme’s binding pocket:

  • AutoDock Vina Scoring Function: Evaluates the empirical binding free energy ($Delta G_{text{bind}}$) using an optimized scoring function:
    $$Delta G_{text{bind}} = Delta G_{text{vdW}} + Delta G_{text{hbond}} + Delta G_{text{electrostatic}} + Delta G_{text{desolvation}} + Delta G_{text{torsional}}$$
    Vina combines a machine-learning-inspired scoring function with an iterated local search (Broyden-Fletcher-Goldfarb-Shanno, BFGS) optimization algorithm.
  • Thermodynamic Relation to Affinity: Binding free energy is directly proportional to the thermodynamic equilibrium association constant ($K_a$) and dissociation constant ($K_d$):
    $$Delta G = – R cdot T cdot ln(K_a) = R cdot T cdot ln(K_d)$$
    At $T = 298.15text{ K}$, a more negative $Delta G$ signifies tighter binding. Every $-1.36text{ kcal/mol}$ change in $Delta G$ corresponds to a 10-fold increase in binding affinity ($K_d$).
  • Preparation Steps:
    • Receptor: Remove crystallographic waters, add polar hydrogens, assign Kollman/Gasteiger partial charges, save as PDBQT format.

    • Ligand: Define rotatable bonds, detect root, assign partial charges, save as PDBQT format.
IN SILICO MOLECULAR DOCKING: AUTODOCK VINA & BINDING FREE ENERGY (ΔG)Receptor Active Site & 3D Affinity Grid BoxReceptor Catalytic Binding Pocket (PDB ID: 1IEP)Grid Box: 20 × 20 × 20 ÅH-Bond (Thr315)H-Bond (Glu286)AUTODOCK VINA EMPIRICAL SCORING FUNCTION1. Binding Free Energy (ΔG_bind):ΔG = ΔG_vdw + ΔG_hbond + ΔG_elect + ΔG_desolv + ΔG_torsExpressed in kcal/mol (More negative ΔG = higher affinity)2. Thermodynamic Relation to Dissociation Constant (K_d):ΔG = − R × T × ln(K_a) = R × T × ln(K_d)3. AutoDock Vina Conformation Pose Cluster Table:

ModeAffinity (kcal/mol)RMSD l.b. (Å)RMSD u.b. (Å)1−9.8 kcal/mol0.000 (Top Pose)0.0002−9.3 kcal/mol1.4252.1183−8.7 kcal/mol2.1103.450

Figure 1.5: AutoDock Vina receptor 3D affinity grid box setup, intermolecular hydrogen-bonding contacts, and binding free energy ($Delta G_{ ext{bind}}$) pose ranking table.
๐Ÿงช Computational Tools & Structural Data
  • Software: AutoDock Vina 1.2+, AutoDockTools (ADT / MGLTools), Open Babel, and PyMOL / Discovery Studio Visualizer.
  • Benchmark Target-Ligand System: Human Abl Kinase (PDB ID: 1IEP) and the anti-leukemia small molecule inhibitor Imatinib (Gleevec).
๐Ÿ“‹ Step-by-Step Computational Protocol
  1. Receptor Preparation: Download 1IEP.pdb. In PyMOL, strip crystallographic water molecules, co-crystallized buffers, and alternative conformations: remove solvent. In ADT, add polar hydrogens and assign Kollman charges. Export as receptor.pdbqt.
  2. Ligand Preparation: Acquire 3D SDF structure of Imatinib from PubChem. Convert to PDBQT using Open Babel: obabel imatinib.sdf -O ligand.pdbqt --gen3d -p 7.4. Check that all rotatable single bonds are parameterized.
  3. Grid Box Definition: Center the 3D affinity box on the ATP-binding pocket (coordinates around co-crystallized ligand):

    center_x = 10.5, center_y = 18.2, center_z = 56.4; size_x = 22, size_y = 22, size_z = 22 Å. Save in vina_config.txt with exhaustiveness = 16.
  4. Vina Execution: Run simulation:

    vina --receptor receptor.pdbqt --ligand ligand.pdbqt --config vina_config.txt --out docked_poses.pdbqt --log docking.log
  5. Pose Analysis & Hydrogen Bond Profiling: Load top pose (Mode 1) and receptor in PyMOL. Identify hydrogen bonds ($< 3.2text{ AA}$) and hydrophobic interactions with pocket gatekeeper residues (Thr315, Glu286, Asp381).
๐Ÿ“Š Representative Docking Affinity & Interaction Data
Conformation Mode$Delta G_{text{bind}}$ (kcal/mol)Predicted $K_d$RMSD lower bound ($text{AA}$)Key Interacting Residues
Mode 1 (Top Pose)−11.2 kcal/mol$6.1 text{ nM}$0.000H-bonds: Glu286 (2.1 Å), Asp381 (2.4 Å), Thr315 (2.8 Å)
Mode 2−10.5 kcal/mol$20.1 text{ nM}$1.284H-bonds: Glu286, Met318 backbone
Mode 3−9.8 kcal/mol$65.8 text{ nM}$2.140Hydrophobic contact with Phe382 of DFG

Pharmacological Assessment: Mode 1 exhibits high sub-nanomolar affinity ($Delta G = -11.2text{ kcal/mol}$), accurately reproducing the crystallographic binding mode of Imatinib within the inactive DFG-out conformation of Abl kinase.

Experiment 06TranscriptomicsDifferential Expression

Next-Generation RNA-Seq Differential Expression Analysis: Quality Trimming (FastQC), Pseudoalignment & DESeq2 Volcano Plot Modeling

Duration: 6 Hours • Command-Line & R Bioconductor Pipeline
๐ŸŽฏ Experimental Aim & Learning Objectives
To evaluate raw Illumina RNA-Seq FASTQ read quality using FastQC and Trimmomatic; quantify transcript abundance without full alignment using Salmon/Kallisto pseudoalignment; model count data dispersion in R using DESeq2 negative binomial generalized linear models; normalize for library depth via median-of-ratios; apply the Benjamini-Hochberg false discovery rate (FDR) adjustment; and visualize differential expression via interactive volcano plots and heatmaps.
๐Ÿ”ฌ Theoretical Foundation & Statistical Models

RNA-Seq provides quantitative counts of transcript abundance across biological conditions. Due to biological variability across replicates, count data exhibits overdispersion ($text{Variance} > text{Mean}$), violating Poisson assumptions:

  • Phred Quality Score ($Q$): Logarithmic measure of base-calling error probability:
    $$Q = -10 log_{10}(P_{text{error}}) implies Q30 equiv 99.9% text{ base accuracy (1 in 1000 error)}.$$
  • Transcript Pseudoalignment (Salmon / Kallisto): Matches reads directly to transcript De Bruijn graph target k-mers, skipping full base-by-base dynamic programming alignment. Outputs estimated counts and Transcripts Per Million (TPM):
    $$text{TPM}_i = frac{frac{C_i}{L_i}}{sum_j frac{C_j}{L_j}} times 10^6$$
  • DESeq2 Negative Binomial GLM: The raw read count $K_{ij}$ for gene $i$ in sample $j$ is modeled as:
    $$K_{ij} sim text{NB}(mu_{ij}, alpha_i), quad operatorname{Var}(K_{ij}) = mu_{ij} + alpha_i mu_{ij}^2$$
    where $alpha_i$ is the gene-specific dispersion parameter.
  • Size Factor Normalization (Median-of-Ratios): Corrects for sequencing depth and library composition:
    $$hat{s}_j = operatorname{median}_{i} frac{K_{ij}}{left(prod_{v=1}^m K_{iv}right)^{1/m}}$$
  • Wald Test with FDR Correction: Tests hypotheses: $H_0: log_2text{FC} = 0$. $P$-values are adjusted using the Benjamini-Hochberg procedure to control False Discovery Rate ($p_{text{adj}} < 0.05$).
RNA-SEQ PIPELINE: PSEUDOALIGNMENT & DESEQ2 VOLCANO PLOT SIGNIFICANCEStandard RNA-Seq Data Processing PipelineStep 1: Read QC & Trimming (FastQC / Trimmomatic)Phred Quality Score: Q = −10 × log₁₀(P_error)Q ≥ 30 (99.9% base call accuracy) • Filter adaptorsStep 2: Transcript Quantification (Kallisto / Salmon)De Bruijn graph pseudoalignment → TPM / FPKM / Raw CountsUltrafast k-mer exact matching without SAM/BAM generationStep 3: Differential Expression Modeling (DESeq2)• Negative Binomial GLM: K_ij ~ NB(mean=μ_ij, dispersion=α_i)• Median-of-Ratios Size Factor normalization for sequencing depth• Empirical Bayes shrinkage of dispersion parametersWald Test with Benjamini-Hochberg FDR Correction (p_adj < 0.05)DESeq2 Volcano Plot (Differential Expression)p_adj < 0.05Down (n=412)Up (n=685)log₂ Fold Change (log₂FC) →−log₁₀(p_adj) →

Figure 1.6: Complete RNA-Seq computational pipeline from FastQC quality assessment through Salmon/Kallisto pseudoalignment to DESeq2 negative binomial dispersion modeling and volcano plot visualization.
๐Ÿงช Computational Tools & Libraries
  • Command-Line Tools: FastQC 0.12, Trimmomatic 0.39, Salmon 1.10 (pseudoaligner).
  • R Bioconductor Stack: R 4.3+, DESeq2, tximport, EnhancedVolcano, pheatmap, ggplot2.
  • Benchmark RNA-Seq Dataset: Paired-end Illumina FASTQ reads from human lung epithelial cells: Control ($n=3$) vs TGF-$beta$ treated ($n=3$, epithelial-mesenchymal transition model).
๐Ÿ“‹ Step-by-Step Bioinformatic Protocol
  1. Read Quality Inspection: Run FastQC on all FASTQ files: fastqc sample_*.fastq.gz -o fastqc_out/. Inspect per-base sequence quality curves, adapter contamination, and GC content.
  2. Transcript Quantification with Salmon: Generate target transcript index:

    salmon index -t gencode.v44.transcripts.fa.gz -i gencode_index -k 31
    Quantify each biological replicate:

    salmon quant -i gencode_index -l A -1 rep1_R1.fq.gz -2 rep1_R2.fq.gz --validateMappings -o quant_rep1/
  3. DESeq2 R Pipeline: Import quantifications using tximport:

    txi <- tximport(files, type="salmon", tx2gene=tx2gene)
    dds <- DESeqDataSetFromTximport(txi, colData=metadata, design= ~ condition)
    dds <- DESeq(dds)
    res <- results(dds, contrast=c("condition", "treated", "control"), alpha=0.05)
  4. Dispersion & Volcano Plot: Plot dispersion estimates. Generate volcano plot:

    EnhancedVolcano(res, lab=rownames(res), x='log2FoldChange', y='padj', pCutoff=0.05, FCcutoff=1.5)
๐Ÿ“Š Representative Differential Expression Output
Gene SymbolBase Mean$log_2$ Fold ChangelfcSEWald Stat$p$-valueAdjusted $p$-value ($p_{text{adj}}$)
CDH2 (N-Cadherin)2480.5+3.420.2116.28$1.4 times 10^{-59}$$8.2 times 10^{-56}$ (Up)
VIM (Vimentin)8950.2+2.850.1915.00$7.1 times 10^{-51}$$2.4 times 10^{-47}$ (Up)
CDH1 (E-Cadherin)4120.8−3.180.24-13.25$4.5 times 10^{-40}$$1.1 times 10^{-36}$ (Down)
ACTB (Beta-actin)35120.0+0.040.080.500.6170.742 (NS Housekeeping)

Biological Assessment: Pronounced upregulation of mesenchymal markers (N-cadherin, Vimentin) and downregulation of epithelial E-cadherin confirms canonical Epithelial-to-Mesenchymal Transition (EMT) induction by TGF-$beta$ ($p_{text{adj}} < 10^{-35}$).

Oral Examination Bank20 High-Yield Questions

Comprehensive Practical Viva-Voce Examination & Computational Assessment Bank

Aligned with B.Sc., M.Sc., CSIR-NET & GATE BT/XL

Essential questions testing algorithmic and statistical understanding of BLAST heuristics, MSA Shannon logos, phylogenetics, Ramachandran dihedral geometry, Vina thermodynamics, and RNA-Seq negative binomial modeling:

Q1: What is the fundamental difference between BLAST and the Smith-Waterman algorithm?

Ans: Smith-Waterman is an exact dynamic programming algorithm that guarantees finding the optimal local alignment (O(mยทn) time). BLAST is a heuristic algorithm that uses word seeding and neighborhood extension to approximate the optimal alignment orders of magnitude faster (O(n) time).

Q2: Explain the Karlin-Altschul E-value and its mathematical dependence on database size.

Ans: The E-value is the expected number of random alignments scoring >= S in a database of size n. E = Kยทmยทnยทe^(-lambdaยทS). Because E is directly proportional to n, doubling database size doubles the E-value for the same alignment score.

Q3: What is a Bit Score and why is it preferred over raw score when comparing searches?

Ans: The bit score S' = (lambdaยทS - ln K) / ln 2 is a normalized score expressed in bits of information. Unlike raw score S, bit scores are independent of the specific substitution matrix (e.g., BLOSUM62 vs PAM250) and database size.

Q4: When should you choose BLOSUM45 instead of BLOSUM62 or BLOSUM80?

Ans: BLOSUM numbers indicate sequence identity percentage of clustered blocks. Lower numbers (BLOSUM45) are tailored for detecting distant evolutionary relationships, while higher numbers (BLOSUM80) are designed for closely related sequences.

Q5: What is the biological meaning of stack height in a WebLogo sequence logo?

Ans: Stack height represents total sequence conservation in bits of Shannon information (R_seq = 4.32 - H_i). An invariant residue has 0 entropy, yielding a maximum height of ~4.32 bits. The relative height of each letter reflects its frequency at that position.

Q6: How does progressive alignment (Clustal) differ from iterative alignment (MUSCLE)?

Ans: Progressive alignment builds alignments hierarchically following a fixed guide tree; errors introduced early cannot be corrected ('once a gap, always a gap'). Iterative alignment (MUSCLE) continuously refines the alignment and updates distance profiles until convergence.

Q7: What is the Saitou-Nei Q-criterion in Neighbor-Joining tree construction?

Ans: The Q-criterion Q(i,j) = (n - 2)ยทd(i,j) - R_i - R_j normalizes the pairwise distance d(i,j) by the net divergence of both taxa to all other nodes. The pair that minimizes Q is joined, correctly grouping sister taxa even with unequal lineage evolutionary rates.

Q8: Why is outgroup rooting necessary when interpreting phylogenetic trees?

Ans: Distance and maximum likelihood methods produce unrooted trees showing branch connections but no evolutionary direction. Adding an organism known to have branched off prior to the taxa of interest (outgroup) establishes the evolutionary root and ancestral node.

Q9: What does a bootstrap support value of 95% mean on a phylogenetic node?

Ans: In 950 out of 1000 pseudo-replicate datasets generated by resampling alignment columns with replacement, that exact monophyletic clade was recovered, indicating high statistical confidence.

Q10: Explain the 'Twilight Zone' in protein homology modeling.

Ans: The twilight zone refers to sequence identities between 20% and 35%. Above 35%, homology modeling reliably yields accurate tertiary structures. Below 20%, comparative modeling fails and requires threading or de novo deep learning methods.

Q11: What are the allowed regions in a Ramachandran plot and what do they represent?

Ans: Regions of sterically favorable backbone dihedral angles Phi (phi) and Psi (psi) that do not cause steric clashes between side-chain and main-chain atoms. Major favored regions correspond to right-handed alpha-helices, beta-sheets, and left-handed alpha-helices.

Q12: What is the QMEANDisCo score in SWISS-MODEL?

Ans: A composite structural scoring function evaluating local and global quality by comparing pairwise inter-atomic distances to ensemble distributions from experimental homologous structures. Scores > 0.70 represent high-confidence models.

Q13: In molecular docking, what is an 'affinity grid box'?

Ans: A pre-calculated 3D rectangular bounding box enclosing the target enzyme's catalytic pocket, within which AutoDock Vina computes interaction potentials (electrostatics, van der Waals, desolvation) on grid points to accelerate ligand pose evaluation.

Q14: What is the difference between rigid docking and flexible docking?

Ans: In rigid docking, both receptor and ligand geometries are frozen. In semi-flexible docking (standard Vina), the receptor backbone is rigid while all ligand rotatable single bonds are allowed full torsional freedom during genetic algorithm exploration.

Q15: How is binding free energy (Delta G) related to the dissociation constant (Kd)?

Ans: Delta G = RยทTยทln(Kd). A negative Delta G corresponds to spontaneous, tight binding. A Delta G of -11.2 kcal/mol indicates nanomolar affinity (Kd ~ 6 nM).

Q16: Why does RNA-Seq count data require negative binomial modeling instead of Poisson?

Ans: Poisson distributions assume Mean = Variance. Biological replicates in RNA-Seq display substantial overdispersion (Variance > Mean) due to biological variability, which the negative binomial distribution models via its dispersion parameter alpha.

Q17: What is pseudoalignment in Kallisto and Salmon?

Ans: A lightweight alignment method that maps raw reads directly to transcript target k-mers via De Bruijn graphs without computing base-by-base alignments, achieving orders of magnitude faster transcript quantification than Bowtie/STAR.

Q18: Explain the median-of-ratios method used for normalization in DESeq2.

Ans: It calculates the geometric mean of each gene across all samples as a pseudo-reference, computes the ratio of each sample's counts to the reference, and takes the median of these ratios as the sample size factor to normalize for library depth differences.

Q19: What is the Benjamini-Hochberg procedure and why is it mandatory in transcriptomics?

Ans: A statistical method controlling the False Discovery Rate (FDR) when conducting thousands of simultaneous hypothesis tests (testing 20,000 genes at alpha = 0.05 would yield 1,000 false positives by chance alone).

Q20: What does each axis represent on a DESeq2 volcano plot?

Ans: The x-axis represents biological effect size (log2 Fold Change between treated and control conditions). The y-axis represents statistical significance (-log10 of the FDR-adjusted p-value).

Curriculum Integration

Explore Theoretical Bioinformatics & Omics Systems

Connect algorithmic alignment, structural modeling, and transcriptomics pipelines with genome assembly, systems biology networks, and precision medicine modules.


← Return to Bioinformatics Master Syllabus

๐Ÿ“– Key Terms & Comprehensive Glossary

Key Terms in this Lecture • Bioinformatics and Computational Biology

Master the essential vocabulary, core concepts, and biochemical keywords covered in this chapter. Click any key term to inspect its rigorous definition in the Bioinformatics and Computational Biology Comprehensive Glossary.

โญ 10/10 Concept Clarity
Back to Bioinformatics โšก One Night Revision → Explore All Disciplines