Computational biology

AI for a Computational Biologist

Build a reproducible, biologically constrained analysis from public sequence and expression data without mistaking prediction for mechanism.

16-22 hours · estimatedSelf-guided · learn at your pace
Before you start

Biologists or data scientists who know Python and basic molecular biology.

  • Python, pandas, and basic statistics
  • DNA, RNA, protein, gene, transcript, and variant concepts
  • Comfort reading a methods section
LESSON 1 · 3-4 hours ESTIMATED

Sequences, alignments, and representations

Parse biological sequences, create transparent features, and use alignment as a baseline for learned similarity.

A biological sequence is ordered and evolutionary history makes observations dependent. Before using embeddings, build interpretable representations: length, GC content, amino-acid composition, and k-mer counts. Use Biopython to parse a small public FASTA file and verify that alphabet, identifiers, and lengths match expectations. Compare two sequences with local or global alignment and explain what substitutions and gaps mean under the chosen scoring scheme. Then train a simple logistic regression on k-mer frequencies for a small, clearly labeled sequence task. Split by homologous group or source organism where possible; a random row split can place near-duplicate relatives on both sides and inflate performance. BLAST provides a strong retrieval baseline based on sequence similarity, so compare learned predictions with nearest matches rather than treating the classifier as inherently more modern or informative. Inspect disagreements manually. Learned representations may capture useful regularities, but they do not erase phylogeny, annotation error, or sampling bias. The biological split is often a more consequential modeling choice than the classifier.

Try it yourself

  1. Parse a small FASTA file with Biopython and compute composition plus k-mer features.
  2. Align selected pairs and inspect BLAST results or a small local BLAST database.
  3. Compare a grouped split with a random split for a simple classifier.

You’re ready to move on when…

  • Parser preserves identifiers and sequence lengths.
  • Evaluation groups related sequences to limit homology leakage.
  • Report compares classifier errors with an alignment or BLAST baseline.
Enroll above to keep your progress across visits.
PUT IT INTO PRACTICE

Reproducible gene-family evidence notebook

Choose a small public gene family, retrieve sequences and annotations, create grouped sequence features, compare a classifier with similarity retrieval, and relate one protein prediction to available experimental evidence.

What you’ll make

  • Cached raw public records with retrieval dates
  • Reproducible notebook
  • Grouped-split evaluation
  • Two-page biological evidence memo

Check your work

  • No individual-level or private data is used.
  • Homology leakage is addressed explicitly.
  • Memo distinguishes database fact, model output, interpretation, and proposed validation.
Project estimate: 6-10 hours beyond lessons. Completion is self-reported; this is not an accredited qualification.

Follow the researchers

Public professional profiles and publications. Contact details don’t imply availability for mentoring.

Manolis Kellis

Massachusetts Institute of Technology

Computational genomics, gene regulation, epigenomics, and AI-supported interpretation of biological data.

Olga G. Troyanskaya

Princeton University

Computational genomics, biological networks, precision health, and machine learning for functional interpretation.