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: fransson.jen vs. “Translating RNA into Protein”, 6 minutes ago
Problems: 285 (total), users: 69182, attempts: 1137883, correct: 633263
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 482
BA10B Compute the Probability of an Outcome Given a Hidden Path 407
BA10C Implement the Viterbi Algorithm 253
BA10D Compute the Probability of a String Emitted by an HMM 215
BA10E Construct a Profile HMM 134
BA10F Construct a Profile HMM with Pseudocounts 123
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 68
BA10H Estimate the Parameters of an HMM 89
BA10I Implement Viterbi Learning 78
BA10J Solve the Soft Decoding Problem 83
BA10K Implement Baum-Welch Learning 65
BA11A Construct the Graph of a Spectrum 114
BA11B Implement DecodingIdealSpectrum 87
BA11C Convert a Peptide into a Peptide Vector 119
BA11D Convert a Peptide Vector into a Peptide 114
BA11E Sequence a Peptide 70
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 69
BA11G Implement PSMSearch 67
BA11H Compute the Size of a Spectral Dictionary 57
BA11I Compute the Probability of a Spectral Dictionary 56
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 45
BA1A Compute the Number of Times a Pattern Appears in a Text 1115
BA1B Find the Most Frequent Words in a String 1292
BA1C Find the Reverse Complement of a String 1248
BA1D Find All Occurrences of a Pattern in a String 1159
BA1E Find Patterns Forming Clumps in a String 887
BA1F Find a Position in a Genome Minimizing the Skew 900
BA1G Compute the Hamming Distance Between Two Strings 948
BA1H Find All Approximate Occurrences of a Pattern in a String 824
BA1I Find the Most Frequent Words with Mismatches in a String 674
BA1J Find Frequent Words with Mismatches and Reverse Complements 612
BA1K Generate the Frequency Array of a String 574
BA1L Implement PatternToNumber 623
BA1M Implement NumberToPattern 591
BA1N Generate the d-Neighborhood of a String 601
BA2A Implement MotifEnumeration 497
BA2B Find a Median String 511
BA2C Find a Profile-most Probable k-mer in a String 527
BA2D Implement GreedyMotifSearch 431
BA2E Implement GreedyMotifSearch with Pseudocounts 375
BA2F Implement RandomizedMotifSearch 297
BA2G Implement GibbsSampler 260
BA2H Implement DistanceBetweenPatternAndStrings 344
BA3A Generate the k-mer Composition of a String 633
BA3B Reconstruct a String from its Genome Path 563
BA3C Construct the Overlap Graph of a Collection of k-mers 519
BA3D Construct the De Bruijn Graph of a String 528
BA3E Construct the De Bruijn Graph of a Collection of k-mers 478
BA3F Find an Eulerian Cycle in a Graph 365
BA3G Find an Eulerian Path in a Graph 308
BA3H Reconstruct a String from its k-mer Composition 306
BA3I Find a k-Universal Circular String 230
BA3J Reconstruct a String from its Paired Composition 204
BA3K Generate Contigs from a Collection of Reads 200
BA3L Construct a String Spelled by a Gapped Genome Path 168
BA3M Generate All Maximal Non-Branching Paths in a Graph 149
BA4A Translate an RNA String into an Amino Acid String 417
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 327
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 321
BA4D Compute the Number of Peptides of Given Total Mass 202
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 238
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 195
BA4G Implement LeaderboardCyclopeptideSequencing 175
BA4H Generate the Convolution of a Spectrum 186
BA4I Implement ConvolutionCyclopeptideSequencing 129
BA4J Generate the Theoretical Spectrum of a Linear Peptide 202
BA4K Compute the Score of a Linear Peptide 157
BA4L Trim a Peptide Leaderboard 141
BA4M Solve the Turnpike Problem 79
BA5A Find the Minimum Number of Coins Needed to Make Change 507
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 412
BA5C Find a Longest Common Subsequence of Two Strings 507
BA5D Find the Longest Path in a DAG 335
BA5E Find a Highest-Scoring Alignment of Two Strings 484
BA5F Find a Highest-Scoring Local Alignment of Two Strings 395
BA5G Compute the Edit Distance Between Two Strings 457
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 290
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 259
BA5J Align Two Strings Using Affine Gap Penalties 287
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 185
BA5L Align Two Strings Using Linear Space 164
BA5M Find a Highest-Scoring Multiple Sequence Alignment 183
BA5N Find a Topological Ordering of a DAG 128
BA6A Implement GreedySorting to Sort a Permutation by Reversals 294
BA6B Compute the Number of Breakpoints in a Permutation 322
BA6C Compute the 2-Break Distance Between a Pair of Genomes 209
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 66
BA6E Find All Shared k-mers of a Pair of Strings 211
BA6F Implement ChromosomeToCycle 127
BA6G Implement CycleToChromosome 123
BA6H Implement ColoredEdges 113
BA6I Implement GraphToGenome 93
BA6J Implement 2-BreakOnGenomeGraph 87
BA6K Implement 2-BreakOnGenome 78
BA7A Compute Distances Between Leaves 150
BA7B Compute Limb Lengths in a Tree 157
BA7C Implement AdditivePhylogeny 112
BA7D Implement UPGMA 109
BA7E Implement the Neighbor Joining Algorithm 93
BA7F Implement SmallParsimony 83
BA7G Adapt SmallParsimony to Unrooted Trees 52
BA8A Implement FarthestFirstTraversal 116
BA8B Compute the Squared Error Distortion 109
BA8C Implement the Lloyd Algorithm for k-Means Clustering 122
BA8D Implement the Soft k-Means Clustering Algorithm 98
BA8E Implement Hierarchical Clustering 94
BA9A Construct a Trie from a Collection of Patterns 255
BA9B Implement TrieMatching 228
BA9C Construct the Suffix Tree of a String 174
BA9D Find the Longest Repeat in a String 203
BA9E Find the Longest Substring Shared by Two Strings 187
BA9F Find the Shortest Non-Shared Substring of Two Strings 152
BA9G Construct the Suffix Array of a String 215
BA9H Pattern Matching with the Suffix Array 117
BA9I Construct the Burrows-Wheeler Transform of a String 260
BA9J Reconstruct a String from its Burrows-Wheeler Transform 208
BA9K Generate the Last-to-First Mapping of a String 138
BA9L Implement BWMatching 160
BA9M Implement BetterBWMatching 144
BA9N Find All Occurrences of a Collection of Patterns in a String 154
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 122
BA9P Implement TreeColoring 63
BA9Q Construct the Partial Suffix Array of a String 123
BA9R Construct a Suffix Tree from a Suffix Array 93