BA10A 
Compute the Probability of a Hidden Path

645


BA10B 
Compute the Probability of an Outcome Given a Hidden Path

542


BA10C 
Implement the Viterbi Algorithm

352


BA10D 
Compute the Probability of a String Emitted by an HMM

270


BA10E 
Construct a Profile HMM

165


BA10F 
Construct a Profile HMM with Pseudocounts

156


BA10G 
Perform a Multiple Sequence Alignment with a Profile HMM

88


BA10H 
Estimate the Parameters of an HMM

133


BA10I 
Implement Viterbi Learning

105


BA10J 
Solve the Soft Decoding Problem

108


BA10K 
Implement BaumWelch Learning

87


BA11A 
Construct the Graph of a Spectrum

153


BA11B 
Implement DecodingIdealSpectrum

108


BA11C 
Convert a Peptide into a Peptide Vector

162


BA11D 
Convert a Peptide Vector into a Peptide

156


BA11E 
Sequence a Peptide

89


BA11F 
Find a HighestScoring Peptide in a Proteome against a Spectrum

88


BA11G 
Implement PSMSearch

84


BA11H 
Compute the Size of a Spectral Dictionary

76


BA11I 
Compute the Probability of a Spectral Dictionary

75


BA11J 
Find a HighestScoring Modified Peptide against a Spectrum

57


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

1857


BA1B 
Find the Most Frequent Words in a String

2009


BA1C 
Find the Reverse Complement of a String

1940


BA1D 
Find All Occurrences of a Pattern in a String

1810


BA1E 
Find Patterns Forming Clumps in a String

1527


BA1F 
Find a Position in a Genome Minimizing the Skew

1504


BA1G 
Compute the Hamming Distance Between Two Strings

1582


BA1H 
Find All Approximate Occurrences of a Pattern in a String

1243


BA1I 
Find the Most Frequent Words with Mismatches in a String

1039


BA1J 
Find Frequent Words with Mismatches and Reverse Complements

934


BA1K 
Generate the Frequency Array of a String

840


BA1L 
Implement PatternToNumber

1031


BA1M 
Implement NumberToPattern

986


BA1N 
Generate the dNeighborhood of a String

872


BA2A 
Implement MotifEnumeration

863


BA2B 
Find a Median String

807


BA2C 
Find a Profilemost Probable kmer in a String

778


BA2D 
Implement GreedyMotifSearch

690


BA2E 
Implement GreedyMotifSearch with Pseudocounts

600


BA2F 
Implement RandomizedMotifSearch

508


BA2G 
Implement GibbsSampler

435


BA2H 
Implement DistanceBetweenPatternAndStrings

642


BA3A 
Generate the kmer Composition of a String

932


BA3B 
Reconstruct a String from its Genome Path

850


BA3C 
Construct the Overlap Graph of a Collection of kmers

780


BA3D 
Construct the De Bruijn Graph of a String

806


BA3E 
Construct the De Bruijn Graph of a Collection of kmers

715


BA3F 
Find an Eulerian Cycle in a Graph

547


BA3G 
Find an Eulerian Path in a Graph

491


BA3H 
Reconstruct a String from its kmer Composition

563


BA3I 
Find a kUniversal Circular String

391


BA3J 
Reconstruct a String from its Paired Composition

354


BA3K 
Generate Contigs from a Collection of Reads

309


BA3L 
Construct a String Spelled by a Gapped Genome Path

295


BA3M 
Generate All Maximal NonBranching Paths in a Graph

243


BA4A 
Translate an RNA String into an Amino Acid String

628


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

524


BA4C 
Generate the Theoretical Spectrum of a Cyclic Peptide

487


BA4D 
Compute the Number of Peptides of Given Total Mass

341


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

375


BA4F 
Compute the Score of a Cyclic Peptide Against a Spectrum

303


BA4G 
Implement LeaderboardCyclopeptideSequencing

289


BA4H 
Generate the Convolution of a Spectrum

294


BA4I 
Implement ConvolutionCyclopeptideSequencing

199


BA4J 
Generate the Theoretical Spectrum of a Linear Peptide

293


BA4K 
Compute the Score of a Linear Peptide

238


BA4L 
Trim a Peptide Leaderboard

217


BA4M 
Solve the Turnpike Problem

125


BA5A 
Find the Minimum Number of Coins Needed to Make Change

678


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

541


BA5C 
Find a Longest Common Subsequence of Two Strings

678


BA5D 
Find the Longest Path in a DAG

423


BA5E 
Find a HighestScoring Alignment of Two Strings

627


BA5F 
Find a HighestScoring Local Alignment of Two Strings

491


BA5G 
Compute the Edit Distance Between Two Strings

551


BA5H 
Find a HighestScoring Fitting Alignment of Two Strings

358


BA5I 
Find a HighestScoring Overlap Alignment of Two Strings

320


BA5J 
Align Two Strings Using Affine Gap Penalties

381


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

230


BA5L 
Align Two Strings Using Linear Space

201


BA5M 
Find a HighestScoring Multiple Sequence Alignment

239


BA5N 
Find a Topological Ordering of a DAG

188


BA6A 
Implement GreedySorting to Sort a Permutation by Reversals

375


BA6B 
Compute the Number of Breakpoints in a Permutation

414


BA6C 
Compute the 2Break Distance Between a Pair of Genomes

272


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

106


BA6E 
Find All Shared kmers of a Pair of Strings

247


BA6F 
Implement ChromosomeToCycle

179


BA6G 
Implement CycleToChromosome

173


BA6H 
Implement ColoredEdges

163


BA6I 
Implement GraphToGenome

135


BA6J 
Implement 2BreakOnGenomeGraph

136


BA6K 
Implement 2BreakOnGenome

119


BA7A 
Compute Distances Between Leaves

221


BA7B 
Compute Limb Lengths in a Tree

245


BA7C 
Implement AdditivePhylogeny

187


BA7D 
Implement UPGMA

168


BA7E 
Implement the Neighbor Joining Algorithm

166


BA7F 
Implement SmallParsimony

117


BA7G 
Adapt SmallParsimony to Unrooted Trees

85


BA8A 
Implement FarthestFirstTraversal

161


BA8B 
Compute the Squared Error Distortion

159


BA8C 
Implement the Lloyd Algorithm for kMeans Clustering

173


BA8D 
Implement the Soft kMeans Clustering Algorithm

120


BA8E 
Implement Hierarchical Clustering

127


BA9A 
Construct a Trie from a Collection of Patterns

323


BA9B 
Implement TrieMatching

295


BA9C 
Construct the Suffix Tree of a String

228


BA9D 
Find the Longest Repeat in a String

257


BA9E 
Find the Longest Substring Shared by Two Strings

223


BA9F 
Find the Shortest NonShared Substring of Two Strings

185


BA9G 
Construct the Suffix Array of a String

291


BA9H 
Pattern Matching with the Suffix Array

174


BA9I 
Construct the BurrowsWheeler Transform of a String

337


BA9J 
Reconstruct a String from its BurrowsWheeler Transform

283


BA9K 
Generate the LasttoFirst Mapping of a String

223


BA9L 
Implement BWMatching

209


BA9M 
Implement BetterBWMatching

187


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

192


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

159


BA9P 
Implement TreeColoring

85


BA9Q 
Construct the Partial Suffix Array of a String

153


BA9R 
Construct a Suffix Tree from a Suffix Array

115

