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: bjoe8971 vs. “Transcribing DNA into RNA”, 15 minutes ago
Problems: 285 (total), users: 71841, attempts: 1176406, correct: 653843
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 499
BA10B Compute the Probability of an Outcome Given a Hidden Path 422
BA10C Implement the Viterbi Algorithm 256
BA10D Compute the Probability of a String Emitted by an HMM 218
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 93
BA10I Implement Viterbi Learning 79
BA10J Solve the Soft Decoding Problem 85
BA10K Implement Baum-Welch Learning 67
BA11A Construct the Graph of a Spectrum 116
BA11B Implement DecodingIdealSpectrum 88
BA11C Convert a Peptide into a Peptide Vector 121
BA11D Convert a Peptide Vector into a Peptide 116
BA11E Sequence a Peptide 71
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 70
BA11G Implement PSMSearch 68
BA11H Compute the Size of a Spectral Dictionary 58
BA11I Compute the Probability of a Spectral Dictionary 57
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 45
BA1A Compute the Number of Times a Pattern Appears in a Text 1174
BA1B Find the Most Frequent Words in a String 1345
BA1C Find the Reverse Complement of a String 1307
BA1D Find All Occurrences of a Pattern in a String 1206
BA1E Find Patterns Forming Clumps in a String 936
BA1F Find a Position in a Genome Minimizing the Skew 949
BA1G Compute the Hamming Distance Between Two Strings 985
BA1H Find All Approximate Occurrences of a Pattern in a String 868
BA1I Find the Most Frequent Words with Mismatches in a String 715
BA1J Find Frequent Words with Mismatches and Reverse Complements 654
BA1K Generate the Frequency Array of a String 603
BA1L Implement PatternToNumber 655
BA1M Implement NumberToPattern 622
BA1N Generate the d-Neighborhood of a String 630
BA2A Implement MotifEnumeration 525
BA2B Find a Median String 538
BA2C Find a Profile-most Probable k-mer in a String 546
BA2D Implement GreedyMotifSearch 461
BA2E Implement GreedyMotifSearch with Pseudocounts 402
BA2F Implement RandomizedMotifSearch 323
BA2G Implement GibbsSampler 275
BA2H Implement DistanceBetweenPatternAndStrings 367
BA3A Generate the k-mer Composition of a String 658
BA3B Reconstruct a String from its Genome Path 588
BA3C Construct the Overlap Graph of a Collection of k-mers 542
BA3D Construct the De Bruijn Graph of a String 554
BA3E Construct the De Bruijn Graph of a Collection of k-mers 489
BA3F Find an Eulerian Cycle in a Graph 380
BA3G Find an Eulerian Path in a Graph 322
BA3H Reconstruct a String from its k-mer Composition 338
BA3I Find a k-Universal Circular String 253
BA3J Reconstruct a String from its Paired Composition 219
BA3K Generate Contigs from a Collection of Reads 214
BA3L Construct a String Spelled by a Gapped Genome Path 184
BA3M Generate All Maximal Non-Branching Paths in a Graph 161
BA4A Translate an RNA String into an Amino Acid String 436
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 351
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 334
BA4D Compute the Number of Peptides of Given Total Mass 222
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 252
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 204
BA4G Implement LeaderboardCyclopeptideSequencing 189
BA4H Generate the Convolution of a Spectrum 193
BA4I Implement ConvolutionCyclopeptideSequencing 136
BA4J Generate the Theoretical Spectrum of a Linear Peptide 211
BA4K Compute the Score of a Linear Peptide 165
BA4L Trim a Peptide Leaderboard 149
BA4M Solve the Turnpike Problem 81
BA5A Find the Minimum Number of Coins Needed to Make Change 535
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 426
BA5C Find a Longest Common Subsequence of Two Strings 518
BA5D Find the Longest Path in a DAG 343
BA5E Find a Highest-Scoring Alignment of Two Strings 499
BA5F Find a Highest-Scoring Local Alignment of Two Strings 409
BA5G Compute the Edit Distance Between Two Strings 464
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 293
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 262
BA5J Align Two Strings Using Affine Gap Penalties 291
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 189
BA5L Align Two Strings Using Linear Space 168
BA5M Find a Highest-Scoring Multiple Sequence Alignment 186
BA5N Find a Topological Ordering of a DAG 133
BA6A Implement GreedySorting to Sort a Permutation by Reversals 303
BA6B Compute the Number of Breakpoints in a Permutation 334
BA6C Compute the 2-Break Distance Between a Pair of Genomes 220
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 73
BA6E Find All Shared k-mers of a Pair of Strings 214
BA6F Implement ChromosomeToCycle 132
BA6G Implement CycleToChromosome 128
BA6H Implement ColoredEdges 118
BA6I Implement GraphToGenome 96
BA6J Implement 2-BreakOnGenomeGraph 92
BA6K Implement 2-BreakOnGenome 89
BA7A Compute Distances Between Leaves 156
BA7B Compute Limb Lengths in a Tree 164
BA7C Implement AdditivePhylogeny 120
BA7D Implement UPGMA 122
BA7E Implement the Neighbor Joining Algorithm 99
BA7F Implement SmallParsimony 87
BA7G Adapt SmallParsimony to Unrooted Trees 57
BA8A Implement FarthestFirstTraversal 117
BA8B Compute the Squared Error Distortion 110
BA8C Implement the Lloyd Algorithm for k-Means Clustering 123
BA8D Implement the Soft k-Means Clustering Algorithm 98
BA8E Implement Hierarchical Clustering 95
BA9A Construct a Trie from a Collection of Patterns 262
BA9B Implement TrieMatching 235
BA9C Construct the Suffix Tree of a String 178
BA9D Find the Longest Repeat in a String 206
BA9E Find the Longest Substring Shared by Two Strings 189
BA9F Find the Shortest Non-Shared Substring of Two Strings 155
BA9G Construct the Suffix Array of a String 219
BA9H Pattern Matching with the Suffix Array 120
BA9I Construct the Burrows-Wheeler Transform of a String 265
BA9J Reconstruct a String from its Burrows-Wheeler Transform 212
BA9K Generate the Last-to-First Mapping of a String 141
BA9L Implement BWMatching 165
BA9M Implement BetterBWMatching 150
BA9N Find All Occurrences of a Collection of Patterns in a String 157
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 129
BA9P Implement TreeColoring 64
BA9Q Construct the Partial Suffix Array of a String 126
BA9R Construct a Suffix Tree from a Suffix Array 93