BA10A 
Compute the Probability of a Hidden Path

579


BA10B 
Compute the Probability of an Outcome Given a Hidden Path

484


BA10C 
Implement the Viterbi Algorithm

283


BA10D 
Compute the Probability of a String Emitted by an HMM

239


BA10E 
Construct a Profile HMM

147


BA10F 
Construct a Profile HMM with Pseudocounts

134


BA10G 
Perform a Multiple Sequence Alignment with a Profile HMM

76


BA10H 
Estimate the Parameters of an HMM

103


BA10I 
Implement Viterbi Learning

87


BA10J 
Solve the Soft Decoding Problem

94


BA10K 
Implement BaumWelch Learning

74


BA11A 
Construct the Graph of a Spectrum

134


BA11B 
Implement DecodingIdealSpectrum

96


BA11C 
Convert a Peptide into a Peptide Vector

137


BA11D 
Convert a Peptide Vector into a Peptide

132


BA11E 
Sequence a Peptide

78


BA11F 
Find a HighestScoring Peptide in a Proteome against a Spectrum

78


BA11G 
Implement PSMSearch

75


BA11H 
Compute the Size of a Spectral Dictionary

66


BA11I 
Compute the Probability of a Spectral Dictionary

65


BA11J 
Find a HighestScoring Modified Peptide against a Spectrum

51


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

1501


BA1B 
Find the Most Frequent Words in a String

1667


BA1C 
Find the Reverse Complement of a String

1599


BA1D 
Find All Occurrences of a Pattern in a String

1481


BA1E 
Find Patterns Forming Clumps in a String

1185


BA1F 
Find a Position in a Genome Minimizing the Skew

1200


BA1G 
Compute the Hamming Distance Between Two Strings

1257


BA1H 
Find All Approximate Occurrences of a Pattern in a String

1061


BA1I 
Find the Most Frequent Words with Mismatches in a String

865


BA1J 
Find Frequent Words with Mismatches and Reverse Complements

791


BA1K 
Generate the Frequency Array of a String

710


BA1L 
Implement PatternToNumber

776


BA1M 
Implement NumberToPattern

737


BA1N 
Generate the dNeighborhood of a String

743


BA2A 
Implement MotifEnumeration

632


BA2B 
Find a Median String

640


BA2C 
Find a Profilemost Probable kmer in a String

644


BA2D 
Implement GreedyMotifSearch

552


BA2E 
Implement GreedyMotifSearch with Pseudocounts

493


BA2F 
Implement RandomizedMotifSearch

394


BA2G 
Implement GibbsSampler

346


BA2H 
Implement DistanceBetweenPatternAndStrings

437


BA3A 
Generate the kmer Composition of a String

807


BA3B 
Reconstruct a String from its Genome Path

728


BA3C 
Construct the Overlap Graph of a Collection of kmers

672


BA3D 
Construct the De Bruijn Graph of a String

691


BA3E 
Construct the De Bruijn Graph of a Collection of kmers

613


BA3F 
Find an Eulerian Cycle in a Graph

466


BA3G 
Find an Eulerian Path in a Graph

419


BA3H 
Reconstruct a String from its kmer Composition

464


BA3I 
Find a kUniversal Circular String

311


BA3J 
Reconstruct a String from its Paired Composition

270


BA3K 
Generate Contigs from a Collection of Reads

263


BA3L 
Construct a String Spelled by a Gapped Genome Path

225


BA3M 
Generate All Maximal NonBranching Paths in a Graph

208


BA4A 
Translate an RNA String into an Amino Acid String

533


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

433


BA4C 
Generate the Theoretical Spectrum of a Cyclic Peptide

414


BA4D 
Compute the Number of Peptides of Given Total Mass

276


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

318


BA4F 
Compute the Score of a Cyclic Peptide Against a Spectrum

256


BA4G 
Implement LeaderboardCyclopeptideSequencing

235


BA4H 
Generate the Convolution of a Spectrum

239


BA4I 
Implement ConvolutionCyclopeptideSequencing

170


BA4J 
Generate the Theoretical Spectrum of a Linear Peptide

260


BA4K 
Compute the Score of a Linear Peptide

209


BA4L 
Trim a Peptide Leaderboard

185


BA4M 
Solve the Turnpike Problem

106


BA5A 
Find the Minimum Number of Coins Needed to Make Change

611


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

482


BA5C 
Find a Longest Common Subsequence of Two Strings

624


BA5D 
Find the Longest Path in a DAG

384


BA5E 
Find a HighestScoring Alignment of Two Strings

564


BA5F 
Find a HighestScoring Local Alignment of Two Strings

444


BA5G 
Compute the Edit Distance Between Two Strings

502


BA5H 
Find a HighestScoring Fitting Alignment of Two Strings

321


BA5I 
Find a HighestScoring Overlap Alignment of Two Strings

282


BA5J 
Align Two Strings Using Affine Gap Penalties

328


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

203


BA5L 
Align Two Strings Using Linear Space

178


BA5M 
Find a HighestScoring Multiple Sequence Alignment

216


BA5N 
Find a Topological Ordering of a DAG

152


BA6A 
Implement GreedySorting to Sort a Permutation by Reversals

337


BA6B 
Compute the Number of Breakpoints in a Permutation

372


BA6C 
Compute the 2Break Distance Between a Pair of Genomes

247


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

85


BA6E 
Find All Shared kmers of a Pair of Strings

221


BA6F 
Implement ChromosomeToCycle

147


BA6G 
Implement CycleToChromosome

141


BA6H 
Implement ColoredEdges

131


BA6I 
Implement GraphToGenome

107


BA6J 
Implement 2BreakOnGenomeGraph

112


BA6K 
Implement 2BreakOnGenome

99


BA7A 
Compute Distances Between Leaves

197


BA7B 
Compute Limb Lengths in a Tree

203


BA7C 
Implement AdditivePhylogeny

159


BA7D 
Implement UPGMA

145


BA7E 
Implement the Neighbor Joining Algorithm

128


BA7F 
Implement SmallParsimony

98


BA7G 
Adapt SmallParsimony to Unrooted Trees

68


BA8A 
Implement FarthestFirstTraversal

136


BA8B 
Compute the Squared Error Distortion

131


BA8C 
Implement the Lloyd Algorithm for kMeans Clustering

143


BA8D 
Implement the Soft kMeans Clustering Algorithm

107


BA8E 
Implement Hierarchical Clustering

108


BA9A 
Construct a Trie from a Collection of Patterns

282


BA9B 
Implement TrieMatching

255


BA9C 
Construct the Suffix Tree of a String

195


BA9D 
Find the Longest Repeat in a String

224


BA9E 
Find the Longest Substring Shared by Two Strings

201


BA9F 
Find the Shortest NonShared Substring of Two Strings

169


BA9G 
Construct the Suffix Array of a String

241


BA9H 
Pattern Matching with the Suffix Array

136


BA9I 
Construct the BurrowsWheeler Transform of a String

286


BA9J 
Reconstruct a String from its BurrowsWheeler Transform

236


BA9K 
Generate the LasttoFirst Mapping of a String

172


BA9L 
Implement BWMatching

179


BA9M 
Implement BetterBWMatching

162


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

169


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

137


BA9P 
Implement TreeColoring

71


BA9Q 
Construct the Partial Suffix Array of a String

134


BA9R 
Construct a Suffix Tree from a Suffix Array

102

