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: pnatsidis vs. “Consensus and Profile”, just now
Problems: 285 (total), users: 53103, attempts: 887330, correct: 498963
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 355
BA10B Compute the Probability of an Outcome Given a Hidden Path 306
BA10C Implement the Viterbi Algorithm 187
BA10D Compute the Probability of a String Emitted by an HMM 165
BA10E Construct a Profile HMM 109
BA10F Construct a Profile HMM with Pseudocounts 99
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 47
BA10H Estimate the Parameters of an HMM 60
BA10I Implement Viterbi Learning 49
BA10J Solve the Soft Decoding Problem 52
BA10K Implement Baum-Welch Learning 38
BA11A Construct the Graph of a Spectrum 82
BA11B Implement DecodingIdealSpectrum 58
BA11C Convert a Peptide into a Peptide Vector 88
BA11D Convert a Peptide Vector into a Peptide 82
BA11E Sequence a Peptide 46
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 48
BA11G Implement PSMSearch 46
BA11H Compute the Size of a Spectral Dictionary 39
BA11I Compute the Probability of a Spectral Dictionary 38
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 30
BA1A Compute the Number of Times a Pattern Appears in a Text 749
BA1B Find the Most Frequent Words in a String 904
BA1C Find the Reverse Complement of a String 859
BA1D Find All Occurrences of a Pattern in a String 778
BA1E Find Patterns Forming Clumps in a String 587
BA1F Find a Position in a Genome Minimizing the Skew 589
BA1G Compute the Hamming Distance Between Two Strings 647
BA1H Find All Approximate Occurrences of a Pattern in a String 560
BA1I Find the Most Frequent Words with Mismatches in a String 449
BA1J Find Frequent Words with Mismatches and Reverse Complements 400
BA1K Generate the Frequency Array of a String 363
BA1L Implement PatternToNumber 409
BA1M Implement NumberToPattern 374
BA1N Generate the d-Neighborhood of a String 412
BA2A Implement MotifEnumeration 346
BA2B Find a Median String 326
BA2C Find a Profile-most Probable k-mer in a String 347
BA2D Implement GreedyMotifSearch 278
BA2E Implement GreedyMotifSearch with Pseudocounts 229
BA2F Implement RandomizedMotifSearch 187
BA2G Implement GibbsSampler 167
BA2H Implement DistanceBetweenPatternAndStrings 217
BA3A Generate the k-mer Composition of a String 415
BA3B Reconstruct a String from its Genome Path 387
BA3C Construct the Overlap Graph of a Collection of k-mers 332
BA3D Construct the De Bruijn Graph of a String 352
BA3E Construct the De Bruijn Graph of a Collection of k-mers 319
BA3F Find an Eulerian Cycle in a Graph 242
BA3G Find an Eulerian Path in a Graph 196
BA3H Reconstruct a String from its k-mer Composition 193
BA3I Find a k-Universal Circular String 146
BA3J Reconstruct a String from its Paired Composition 140
BA3K Generate Contigs from a Collection of Reads 147
BA3L Construct a String Spelled by a Gapped Genome Path 115
BA3M Generate All Maximal Non-Branching Paths in a Graph 100
BA4A Translate an RNA String into an Amino Acid String 284
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 197
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 192
BA4D Compute the Number of Peptides of Given Total Mass 106
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 136
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 111
BA4G Implement LeaderboardCyclopeptideSequencing 108
BA4H Generate the Convolution of a Spectrum 110
BA4I Implement ConvolutionCyclopeptideSequencing 77
BA4J Generate the Theoretical Spectrum of a Linear Peptide 115
BA4K Compute the Score of a Linear Peptide 98
BA4L Trim a Peptide Leaderboard 84
BA4M Solve the Turnpike Problem 55
BA5A Find the Minimum Number of Coins Needed to Make Change 418
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 339
BA5C Find a Longest Common Subsequence of Two Strings 423
BA5D Find the Longest Path in a DAG 280
BA5E Find a Highest-Scoring Alignment of Two Strings 368
BA5F Find a Highest-Scoring Local Alignment of Two Strings 312
BA5G Compute the Edit Distance Between Two Strings 379
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 234
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 218
BA5J Align Two Strings Using Affine Gap Penalties 230
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 154
BA5L Align Two Strings Using Linear Space 135
BA5M Find a Highest-Scoring Multiple Sequence Alignment 158
BA5N Find a Topological Ordering of a DAG 93
BA6A Implement GreedySorting to Sort a Permutation by Reversals 246
BA6B Compute the Number of Breakpoints in a Permutation 267
BA6C Compute the 2-Break Distance Between a Pair of Genomes 171
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 42
BA6E Find All Shared k-mers of a Pair of Strings 181
BA6F Implement ChromosomeToCycle 100
BA6G Implement CycleToChromosome 95
BA6H Implement ColoredEdges 87
BA6I Implement GraphToGenome 71
BA6J Implement 2-BreakOnGenomeGraph 64
BA6K Implement 2-BreakOnGenome 50
BA7A Compute Distances Between Leaves 111
BA7B Compute Limb Lengths in a Tree 117
BA7C Implement AdditivePhylogeny 79
BA7D Implement UPGMA 74
BA7E Implement the Neighbor Joining Algorithm 60
BA7F Implement SmallParsimony 49
BA7G Adapt SmallParsimony to Unrooted Trees 31
BA8A Implement FarthestFirstTraversal 81
BA8B Compute the Squared Error Distortion 78
BA8C Implement the Lloyd Algorithm for k-Means Clustering 72
BA8D Implement the Soft k-Means Clustering Algorithm 66
BA8E Implement Hierarchical Clustering 65
BA9A Construct a Trie from a Collection of Patterns 208
BA9B Implement TrieMatching 183
BA9C Construct the Suffix Tree of a String 144
BA9D Find the Longest Repeat in a String 169
BA9E Find the Longest Substring Shared by Two Strings 158
BA9F Find the Shortest Non-Shared Substring of Two Strings 125
BA9G Construct the Suffix Array of a String 170
BA9H Pattern Matching with the Suffix Array 84
BA9I Construct the Burrows-Wheeler Transform of a String 199
BA9J Reconstruct a String from its Burrows-Wheeler Transform 165
BA9K Generate the Last-to-First Mapping of a String 88
BA9L Implement BWMatching 124
BA9M Implement BetterBWMatching 113
BA9N Find All Occurrences of a Collection of Patterns in a String 123
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 96
BA9P Implement TreeColoring 42
BA9Q Construct the Partial Suffix Array of a String 100
BA9R Construct a Suffix Tree from a Suffix Array 72