Bioinformatics Tutorial
Learn Bioinformatics step by step: 49 lessons in 9 chapters with examples, quizzes, diagrams and practice.
Start learning →
of lessons completed
Getting Started
- Course map: your path through bioinformatics See the whole bioinformatics course at a glance: who it is for, how to study it, and what the nine chapters teach, from DNA as data to machine learning and projects.
- Chapter 1 overview: getting started Chapter 1 shows how biology becomes data: DNA, RNA and protein as strings, the genetic code, and the Python skills you need to analyze sequences.
- DNA, RNA and protein as data Treat the central dogma as a string problem: complements, reverse complements, transcription, the codon table, reading frames and translation, with Python examples.
- Working with sequences in Python Build a small Python toolkit for DNA: indexing and slicing, base counts, GC content, sliding windows, k-mers and a hand-written FASTA parser.
- Chapter 1 review: getting started Review chapter 1 of the bioinformatics course with a one-page recap, a summary table and a ten-question quiz on codons, reverse complements, GC content and k-mers.
Biological Data and Databases
- Chapter 2 overview: biological data and databases Chapter 2 maps the biological data landscape: public sequence databases, the file formats programs expect, and the quality scores that tell you how far to trust a read.
- Sequence databases and accessions Learn what GenBank, ENA, DDBJ, RefSeq, UniProt, Ensembl and the PDB contain, how accession numbers and versions work, and how to choose the right resource.
- File formats: FASTA, FASTQ, GFF3, BED and VCF Read and write the plain-text formats behind genomics: FASTA, FASTQ, GFF3, BED and VCF, with a clear guide to 0-based and 1-based coordinates.
- FASTQ and Phred quality scores Decode FASTQ quality strings, convert Phred scores to error probabilities, average quality correctly, and trim low-quality read ends, with runnable Python.
- Chapter 2 review: biological data and databases Review chapter 2 with a one-page recap of databases, file formats and Phred quality scores, plus a ten-question quiz and two practice tools.
Sequence Alignment
- Chapter 3 overview: sequence alignment Chapter 3 introduces sequence alignment: why we align, how scoring works, the dynamic programming algorithms, BLAST and multiple sequence alignment.
- Scoring matrices and gap penalties Understand how alignment scores are chosen: identity and similarity, log-odds substitution matrices such as BLOSUM62 and PAM, and linear versus affine gap penalties.
- Global alignment: Needleman-Wunsch Learn the Needleman-Wunsch global alignment algorithm: the dynamic programming recurrence, filling the score matrix, traceback, complexity and a Python implementation.
- Local alignment: Smith-Waterman Learn local alignment with the Smith-Waterman algorithm: the zero floor, finding the best matching region, traceback, why the expected score must be negative, and Python code.
- BLAST and heuristic search Understand how BLAST searches huge databases fast: seed words, extension, high-scoring pairs, bit scores and E-values, with Python examples and practical interpretation tips.
- Multiple sequence alignment Learn multiple sequence alignment: why it is hard, progressive alignment with guide trees, tools such as MAFFT and Clustal Omega, conservation, consensus and information content.
- Chapter 3 review: sequence alignment Review sequence alignment: scoring, Needleman-Wunsch, Smith-Waterman, BLAST statistics and multiple alignment, with a one-page recap, practice code and a ten-question quiz.
Phylogenetics
- Chapter 4 overview: phylogenetics Chapter 4 introduces phylogenetics: evolutionary trees, how sequences reveal ancestry, the main tree-building methods and how to judge confidence in a tree.
- Distances and UPGMA Turn an alignment into evolutionary distances with p-distance and the Jukes-Cantor correction, then build a tree by UPGMA clustering, with Python code and the molecular-clock caveat.
- Neighbor-joining Learn the neighbor-joining method: the Q matrix, how branch lengths are estimated, why it works without a molecular clock, and a worked example with Python code.
- Parsimony and maximum likelihood Learn character-based tree building: Fitch parsimony counting, long-branch attraction, likelihood under the Jukes-Cantor model, rate variation, model selection and Bayesian methods.
- Bootstrap support and reading trees Measure confidence in a phylogenetic tree with the bootstrap, understand rooting, Newick format and monophyly, and avoid the most common mistakes when reading trees.
- Chapter 4 review: phylogenetics Review phylogenetics: distances, Jukes-Cantor, UPGMA, neighbor-joining, parsimony, likelihood, bootstrap and tree reading, with a recap table, practice code and a ten-question quiz.
Genomics Pipelines
- Chapter 5 Overview: Genomics Pipelines See the whole short-read genomics pipeline at a glance: sequencing, FASTQ, mapping, BAM, variant calling, VCF and annotation, with the numbers behind each step.
- FASTQ and Read Quality Learn how a FASTQ record is built, how Phred scores encode base-call errors, how to read a quality report, and how to trim adapters and low-quality tails.
- Read Mapping, SAM and BAM Understand how reads are mapped to a reference genome, how to read SAM and BAM records including FLAG, CIGAR and MAPQ, and how to check coverage and mapping quality.
- Variant Calling and the VCF Format Learn how variant callers weigh allele counts to decide genotypes, how to read a VCF line, which filters matter, and how variants are annotated and prioritized.
- Chapter 5 Review: Genomics Pipelines Review the short-read genomics pipeline: files, tools, formulas and quality checks from FASTQ to annotated variants, with a recap table and a ten-question quiz.
Transcriptomics and Expression
- Chapter 6 Overview: Transcriptomics and Expression Get the big picture of RNA-seq: what it measures, how libraries are made, how reads become a count matrix, and how groups are compared statistically.
- RNA-seq Counts and Normalization: CPM, TPM and Size Factors Learn why raw RNA-seq counts mislead and how CPM, TPM, TMM and the median-of-ratios method correct for sequencing depth, gene length and composition bias.
- Differential Expression: Fold Changes, p-values and FDR Learn how RNA-seq differential expression works: log2 fold changes, negative binomial models, Wald tests, Benjamini-Hochberg FDR control and how to read a volcano plot.
- Clustering, Heatmaps and Pathway Enrichment Learn to explore expression data with PCA, hierarchical clustering and heatmaps, and to interpret gene lists with over-representation analysis and GSEA.
- Chapter 6 Review: Transcriptomics and Expression Review the RNA-seq analysis path from counts to normalization, testing, FDR control, heatmaps and enrichment, with a recap table, a checklist and a ten-question quiz.
Structural Bioinformatics
- Chapter 7 Overview: Structural Bioinformatics A map of structural bioinformatics: how protein structures are determined and stored, the four levels of structure, how structures are compared, predicted and docked.
- Protein Structure and PDB Files Learn to read PDB and mmCIF files, compute distances and phi/psi dihedral angles from coordinates, understand helices and sheets, and judge structure quality.
- Superposition and RMSD: Comparing Protein Structures Learn how to superpose two protein structures with the Kabsch algorithm, compute RMSD, avoid its pitfalls, and use TM-score, GDT and lDDT for better comparisons.
- Structure Prediction and Molecular Docking Learn how protein structures are predicted from sequence, how to read AlphaFold's pLDDT and PAE confidence, and how docking scores ligands, with limits and pitfalls.
- Chapter 7 Review: Structural Bioinformatics Review protein structure levels, PDB coordinates, Ramachandran angles, superposition and RMSD, AlphaFold confidence and docking, with a recap table and a ten-question quiz.
Machine Learning in Biology
- Chapter 8 Overview: Machine Learning in Biology A map of machine learning for biological data: classification, regression and clustering tasks, the standard workflow, and the pitfalls that make biology special.
- Sequence Features: k-mers, One-hot Encoding and Logistic Regression Learn how to turn DNA and protein sequences into numbers with k-mer counts, GC content and one-hot encoding, and train an interpretable logistic regression classifier.
- Evaluating Classifiers: Confusion Matrix, ROC, Precision-Recall and Leakage Learn to judge a classifier honestly with confusion matrices, precision, recall, ROC and precision-recall curves, grouped cross-validation, and how to detect data leakage.
- Deep Learning for Sequences: Convolution Filters and Embeddings See how convolutional filters act as learned motif scanners, train one from scratch in NumPy, and meet language-model embeddings, interpretation methods and the limits of deep learning.
- Chapter 8 Review: Machine Learning in Biology Review features, evaluation metrics and pitfalls for machine learning on biological sequences, with a checklist, a worked critique of a claimed 99% classifier and a quiz.
Projects and Practice
- Project: Build a Toy Variant Caller Build a miniature genomics pipeline in Python: simulate a diploid sample with sequencing errors, count bases in a pileup, call genotypes with a binomial model and measure accuracy.
- Project: Differential Expression from Scratch Simulate an RNA-seq experiment, normalize counts, test every gene, control the false discovery rate, draw volcano and MA plots, and measure how replicates affect power.
- Practice Problems: Genomics, RNA-seq, Structure and ML Six hand-calculation problems on Phred scores, coverage, genotypes, TPM, Benjamini-Hochberg and RMSD, with an answer checker, code and fully worked solutions.
- Bioinformatics Glossary: Chapters 5 to 8 A plain-language glossary of more than seventy terms from genomics pipelines, RNA-seq, structural bioinformatics and machine learning, with a searchable widget.
- Bioinformatics Cheat Sheet: Formulas, Formats and Rules of Thumb A one-page bioinformatics cheat sheet: file formats, Phred and depth formulas, RNA-seq normalization, variant genotypes, structure metrics and machine learning scores.
- Further Study: Where to Go After This Course Plan your next steps in bioinformatics: the skills to deepen, related tutorials on this site, databases and tools to explore, practice ideas, ethics and a twelve-week plan.