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: Sultanmurad vs. “Finding a Motif in DNA”, 1 minute ago
Problems: 285 (total), users: 64678, attempts: 1073150, correct: 598558
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 448
BA10B Compute the Probability of an Outcome Given a Hidden Path 381
BA10C Implement the Viterbi Algorithm 240
BA10D Compute the Probability of a String Emitted by an HMM 208
BA10E Construct a Profile HMM 129
BA10F Construct a Profile HMM with Pseudocounts 119
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 63
BA10H Estimate the Parameters of an HMM 83
BA10I Implement Viterbi Learning 74
BA10J Solve the Soft Decoding Problem 78
BA10K Implement Baum-Welch Learning 60
BA11A Construct the Graph of a Spectrum 110
BA11B Implement DecodingIdealSpectrum 82
BA11C Convert a Peptide into a Peptide Vector 116
BA11D Convert a Peptide Vector into a Peptide 109
BA11E Sequence a Peptide 66
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 66
BA11G Implement PSMSearch 65
BA11H Compute the Size of a Spectral Dictionary 54
BA11I Compute the Probability of a Spectral Dictionary 54
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 43
BA1A Compute the Number of Times a Pattern Appears in a Text 985
BA1B Find the Most Frequent Words in a String 1149
BA1C Find the Reverse Complement of a String 1105
BA1D Find All Occurrences of a Pattern in a String 1004
BA1E Find Patterns Forming Clumps in a String 791
BA1F Find a Position in a Genome Minimizing the Skew 768
BA1G Compute the Hamming Distance Between Two Strings 847
BA1H Find All Approximate Occurrences of a Pattern in a String 728
BA1I Find the Most Frequent Words with Mismatches in a String 591
BA1J Find Frequent Words with Mismatches and Reverse Complements 533
BA1K Generate the Frequency Array of a String 487
BA1L Implement PatternToNumber 545
BA1M Implement NumberToPattern 508
BA1N Generate the d-Neighborhood of a String 537
BA2A Implement MotifEnumeration 439
BA2B Find a Median String 437
BA2C Find a Profile-most Probable k-mer in a String 461
BA2D Implement GreedyMotifSearch 385
BA2E Implement GreedyMotifSearch with Pseudocounts 332
BA2F Implement RandomizedMotifSearch 265
BA2G Implement GibbsSampler 241
BA2H Implement DistanceBetweenPatternAndStrings 306
BA3A Generate the k-mer Composition of a String 565
BA3B Reconstruct a String from its Genome Path 501
BA3C Construct the Overlap Graph of a Collection of k-mers 470
BA3D Construct the De Bruijn Graph of a String 472
BA3E Construct the De Bruijn Graph of a Collection of k-mers 427
BA3F Find an Eulerian Cycle in a Graph 324
BA3G Find an Eulerian Path in a Graph 268
BA3H Reconstruct a String from its k-mer Composition 270
BA3I Find a k-Universal Circular String 211
BA3J Reconstruct a String from its Paired Composition 190
BA3K Generate Contigs from a Collection of Reads 190
BA3L Construct a String Spelled by a Gapped Genome Path 158
BA3M Generate All Maximal Non-Branching Paths in a Graph 140
BA4A Translate an RNA String into an Amino Acid String 371
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 280
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 274
BA4D Compute the Number of Peptides of Given Total Mass 168
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 206
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 166
BA4G Implement LeaderboardCyclopeptideSequencing 158
BA4H Generate the Convolution of a Spectrum 159
BA4I Implement ConvolutionCyclopeptideSequencing 117
BA4J Generate the Theoretical Spectrum of a Linear Peptide 181
BA4K Compute the Score of a Linear Peptide 140
BA4L Trim a Peptide Leaderboard 125
BA4M Solve the Turnpike Problem 71
BA5A Find the Minimum Number of Coins Needed to Make Change 481
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 392
BA5C Find a Longest Common Subsequence of Two Strings 484
BA5D Find the Longest Path in a DAG 319
BA5E Find a Highest-Scoring Alignment of Two Strings 454
BA5F Find a Highest-Scoring Local Alignment of Two Strings 370
BA5G Compute the Edit Distance Between Two Strings 440
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 269
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 246
BA5J Align Two Strings Using Affine Gap Penalties 275
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 176
BA5L Align Two Strings Using Linear Space 158
BA5M Find a Highest-Scoring Multiple Sequence Alignment 177
BA5N Find a Topological Ordering of a DAG 122
BA6A Implement GreedySorting to Sort a Permutation by Reversals 284
BA6B Compute the Number of Breakpoints in a Permutation 312
BA6C Compute the 2-Break Distance Between a Pair of Genomes 205
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 63
BA6E Find All Shared k-mers of a Pair of Strings 207
BA6F Implement ChromosomeToCycle 122
BA6G Implement CycleToChromosome 118
BA6H Implement ColoredEdges 108
BA6I Implement GraphToGenome 89
BA6J Implement 2-BreakOnGenomeGraph 83
BA6K Implement 2-BreakOnGenome 75
BA7A Compute Distances Between Leaves 138
BA7B Compute Limb Lengths in a Tree 148
BA7C Implement AdditivePhylogeny 104
BA7D Implement UPGMA 100
BA7E Implement the Neighbor Joining Algorithm 84
BA7F Implement SmallParsimony 78
BA7G Adapt SmallParsimony to Unrooted Trees 47
BA8A Implement FarthestFirstTraversal 109
BA8B Compute the Squared Error Distortion 103
BA8C Implement the Lloyd Algorithm for k-Means Clustering 115
BA8D Implement the Soft k-Means Clustering Algorithm 93
BA8E Implement Hierarchical Clustering 89
BA9A Construct a Trie from a Collection of Patterns 242
BA9B Implement TrieMatching 216
BA9C Construct the Suffix Tree of a String 167
BA9D Find the Longest Repeat in a String 195
BA9E Find the Longest Substring Shared by Two Strings 182
BA9F Find the Shortest Non-Shared Substring of Two Strings 148
BA9G Construct the Suffix Array of a String 199
BA9H Pattern Matching with the Suffix Array 108
BA9I Construct the Burrows-Wheeler Transform of a String 239
BA9J Reconstruct a String from its Burrows-Wheeler Transform 196
BA9K Generate the Last-to-First Mapping of a String 124
BA9L Implement BWMatching 154
BA9M Implement BetterBWMatching 139
BA9N Find All Occurrences of a Collection of Patterns in a String 150
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 117
BA9P Implement TreeColoring 59
BA9Q Construct the Partial Suffix Array of a String 119
BA9R Construct a Suffix Tree from a Suffix Array 90