Longest Shared Motif
Given a collection of DNA strings, find the longest substring that appears in every one of them. The first line …
Algorithms and models: dynamic-programming alignment, phylogenetics and hidden Markov models.
Given a collection of DNA strings, find the longest substring that appears in every one of them. The first line …
Given a collection of DNA strings of equal length, build the profile matrix and the consensus string. The first line …
Given a DNA string s, a motif t, and a non-negative integer d, find every position where t occurs in …
Compute the optimal global alignment score of two DNA strings under an affine gap model. Scoring: match: +1 mismatch: -1 …
Compute the optimal local alignment score of two DNA strings using the Smith-Waterman algorithm. Scoring: match: +2 mismatch: -1 gap …
Given a symmetric distance matrix over n taxa, determine which pair neighbor joining merges first. Neighbor joining does not pick …
Given a DNA sequence, use Viterbi decoding to find the most likely sequence of hidden states. There are two states: …
A population contains k homozygous dominant individuals (AA), m heterozygous individuals (Aa), and n homozygous recessive individuals (aa). Two individuals …
Given two protein or DNA strings, compute their edit distance: the minimum number of insertions, deletions and substitutions required to …
You are given a set of exon intervals as half-open ranges [start, end) on a single chromosome. Merge every group …
You are given the observed counts of three genotypes at a biallelic locus: homozygous for the major allele (AA), heterozygous …
You are given a gene expression count matrix. The first line is a header with the gene column label followed …
Given a collection of DNA strings and integers k and t, find a k-mer motif in each of the t …
Given a set of DNA strings and an integer k, find a median string: the k-mer that minimises the sum, …
Given two DNA strings, find a longest common subsequence: the longest string that appears in both as a subsequence, meaning …
You are given a symmetric distance matrix over n taxa labelled 0 to n-1. Build a UPGMA tree by repeatedly …
You are given six integers giving the number of couples in a population with each of these genotype pairings, in …