Problems

Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.

Last win: Karol vs. “Translating RNA into Protein”, 2 minutes ago
Problems: 285 (total), users: 46585, attempts: 791385, correct: 446672
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 279
BA10B Compute the Probability of an Outcome Given a Hidden Path 236
BA10C Implement the Viterbi Algorithm 148
BA10D Compute the Probability of a String Emitted by an HMM 133
BA10E Construct a Profile HMM 86
BA10F Construct a Profile HMM with Pseudocounts 76
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 35
BA10H Estimate the Parameters of an HMM 53
BA10I Implement Viterbi Learning 42
BA10J Solve the Soft Decoding Problem 44
BA10K Implement Baum-Welch Learning 31
BA11A Construct the Graph of a Spectrum 75
BA11B Implement DecodingIdealSpectrum 53
BA11C Convert a Peptide into a Peptide Vector 80
BA11D Convert a Peptide Vector into a Peptide 74
BA11E Sequence a Peptide 44
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 46
BA11G Implement PSMSearch 44
BA11H Compute the Size of a Spectral Dictionary 36
BA11I Compute the Probability of a Spectral Dictionary 35
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 26
BA1A Compute the Number of Times a Pattern Appears in a Text 565
BA1B Find the Most Frequent Words in a String 737
BA1C Find the Reverse Complement of a String 668
BA1D Find All Occurrences of a Pattern in a String 630
BA1E Find Patterns Forming Clumps in a String 497
BA1F Find a Position in a Genome Minimizing the Skew 479
BA1G Compute the Hamming Distance Between Two Strings 467
BA1H Find All Approximate Occurrences of a Pattern in a String 479
BA1I Find the Most Frequent Words with Mismatches in a String 384
BA1J Find Frequent Words with Mismatches and Reverse Complements 344
BA1K Generate the Frequency Array of a String 304
BA1L Implement PatternToNumber 340
BA1M Implement NumberToPattern 309
BA1N Generate the d-Neighborhood of a String 335
BA2A Implement MotifEnumeration 284
BA2B Find a Median String 248
BA2C Find a Profile-most Probable k-mer in a String 268
BA2D Implement GreedyMotifSearch 226
BA2E Implement GreedyMotifSearch with Pseudocounts 191
BA2F Implement RandomizedMotifSearch 154
BA2G Implement GibbsSampler 141
BA2H Implement DistanceBetweenPatternAndStrings 182
BA3A Generate the k-mer Composition of a String 303
BA3B Reconstruct a String from its Genome Path 247
BA3C Construct the Overlap Graph of a Collection of k-mers 263
BA3D Construct the De Bruijn Graph of a String 253
BA3E Construct the De Bruijn Graph of a Collection of k-mers 237
BA3F Find an Eulerian Cycle in a Graph 178
BA3G Find an Eulerian Path in a Graph 163
BA3H Reconstruct a String from its k-mer Composition 157
BA3I Find a k-Universal Circular String 126
BA3J Reconstruct a String from its Paired Composition 99
BA3K Generate Contigs from a Collection of Reads 110
BA3L Construct a String Spelled by a Gapped Genome Path 92
BA3M Generate All Maximal Non-Branching Paths in a Graph 88
BA4A Translate an RNA String into an Amino Acid String 217
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 171
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 173
BA4D Compute the Number of Peptides of Given Total Mass 93
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 122
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 99
BA4G Implement LeaderboardCyclopeptideSequencing 100
BA4H Generate the Convolution of a Spectrum 100
BA4I Implement ConvolutionCyclopeptideSequencing 69
BA4J Generate the Theoretical Spectrum of a Linear Peptide 102
BA4K Compute the Score of a Linear Peptide 86
BA4L Trim a Peptide Leaderboard 75
BA4M Solve the Turnpike Problem 47
BA5A Find the Minimum Number of Coins Needed to Make Change 388
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 321
BA5C Find a Longest Common Subsequence of Two Strings 379
BA5D Find the Longest Path in a DAG 260
BA5E Find a Highest-Scoring Alignment of Two Strings 306
BA5F Find a Highest-Scoring Local Alignment of Two Strings 268
BA5G Compute the Edit Distance Between Two Strings 320
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 222
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 204
BA5J Align Two Strings Using Affine Gap Penalties 190
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 124
BA5L Align Two Strings Using Linear Space 107
BA5M Find a Highest-Scoring Multiple Sequence Alignment 130
BA5N Find a Topological Ordering of a DAG 80
BA6A Implement GreedySorting to Sort a Permutation by Reversals 233
BA6B Compute the Number of Breakpoints in a Permutation 251
BA6C Compute the 2-Break Distance Between a Pair of Genomes 162
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 37
BA6E Find All Shared k-mers of a Pair of Strings 171
BA6F Implement ChromosomeToCycle 92
BA6G Implement CycleToChromosome 87
BA6H Implement ColoredEdges 80
BA6I Implement GraphToGenome 64
BA6J Implement 2-BreakOnGenomeGraph 58
BA6K Implement 2-BreakOnGenome 43
BA7A Compute Distances Between Leaves 99
BA7B Compute Limb Lengths in a Tree 90
BA7C Implement AdditivePhylogeny 61
BA7D Implement UPGMA 56
BA7E Implement the Neighbor Joining Algorithm 50
BA7F Implement SmallParsimony 43
BA7G Adapt SmallParsimony to Unrooted Trees 26
BA8A Implement FarthestFirstTraversal 75
BA8B Compute the Squared Error Distortion 73
BA8C Implement the Lloyd Algorithm for k-Means Clustering 66
BA8D Implement the Soft k-Means Clustering Algorithm 61
BA8E Implement Hierarchical Clustering 59
BA9A Construct a Trie from a Collection of Patterns 195
BA9B Implement TrieMatching 173
BA9C Construct the Suffix Tree of a String 134
BA9D Find the Longest Repeat in a String 159
BA9E Find the Longest Substring Shared by Two Strings 152
BA9F Find the Shortest Non-Shared Substring of Two Strings 120
BA9G Construct the Suffix Array of a String 154
BA9H Pattern Matching with the Suffix Array 73
BA9I Construct the Burrows-Wheeler Transform of a String 177
BA9J Reconstruct a String from its Burrows-Wheeler Transform 147
BA9K Generate the Last-to-First Mapping of a String 78
BA9L Implement BWMatching 113
BA9M Implement BetterBWMatching 107
BA9N Find All Occurrences of a Collection of Patterns in a String 119
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 89
BA9P Implement TreeColoring 38
BA9Q Construct the Partial Suffix Array of a String 94
BA9R Construct a Suffix Tree from a Suffix Array 67