LSMA

LONDON SCHOOL OF MULTIOMICS & AI

Free course

Free course

0 of 73 lessons

Optional

Further reading

Further reading

Further reading

Optional reading for the free course Omics, Bioinformatics and AI. It follows the course's eight modules, from what each omics layer measures, through databases, the command line, sequence comparison, sequencing data, genome assembly and gene function, to AI for biology. Read it at your own pace. Nothing here is submitted or marked.

⏱ 17 min readFree
Lesson at a glance5 steps · about 17 min
  1. Module by module
  2. Papers and guides
  3. Tool manuals
  4. Glossary
  5. Going further
Download the PDF PDF · 11 pages · 864 KB · updated November 2026
  • Start with the module cards. Each module has two or three key readings. If you read only those, you have the core of the subject.
  • Most of it is free to read. Papers with a free full text link to PubMed Central or the publisher; the few that may need a subscription are marked.
  • The questions have no answer key. Use them to check your understanding after a module, or to discuss with other learners.

Module by module

The key readings for each module, and questions to think about once you have finished it. Full references are under Papers and guides.

Module 1 · FoundationsUnderstanding omics

Each omics layer measures a different molecule, with its own technology, errors and questions it can answer. Combining layers helps only when each one is understood first.

Read the sequencing review first, since every later module depends on how reads are made; the multi-omics and single-cell papers are best read with a question in mind, such as which layer could answer it.

Read
Think about
  • Which layer would you measure to find out whether a gene is switched off by methylation, and which to see whether its protein is still made?
  • Why can a transcript count go up while the protein it encodes stays the same?
Module 2 · FoundationsBiological data and databases

Every gene, protein and variant lives in a handful of public databases, each with its own identifiers and file formats. Knowing which one to open, and how to read its records, saves hours.

The format specifications are references rather than reading: open them beside a real file and check each column against the description.

Think about
  • Why might the same variant have two different positions in two papers, and how would you check which is right?
  • When would you trust a reviewed protein record over an unreviewed one, and when does it not matter?
Module 3 · IntermediateThe command line

The shell joins small tools with pipes, so a long analysis becomes a short, repeatable script. Environments and clusters let the same script run anywhere.

Work through the shell lessons at a terminal, typing each command, then read the good-practice paper and compare its advice with how you organise your own projects.

Read
Think about
  • Your script works on your laptop but fails on the cluster. Which three things would you check first?
  • Why is a one-line pipe often safer than opening a 2 GB file in a spreadsheet?
Module 4 · IntermediateComparing sequences

Alignment turns two or more sequences into evidence about shared ancestry and function. Scores, matrices and E-values say how much that evidence is worth.

Try the alignment tools on a pair of sequences you know, then change one setting at a time, such as the scoring matrix or gap penalty, and watch how the score and E-value respond.

Think about
  • A search returns a hit with 25% identity over 200 residues and a tiny E-value. Is the protein homologous, and what would you check next?
  • Why does a tree built from one gene not always match the tree of the species?
Module 5 · AdvancedSequencing data

Reads are checked, trimmed, aligned and counted, ending in a table of reads per gene. Each step has settings that change the result, so each must be recorded.

Read the workflow review once before the module for the overall picture, and again afterwards, when each step it describes will be one you have run.

Read
Think about
  • A sample has 99.8% alignment but only 60% of its read pairs assigned to genes. What might have happened?
  • Which settings from this module would you put in a methods section, and why?
Module 6 · AdvancedGenome assembly

Assembly rebuilds a genome from overlapping reads. Repeats longer than the reads break it; long reads, graphs and polishing put it back together.

Start with the assembly-graph paper, which makes the later lessons easier, and keep the assessment paper to hand when you judge your own assemblies.

Read
Think about
  • How can N50 go up while an assembly gets worse?
  • Your long-read assembly has more indels than mismatches. Why are indels the usual nanopore error?
Module 7 · AdvancedFrom genes to function

Sequence becomes biology through annotation: genes, domains, structures, pathways and networks. Each step adds meaning, and each adds its own uncertainty.

The annotation guides describe real production pipelines; as you read, note which steps rest on evidence and which on prediction, since that is where the uncertainty enters.

Think about
  • Your enrichment test finds a strong pathway. What background did you use, and would the result survive a different one?
  • Two genes rise and fall together across samples. What else would you need before saying their proteins interact?
Module 8 · AdvancedAI for biology

Machine learning now helps at every step, from reading sequences to predicting structures. The skill that matters most is judging when a result can be trusted.

Read the AlphaFold FAQ before looking at any predicted structure, and the scikit-learn guide alongside your own code; how a model is evaluated matters more than which model you choose.

Read
Think about
  • A model predicts protein function with 95% accuracy. What would you ask about how the test set was built?
  • Where in a predicted structure would you trust the model, and where would you want an experiment?

Papers and guides

The papers, books and guidance behind the course, grouped by module.

Module 1 · Understanding omics

  1. Goodwin S, McPherson JD, McCombie WR (2016). Coming of age: ten years of next-generation sequencing technologies. Nature Reviews Genetics 17:333–351. How sequencing technologies work and compare.
  2. Cancer Genome Atlas Research Network; Weinstein JN et al. (2013). The Cancer Genome Atlas Pan-Cancer analysis project. Nature Genetics 45:1113–1120. The project behind much of the public cancer data in Public data and reading a paper.
  3. Cerami E et al. (2012). The cBio cancer genomics portal: an open platform for exploring multidimensional cancer genomics data. Cancer Discovery 2:401–404. The portal used to explore public cancer data in Public data and reading a paper.
  4. Hasin Y, Seldin M, Lusis A (2017). Multi-omics approaches to disease. Genome Biology 18:83. A clear review of combining omics layers.
  5. Lähnemann D et al. (2020). Eleven grand challenges in single-cell data science. Genome Biology 21:31. Open problems in single-cell data analysis.

Module 2 · Biological data and databases

  1. UniProt Consortium (2023). UniProt: the Universal Protein Knowledgebase in 2023. Nucleic Acids Research 51:D523–D531. What is in UniProt and how entries are reviewed (The main databases: sequences, genomes, proteins, structures and Reading a gene record and a protein record).
  2. Morales J et al. (2022). A joint NCBI and EMBL-EBI transcript set for clinical genomics and research. Nature 604:310–315. MANE Select, the agreed reference transcript (Identifiers and cross-references: following one gene across databases and Reading a gene record and a protein record).

Module 3 · The command line

  1. Wilson G et al. (2014). Best practices for scientific computing. PLOS Biology 12:e1001745. Habits that make computational work reliable.
  2. Wilson G et al. (2017). Good enough practices in scientific computing. PLOS Computational Biology 13:e1005510. A practical, shorter version for everyday projects.
  3. Grüning B et al. (2018). Bioconda: sustainable and comprehensive software distribution for the life sciences. Nature Methods 15:475–476. How bioinformatics software is packaged for conda.

Module 4 · Comparing sequences

  1. Altschul SF et al. (1990). Basic local alignment search tool. Journal of Molecular Biology 215:403–410. The original BLAST paper (Searching databases fast: similarity search and E-values). May need a subscription
  2. Henikoff S, Henikoff JG (1992). Amino acid substitution matrices from protein blocks. PNAS 89:10915–10919. How BLOSUM matrices were built (Scoring matrices: PAM and BLOSUM).
  3. Sievers F et al. (2011). Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Molecular Systems Biology 7:539. The multiple aligner used on the web in Multiple alignment and conserved regions.

Module 5 · Sequencing data

  1. Conesa A et al. (2016). A survey of best practices for RNA-seq data analysis. Genome Biology 17:13. Best practice for every step of RNA-seq analysis.
  2. Ewels P et al. (2016). MultiQC: summarize analysis results for multiple tools and samples in a single report. Bioinformatics 32:3047–3048. Collects quality reports from many samples into one.
  3. Chen S et al. (2018). fastp: an ultra-fast all-in-one FASTQ preprocessor. Bioinformatics 34:i884–i890. The trimming tool used in Trimming and filtering.
  4. Kim D et al. (2019). Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype. Nature Biotechnology 37:907–915. The aligner used in Aligning reads to a genome.
  5. Danecek P et al. (2021). Twelve years of SAMtools and BCFtools. GigaScience 10:giab008. The SAM/BAM tools used from Aligning reads to a genome.
  6. Liao Y, Smyth GK, Shi W (2014). featureCounts: an efficient general purpose program for assigning sequence reads to genomic features. Bioinformatics 30:923–930. The read counter used in Counting reads per gene. May need a subscription
  7. Ewels PA et al. (2020). The nf-core framework for community-curated bioinformatics pipelines. Nature Biotechnology 38:276–278. Community pipelines that run these steps at scale (Beyond RNA-seq: other assays and pipelines). May need a subscription

Module 6 · Genome assembly

  1. Lander ES, Waterman MS (1988). Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics 2:231–239. The maths of coverage and gaps behind What genome assembly is. May need a subscription
  2. Miller JR, Koren S, Sutton G (2010). Assembly algorithms for next-generation sequencing data. Genomics 95:315–327. A review of overlap and de Bruijn graph assemblers.
  3. Compeau PEC, Pevzner PA, Tesler G (2011). How to apply de Bruijn graphs to genome assembly. Nature Biotechnology 29:987–991. The best short introduction to assembly graphs.
  4. Vurture GW et al. (2017). GenomeScope: fast reference-free genome profiling from short reads. Bioinformatics 33:2202–2204. Genome size from the k-mer histogram (K-mers and genome size).
  5. Bankevich A et al. (2012). SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. Journal of Computational Biology 19:455–477. The short-read assembler in Short-read assembly with SPAdes.
  6. Gurevich A et al. (2013). QUAST: quality assessment tool for genome assemblies. Bioinformatics 29:1072–1075. Assembly statistics and NGA50 (Judging an assembly).
  7. Wick RR et al. (2015). Bandage: interactive visualization of de novo genome assemblies. Bioinformatics 31:3350–3352. Draws an assembly graph so you can see repeats.
  8. Kolmogorov M et al. (2019). Assembly of long, error-prone reads using repeat graphs. Nature Biotechnology 37:540–546. The long-read assembler in Long reads and repeats. May need a subscription
  9. Wick RR, Holt KE (2022). Polypolish: short-read polishing of long-read bacterial genome assemblies. PLOS Computational Biology 18:e1009802. Fixing long-read errors with short reads.
  10. Hyatt D et al. (2010). Prodigal: prokaryotic gene recognition and translation initiation site identification. BMC Bioinformatics 11:119. How a real gene finder improves on simple ORF search (Genes on your assembly: a first count, and is it complete?).
  11. Schwengers O et al. (2021). Bakta: rapid and standardized annotation of bacterial genomes via alignment-free sequence identification. Microbial Genomics 7(11). Naming the genes in a bacterial genome.
  12. Manni M et al. (2021). BUSCO update: novel and streamlined workflows along with broader and deeper phylogenetic coverage for scoring of eukaryotic, prokaryotic, and viral genomes. Molecular Biology and Evolution 38:4647–4654. Completeness from single-copy marker genes (Genes on your assembly: a first count, and is it complete?).
  13. Chklovski A et al. (2023). CheckM2: a rapid, scalable and accurate tool for assessing microbial genome quality using machine learning. Nature Methods 20:1203–1212. Completeness and contamination for bacterial genomes. May need a subscription
  14. Nurk S et al. (2022). The complete sequence of a human genome. Science 376:44–53. The first gap-free human genome, made possible by long reads.

Module 7 · From genes to function

  1. Ashburner M et al. (2000). Gene Ontology: tool for the unification of biology. Nature Genetics 25:25–29. Where GO terms come from (Pathways and enrichment analysis).
  2. Subramanian A et al. (2005). Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles. PNAS 102:15545–15550. The GSEA method introduced in Pathways and enrichment analysis.
  3. Szklarczyk D et al. (2023). The STRING database in 2023: protein–protein association networks and functional enrichment analyses. Nucleic Acids Research 51:D638–D646. The interaction networks described in Biological networks and systems biology.

Module 8 · AI for biology

  1. Jumper J et al. (2021). Highly accurate protein structure prediction with AlphaFold. Nature 596:583–589. AI structure prediction and its confidence scores (AI structure prediction: what it changed, and its limits).
  2. Lin Z et al. (2023). Evolutionary-scale prediction of atomic-level protein structure with a language model. Science 379:1123–1130. The ESM-2 protein language models used in Protein language models and embeddings and the project. May need a subscription
  3. Whalen S et al. (2022). Navigating the pitfalls of applying machine learning in genomics. Nature Reviews Genetics 23:169–181. Leakage and other traps (A first sequence classifier, evaluated honestly and Judging AI claims in biology). May need a subscription

Tool manuals

Each tool's official page has its install steps, options and version history. Options change between releases, so check your version against the one the course used.

ToolWhat it doesModuleVersion in the course
SeqKitRead and sequence statistics3, 5, 62.14
FastQCRead quality report50.13
fastpTrimming and filtering51.4.0
HISAT2Splice-aware alignment52.2.3
samtoolsSorting, indexing and viewing alignments51.15.1
featureCounts (Subread)Counting reads per gene52.0.6
SPAdesShort-read assembler63.15.3
QUASTAssembly statistics65.0.2
FlyeLong-read assembler62.9.2
BandageDraws the assembly graph6Not used
PolypolishPolishes with short reads6Not used
ProdigalFinds genes in bacteria6Not used
BaktaAnnotates bacterial genomes6Not used
CheckM2Completeness and contamination6Not used
BiopythonSequences, alignments, trees and structures in Python4, 7, 81.88
NCBI BLAST (web)Similarity search4Web version
Clustal Omega, MUSCLE, MAFFT (web)Multiple sequence alignment4Web version
Ensembl VEPAnnotates what a variant does4Web version
SciPyStatistical tests, including enrichment7Current in Colab
NetworkXNetwork analysis in Python7Current in Colab
scikit-learnMachine learning models and evaluation8Current in Colab
PyTorchDeep learning8Current in Colab
Hugging Face Transformers (ESM-2)Protein language model embeddings8Current in Colab
AlphaFold Protein Structure DatabasePredicted protein structures2, 8Web version

Glossary

Accession
A stable identifier for a database record, such as P04637 in UniProt.
Alignment (mapping)
Finding where each read came from in a reference genome.
Assembly graph
A graph whose paths spell possible genome sequences; forks mark what the data cannot resolve.
BAM file
The compressed, binary form of a SAM alignment file.
BLOSUM62
A table of scores for swapping one amino acid for another, built from real alignments.
Contig
A continuous stretch of assembled sequence with no gaps.
Coverage (depth)
How many reads cover a base on average.
E-value
How many hits this good you would expect by chance in a search of this size.
Embedding
A list of numbers a model uses to summarise a sequence, so similar sequences sit close together.
Enrichment analysis
Testing whether a gene list holds more members of a pathway than chance would give.
False discovery rate
The share of significant results expected to be false when many tests are run.
FASTQ
A text format holding each read's sequence and a quality score for every base.
Homology
Shared ancestry. Two sequences either are homologous or are not; similarity is the evidence.
k-mer
Every substring of length k in a read.
MANE Select
One agreed reference transcript per human gene, shared by NCBI and Ensembl.
Multiple sequence alignment
Many related sequences lined up so matching positions sit in the same column.
N50
The contig length at which contigs of that length or longer hold half the assembly.
Normalisation
Adjusting counts so samples sequenced to different depths can be compared.
Open reading frame
A stretch of DNA from a start codon to a stop codon that could code for a protein.
Orthologue
The same gene in two species, separated by speciation.
Paired-end reads
Two reads from the two ends of one DNA fragment.
Paralogue
A copy of a gene within one genome, separated by duplication.
Pipe
The | symbol, which sends one command's output into the next.
pLDDT
AlphaFold's confidence score for each residue, from 0 to 100.
Polishing
Correcting small errors in an assembly by realigning reads to it.
Protein language model
A model trained to predict hidden amino acids, which learns patterns of protein families.
Protospacer adjacent motif (PAM)
The short DNA sequence, NGG for the common Cas9, that must sit next to a CRISPR target.
Repeat
A sequence that appears more than once in a genome.
Transcriptome
All the RNA molecules in a sample at one time.
VCF file
A text format listing variants: position, reference and alternative bases, and genotypes.

Going further

Back to the overviewPDF

Up next

Finish

Course complete

Ask BioTutor

Create a free website with Framer, the website builder loved by startups, designers and agencies.