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: VM vs. “Variables and Some Arithmetic”, 4 minutes ago
Problems: 285 (total), users: 81864, attempts: 1349761, correct: 746835
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 601
BA10B Compute the Probability of an Outcome Given a Hidden Path 503
BA10C Implement the Viterbi Algorithm 296
BA10D Compute the Probability of a String Emitted by an HMM 251
BA10E Construct a Profile HMM 150
BA10F Construct a Profile HMM with Pseudocounts 140
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 80
BA10H Estimate the Parameters of an HMM 111
BA10I Implement Viterbi Learning 95
BA10J Solve the Soft Decoding Problem 102
BA10K Implement Baum-Welch Learning 79
BA11A Construct the Graph of a Spectrum 138
BA11B Implement DecodingIdealSpectrum 98
BA11C Convert a Peptide into a Peptide Vector 141
BA11D Convert a Peptide Vector into a Peptide 137
BA11E Sequence a Peptide 80
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 80
BA11G Implement PSMSearch 77
BA11H Compute the Size of a Spectral Dictionary 68
BA11I Compute the Probability of a Spectral Dictionary 67
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 53
BA1A Compute the Number of Times a Pattern Appears in a Text 1553
BA1B Find the Most Frequent Words in a String 1712
BA1C Find the Reverse Complement of a String 1643
BA1D Find All Occurrences of a Pattern in a String 1526
BA1E Find Patterns Forming Clumps in a String 1240
BA1F Find a Position in a Genome Minimizing the Skew 1254
BA1G Compute the Hamming Distance Between Two Strings 1304
BA1H Find All Approximate Occurrences of a Pattern in a String 1114
BA1I Find the Most Frequent Words with Mismatches in a String 908
BA1J Find Frequent Words with Mismatches and Reverse Complements 827
BA1K Generate the Frequency Array of a String 733
BA1L Implement PatternToNumber 811
BA1M Implement NumberToPattern 770
BA1N Generate the d-Neighborhood of a String 765
BA2A Implement MotifEnumeration 657
BA2B Find a Median String 674
BA2C Find a Profile-most Probable k-mer in a String 674
BA2D Implement GreedyMotifSearch 586
BA2E Implement GreedyMotifSearch with Pseudocounts 521
BA2F Implement RandomizedMotifSearch 427
BA2G Implement GibbsSampler 367
BA2H Implement DistanceBetweenPatternAndStrings 469
BA3A Generate the k-mer Composition of a String 832
BA3B Reconstruct a String from its Genome Path 753
BA3C Construct the Overlap Graph of a Collection of k-mers 698
BA3D Construct the De Bruijn Graph of a String 722
BA3E Construct the De Bruijn Graph of a Collection of k-mers 636
BA3F Find an Eulerian Cycle in a Graph 475
BA3G Find an Eulerian Path in a Graph 428
BA3H Reconstruct a String from its k-mer Composition 494
BA3I Find a k-Universal Circular String 335
BA3J Reconstruct a String from its Paired Composition 291
BA3K Generate Contigs from a Collection of Reads 277
BA3L Construct a String Spelled by a Gapped Genome Path 251
BA3M Generate All Maximal Non-Branching Paths in a Graph 210
BA4A Translate an RNA String into an Amino Acid String 542
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 458
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 424
BA4D Compute the Number of Peptides of Given Total Mass 299
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 342
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 260
BA4G Implement LeaderboardCyclopeptideSequencing 250
BA4H Generate the Convolution of a Spectrum 244
BA4I Implement ConvolutionCyclopeptideSequencing 172
BA4J Generate the Theoretical Spectrum of a Linear Peptide 263
BA4K Compute the Score of a Linear Peptide 212
BA4L Trim a Peptide Leaderboard 190
BA4M Solve the Turnpike Problem 109
BA5A Find the Minimum Number of Coins Needed to Make Change 626
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 500
BA5C Find a Longest Common Subsequence of Two Strings 632
BA5D Find the Longest Path in a DAG 393
BA5E Find a Highest-Scoring Alignment of Two Strings 588
BA5F Find a Highest-Scoring Local Alignment of Two Strings 460
BA5G Compute the Edit Distance Between Two Strings 516
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 328
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 292
BA5J Align Two Strings Using Affine Gap Penalties 335
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 212
BA5L Align Two Strings Using Linear Space 186
BA5M Find a Highest-Scoring Multiple Sequence Alignment 221
BA5N Find a Topological Ordering of a DAG 159
BA6A Implement GreedySorting to Sort a Permutation by Reversals 343
BA6B Compute the Number of Breakpoints in a Permutation 380
BA6C Compute the 2-Break Distance Between a Pair of Genomes 250
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 89
BA6E Find All Shared k-mers of a Pair of Strings 224
BA6F Implement ChromosomeToCycle 149
BA6G Implement CycleToChromosome 143
BA6H Implement ColoredEdges 134
BA6I Implement GraphToGenome 108
BA6J Implement 2-BreakOnGenomeGraph 115
BA6K Implement 2-BreakOnGenome 101
BA7A Compute Distances Between Leaves 200
BA7B Compute Limb Lengths in a Tree 220
BA7C Implement AdditivePhylogeny 170
BA7D Implement UPGMA 151
BA7E Implement the Neighbor Joining Algorithm 152
BA7F Implement SmallParsimony 109
BA7G Adapt SmallParsimony to Unrooted Trees 75
BA8A Implement FarthestFirstTraversal 141
BA8B Compute the Squared Error Distortion 136
BA8C Implement the Lloyd Algorithm for k-Means Clustering 150
BA8D Implement the Soft k-Means Clustering Algorithm 107
BA8E Implement Hierarchical Clustering 113
BA9A Construct a Trie from a Collection of Patterns 285
BA9B Implement TrieMatching 262
BA9C Construct the Suffix Tree of a String 197
BA9D Find the Longest Repeat in a String 228
BA9E Find the Longest Substring Shared by Two Strings 206
BA9F Find the Shortest Non-Shared Substring of Two Strings 170
BA9G Construct the Suffix Array of a String 249
BA9H Pattern Matching with the Suffix Array 142
BA9I Construct the Burrows-Wheeler Transform of a String 293
BA9J Reconstruct a String from its Burrows-Wheeler Transform 244
BA9K Generate the Last-to-First Mapping of a String 189
BA9L Implement BWMatching 192
BA9M Implement BetterBWMatching 173
BA9N Find All Occurrences of a Collection of Patterns in a String 173
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 140
BA9P Implement TreeColoring 74
BA9Q Construct the Partial Suffix Array of a String 136
BA9R Construct a Suffix Tree from a Suffix Array 104