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: Stephen CWH vs. “Counting DNA Nucleotides”, 2 minutes ago
Problems: 285 (total), users: 60839, attempts: 1015472, correct: 567899
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 418
BA10B Compute the Probability of an Outcome Given a Hidden Path 356
BA10C Implement the Viterbi Algorithm 219
BA10D Compute the Probability of a String Emitted by an HMM 193
BA10E Construct a Profile HMM 123
BA10F Construct a Profile HMM with Pseudocounts 114
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 59
BA10H Estimate the Parameters of an HMM 78
BA10I Implement Viterbi Learning 70
BA10J Solve the Soft Decoding Problem 68
BA10K Implement Baum-Welch Learning 56
BA11A Construct the Graph of a Spectrum 101
BA11B Implement DecodingIdealSpectrum 72
BA11C Convert a Peptide into a Peptide Vector 106
BA11D Convert a Peptide Vector into a Peptide 100
BA11E Sequence a Peptide 59
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 60
BA11G Implement PSMSearch 59
BA11H Compute the Size of a Spectral Dictionary 49
BA11I Compute the Probability of a Spectral Dictionary 50
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 40
BA1A Compute the Number of Times a Pattern Appears in a Text 915
BA1B Find the Most Frequent Words in a String 1079
BA1C Find the Reverse Complement of a String 1021
BA1D Find All Occurrences of a Pattern in a String 935
BA1E Find Patterns Forming Clumps in a String 719
BA1F Find a Position in a Genome Minimizing the Skew 706
BA1G Compute the Hamming Distance Between Two Strings 783
BA1H Find All Approximate Occurrences of a Pattern in a String 675
BA1I Find the Most Frequent Words with Mismatches in a String 541
BA1J Find Frequent Words with Mismatches and Reverse Complements 485
BA1K Generate the Frequency Array of a String 451
BA1L Implement PatternToNumber 508
BA1M Implement NumberToPattern 473
BA1N Generate the d-Neighborhood of a String 497
BA2A Implement MotifEnumeration 407
BA2B Find a Median String 406
BA2C Find a Profile-most Probable k-mer in a String 425
BA2D Implement GreedyMotifSearch 352
BA2E Implement GreedyMotifSearch with Pseudocounts 299
BA2F Implement RandomizedMotifSearch 243
BA2G Implement GibbsSampler 219
BA2H Implement DistanceBetweenPatternAndStrings 283
BA3A Generate the k-mer Composition of a String 505
BA3B Reconstruct a String from its Genome Path 466
BA3C Construct the Overlap Graph of a Collection of k-mers 412
BA3D Construct the De Bruijn Graph of a String 428
BA3E Construct the De Bruijn Graph of a Collection of k-mers 399
BA3F Find an Eulerian Cycle in a Graph 295
BA3G Find an Eulerian Path in a Graph 247
BA3H Reconstruct a String from its k-mer Composition 243
BA3I Find a k-Universal Circular String 191
BA3J Reconstruct a String from its Paired Composition 174
BA3K Generate Contigs from a Collection of Reads 169
BA3L Construct a String Spelled by a Gapped Genome Path 142
BA3M Generate All Maximal Non-Branching Paths in a Graph 123
BA4A Translate an RNA String into an Amino Acid String 349
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 258
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 258
BA4D Compute the Number of Peptides of Given Total Mass 151
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 187
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 155
BA4G Implement LeaderboardCyclopeptideSequencing 146
BA4H Generate the Convolution of a Spectrum 149
BA4I Implement ConvolutionCyclopeptideSequencing 108
BA4J Generate the Theoretical Spectrum of a Linear Peptide 170
BA4K Compute the Score of a Linear Peptide 133
BA4L Trim a Peptide Leaderboard 116
BA4M Solve the Turnpike Problem 68
BA5A Find the Minimum Number of Coins Needed to Make Change 468
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 376
BA5C Find a Longest Common Subsequence of Two Strings 467
BA5D Find the Longest Path in a DAG 309
BA5E Find a Highest-Scoring Alignment of Two Strings 414
BA5F Find a Highest-Scoring Local Alignment of Two Strings 337
BA5G Compute the Edit Distance Between Two Strings 412
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 261
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 239
BA5J Align Two Strings Using Affine Gap Penalties 252
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 166
BA5L Align Two Strings Using Linear Space 146
BA5M Find a Highest-Scoring Multiple Sequence Alignment 169
BA5N Find a Topological Ordering of a DAG 110
BA6A Implement GreedySorting to Sort a Permutation by Reversals 271
BA6B Compute the Number of Breakpoints in a Permutation 296
BA6C Compute the 2-Break Distance Between a Pair of Genomes 195
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 57
BA6E Find All Shared k-mers of a Pair of Strings 200
BA6F Implement ChromosomeToCycle 117
BA6G Implement CycleToChromosome 112
BA6H Implement ColoredEdges 102
BA6I Implement GraphToGenome 83
BA6J Implement 2-BreakOnGenomeGraph 77
BA6K Implement 2-BreakOnGenome 67
BA7A Compute Distances Between Leaves 133
BA7B Compute Limb Lengths in a Tree 141
BA7C Implement AdditivePhylogeny 94
BA7D Implement UPGMA 89
BA7E Implement the Neighbor Joining Algorithm 77
BA7F Implement SmallParsimony 68
BA7G Adapt SmallParsimony to Unrooted Trees 43
BA8A Implement FarthestFirstTraversal 99
BA8B Compute the Squared Error Distortion 95
BA8C Implement the Lloyd Algorithm for k-Means Clustering 101
BA8D Implement the Soft k-Means Clustering Algorithm 82
BA8E Implement Hierarchical Clustering 78
BA9A Construct a Trie from a Collection of Patterns 233
BA9B Implement TrieMatching 206
BA9C Construct the Suffix Tree of a String 159
BA9D Find the Longest Repeat in a String 185
BA9E Find the Longest Substring Shared by Two Strings 175
BA9F Find the Shortest Non-Shared Substring of Two Strings 140
BA9G Construct the Suffix Array of a String 185
BA9H Pattern Matching with the Suffix Array 99
BA9I Construct the Burrows-Wheeler Transform of a String 220
BA9J Reconstruct a String from its Burrows-Wheeler Transform 182
BA9K Generate the Last-to-First Mapping of a String 112
BA9L Implement BWMatching 142
BA9M Implement BetterBWMatching 128
BA9N Find All Occurrences of a Collection of Patterns in a String 140
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 111
BA9P Implement TreeColoring 55
BA9Q Construct the Partial Suffix Array of a String 113
BA9R Construct a Suffix Tree from a Suffix Array 85