PRACTICE · EXPLORE · IMPROVE

Problem bank

Find your next bioinformatics challenge and work through it at your pace.

Pick a random problem ↗
Filters
Difficulty
Category
Tags
Showing 31–52 of 52 problems
Intermediate GC SkewCumulative SumsReplication Origin

Minimum GC Skew

Define Skew(i) as the number of G minus the number of C in the first i characters of a genome, …

Intermediate Dynamic ProgrammingAlignmentLevenshtein

Edit Distance

Given two protein or DNA strings, compute their edit distance: the minimum number of insertions, deletions and substitutions required to …

Advanced Motif FindingGreedy AlgorithmsProfile Matrices

Greedy Motif Search

Given a collection of DNA strings and integers k and t, find a k-mer motif in each of the t …

Advanced Dynamic ProgrammingTracebackSequence Comparison

Longest Common Subsequence

Given two DNA strings, find a longest common subsequence: the longest string that appears in both as a subsequence, meaning …

Advanced PhylogeneticsHierarchical ClusteringDistance Matrix

UPGMA Phylogenetic Tree

You are given a symmetric distance matrix over n taxa labelled 0 to n-1. Build a UPGMA tree by repeatedly …

No matches on this page.
There could still be a hit elsewhere in the bank — run a full search to check.