BA10A 
Compute the Probability of a Hidden Path

772


BA10B 
Compute the Probability of an Outcome Given a Hidden Path

636


BA10C 
Implement the Viterbi Algorithm

483


BA10D 
Compute the Probability of a String Emitted by an HMM

326


BA10E 
Construct a Profile HMM

185


BA10F 
Construct a Profile HMM with Pseudocounts

176


BA10G 
Perform a Multiple Sequence Alignment with a Profile HMM

97


BA10H 
Estimate the Parameters of an HMM

158


BA10I 
Implement Viterbi Learning

124


BA10J 
Solve the Soft Decoding Problem

137


BA10K 
Implement BaumWelch Learning

135


BA11A 
Construct the Graph of a Spectrum

176


BA11B 
Implement DecodingIdealSpectrum

128


BA11C 
Convert a Peptide into a Peptide Vector

182


BA11D 
Convert a Peptide Vector into a Peptide

175


BA11E 
Sequence a Peptide

104


BA11F 
Find a HighestScoring Peptide in a Proteome against a Spectrum

104


BA11G 
Implement PSMSearch

97


BA11H 
Compute the Size of a Spectral Dictionary

91


BA11I 
Compute the Probability of a Spectral Dictionary

89


BA11J 
Find a HighestScoring Modified Peptide against a Spectrum

65


BA1A 
Compute the Number of Times a Pattern Appears in a Text

2576


BA1B 
Find the Most Frequent Words in a String

2674


BA1C 
Find the Reverse Complement of a String

2552


BA1D 
Find All Occurrences of a Pattern in a String

2447


BA1E 
Find Patterns Forming Clumps in a String

2078


BA1F 
Find a Position in a Genome Minimizing the Skew

2060


BA1G 
Compute the Hamming Distance Between Two Strings

2136


BA1H 
Find All Approximate Occurrences of a Pattern in a String

1627


BA1I 
Find the Most Frequent Words with Mismatches in a String

1312


BA1J 
Find Frequent Words with Mismatches and Reverse Complements

1191


BA1K 
Generate the Frequency Array of a String

1064


BA1L 
Implement PatternToNumber

1264


BA1M 
Implement NumberToPattern

1213


BA1N 
Generate the dNeighborhood of a String

1097


BA2A 
Implement MotifEnumeration

1109


BA2B 
Find a Median String

1128


BA2C 
Find a Profilemost Probable kmer in a String

1003


BA2D 
Implement GreedyMotifSearch

929


BA2E 
Implement GreedyMotifSearch with Pseudocounts

819


BA2F 
Implement RandomizedMotifSearch

760


BA2G 
Implement GibbsSampler

598


BA2H 
Implement DistanceBetweenPatternAndStrings

880


BA3A 
Generate the kmer Composition of a String

1193


BA3B 
Reconstruct a String from its Genome Path

1119


BA3C 
Construct the Overlap Graph of a Collection of kmers

1034


BA3D 
Construct the De Bruijn Graph of a String

1011


BA3E 
Construct the De Bruijn Graph of a Collection of kmers

915


BA3F 
Find an Eulerian Cycle in a Graph

718


BA3G 
Find an Eulerian Path in a Graph

661


BA3H 
Reconstruct a String from its kmer Composition

754


BA3I 
Find a kUniversal Circular String

537


BA3J 
Reconstruct a String from its Paired Composition

526


BA3K 
Generate Contigs from a Collection of Reads

411


BA3L 
Construct a String Spelled by a Gapped Genome Path

401


BA3M 
Generate All Maximal NonBranching Paths in a Graph

303


BA4A 
Translate an RNA String into an Amino Acid String

800


BA4B 
Find Substrings of a Genome Encoding a Given Amino Acid String

727


BA4C 
Generate the Theoretical Spectrum of a Cyclic Peptide

642


BA4D 
Compute the Number of Peptides of Given Total Mass

501


BA4E 
Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum

514


BA4F 
Compute the Score of a Cyclic Peptide Against a Spectrum

401


BA4G 
Implement LeaderboardCyclopeptideSequencing

402


BA4H 
Generate the Convolution of a Spectrum

385


BA4I 
Implement ConvolutionCyclopeptideSequencing

260


BA4J 
Generate the Theoretical Spectrum of a Linear Peptide

375


BA4K 
Compute the Score of a Linear Peptide

322


BA4L 
Trim a Peptide Leaderboard

289


BA4M 
Solve the Turnpike Problem

169


BA5A 
Find the Minimum Number of Coins Needed to Make Change

855


BA5B 
Find the Length of a Longest Path in a Manhattanlike Grid

724


BA5C 
Find a Longest Common Subsequence of Two Strings

814


BA5D 
Find the Longest Path in a DAG

528


BA5E 
Find a HighestScoring Alignment of Two Strings

762


BA5F 
Find a HighestScoring Local Alignment of Two Strings

628


BA5G 
Compute the Edit Distance Between Two Strings

657


BA5H 
Find a HighestScoring Fitting Alignment of Two Strings

446


BA5I 
Find a HighestScoring Overlap Alignment of Two Strings

390


BA5J 
Align Two Strings Using Affine Gap Penalties

515


BA5K 
Find a Middle Edge in an Alignment Graph in Linear Space

287


BA5L 
Align Two Strings Using Linear Space

248


BA5M 
Find a HighestScoring Multiple Sequence Alignment

288


BA5N 
Find a Topological Ordering of a DAG

256


BA6A 
Implement GreedySorting to Sort a Permutation by Reversals

460


BA6B 
Compute the Number of Breakpoints in a Permutation

490


BA6C 
Compute the 2Break Distance Between a Pair of Genomes

341


BA6D 
Find a Shortest Transformation of One Genome into Another by 2Breaks

182


BA6E 
Find All Shared kmers of a Pair of Strings

268


BA6F 
Implement ChromosomeToCycle

224


BA6G 
Implement CycleToChromosome

219


BA6H 
Implement ColoredEdges

197


BA6I 
Implement GraphToGenome

170


BA6J 
Implement 2BreakOnGenomeGraph

171


BA6K 
Implement 2BreakOnGenome

144


BA7A 
Compute Distances Between Leaves

260


BA7B 
Compute Limb Lengths in a Tree

299


BA7C 
Implement AdditivePhylogeny

274


BA7D 
Implement UPGMA

206


BA7E 
Implement the Neighbor Joining Algorithm

194


BA7F 
Implement SmallParsimony

138


BA7G 
Adapt SmallParsimony to Unrooted Trees

98


BA8A 
Implement FarthestFirstTraversal

191


BA8B 
Compute the Squared Error Distortion

194


BA8C 
Implement the Lloyd Algorithm for kMeans Clustering

218


BA8D 
Implement the Soft kMeans Clustering Algorithm

148


BA8E 
Implement Hierarchical Clustering

154


BA9A 
Construct a Trie from a Collection of Patterns

358


BA9B 
Implement TrieMatching

361


BA9C 
Construct the Suffix Tree of a String

270


BA9D 
Find the Longest Repeat in a String

354


BA9E 
Find the Longest Substring Shared by Two Strings

267


BA9F 
Find the Shortest NonShared Substring of Two Strings

222


BA9G 
Construct the Suffix Array of a String

334


BA9H 
Pattern Matching with the Suffix Array

256


BA9I 
Construct the BurrowsWheeler Transform of a String

376


BA9J 
Reconstruct a String from its BurrowsWheeler Transform

323


BA9K 
Generate the LasttoFirst Mapping of a String

267


BA9L 
Implement BWMatching

239


BA9M 
Implement BetterBWMatching

206


BA9N 
Find All Occurrences of a Collection of Patterns in a String

215


BA9O 
Find All Approximate Occurrences of a Collection of Patterns in a String

205


BA9P 
Implement TreeColoring

99


BA9Q 
Construct the Partial Suffix Array of a String

169


BA9R 
Construct a Suffix Tree from a Suffix Array

124

