Quiz 2

BSBT4001 · workspace

Algorithmic Bioinformatics

Syllabus, study tools, lectures, and curriculum map.

← Back to hub
Weekly outline

Syllabus

Week topics from the course map

00W00

Topic

Incomplete
01W01

Why computational biology?

Incomplete
02W02

Where in the Genome Does DNA Replication Begin? - Algorithmic warmup (frequent exact/inexact k-mers in a string).

Incomplete
03W03

Which DNA Patterns Play the Role of Molecular Clocks? - Randomized Algorithms (randomized motif search, Gibbs sampling).

Incomplete
04W04

How Do We Assemble Genomes? - Graph Algorithms (Eulerian paths, de Bruijn graphs).

Incomplete
05W05

How Do We Compare Biological Sequences? - Dynamic Programming (edit distance, single/multiple sequence alignment).

Incomplete
06W06

Which Animal Gave Us SARS? - Evolutionary Tree Reconstruction (distance-based phylogeny, neighbor-joining algorithm).

Incomplete
07W07

How Did Yeast Become a Winemaker? - Clustering Algorithms (hard and soft k-means).

Incomplete
08W08

How Do We Locate Disease-Causing Mutations? - Combinatorial Pattern Matching (suffix trees/arrays, Burrows-Wheeler transform).

Incomplete
09W09

Why Have Biologists Still Not Developed an HIV Vaccine? - Hidden Markov Models (Viterbi and forward–backward algorithms).

Incomplete
010W10

Was T. rex Just a Big Chicken? - Computational Proteomics (peptide identification and spectral match).

Incomplete
011W11

Which Motifs Are Hidden in a Biological Network? - Randomized Algorithms (colour coding for long paths in graphs).

Incomplete

Secure Comm-Link Terminal

Secure Comm-Link // @IITMadrasBSDegreeProgramme
Uplink 12ms
Syllabus Synchronization: Active

Syllabus Matrix Registry

Global Course Index

Open Full Frame

Master Registry

v6.4 Directory

Foundational

Diploma

BSc Degree

BS Degree

PG / MTech

BSBT4001
BS Degree
4 Credits

Algorithmic Thinking in Bioinformatics

To prepare students to develop an algorithmic thinking to address key data science challenges in bioinformatics, to acquire knowledge of various pr...

Execution Protocol

Module 0

Topic

Module 1

Why computational biology?

Module 2

Where in the Genome Does DNA Replication Begin? - Algorithmic warmup (frequent exact/inexact k-mers in a string).

Module 3

Which DNA Patterns Play the Role of Molecular Clocks? - Randomized Algorithms (randomized motif search, Gibbs sampling).

Module 4

How Do We Assemble Genomes? - Graph Algorithms (Eulerian paths, de Bruijn graphs).

Module 5

How Do We Compare Biological Sequences? - Dynamic Programming (edit distance, single/multiple sequence alignment).

Module 6

Which Animal Gave Us SARS? - Evolutionary Tree Reconstruction (distance-based phylogeny, neighbor-joining algorithm).

Module 7

How Did Yeast Become a Winemaker? - Clustering Algorithms (hard and soft k-means).

Module 8

How Do We Locate Disease-Causing Mutations? - Combinatorial Pattern Matching (suffix trees/arrays, Burrows-Wheeler transform).

Module 9

Why Have Biologists Still Not Developed an HIV Vaccine? - Hidden Markov Models (Viterbi and forward–backward algorithms).

Module 10

Was T. rex Just a Big Chicken? - Computational Proteomics (peptide identification and spectral match).

Module 11

Which Motifs Are Hidden in a Biological Network? - Randomized Algorithms (colour coding for long paths in graphs).

Video Archive

Document outline

Keep your place and jump directly to a heading.

Table of Contents
System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.