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: bshrestha617 vs. “Translating RNA into Protein”, 35 minutes ago
Problems: 285 (total), users: 63750, attempts: 1057029, correct: 589772
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 441
BA10B Compute the Probability of an Outcome Given a Hidden Path 373
BA10C Implement the Viterbi Algorithm 233
BA10D Compute the Probability of a String Emitted by an HMM 203
BA10E Construct a Profile HMM 128
BA10F Construct a Profile HMM with Pseudocounts 116
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 62
BA10H Estimate the Parameters of an HMM 82
BA10I Implement Viterbi Learning 74
BA10J Solve the Soft Decoding Problem 77
BA10K Implement Baum-Welch Learning 60
BA11A Construct the Graph of a Spectrum 108
BA11B Implement DecodingIdealSpectrum 81
BA11C Convert a Peptide into a Peptide Vector 113
BA11D Convert a Peptide Vector into a Peptide 107
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 966
BA1B Find the Most Frequent Words in a String 1129
BA1C Find the Reverse Complement of a String 1085
BA1D Find All Occurrences of a Pattern in a String 985
BA1E Find Patterns Forming Clumps in a String 775
BA1F Find a Position in a Genome Minimizing the Skew 746
BA1G Compute the Hamming Distance Between Two Strings 830
BA1H Find All Approximate Occurrences of a Pattern in a String 708
BA1I Find the Most Frequent Words with Mismatches in a String 579
BA1J Find Frequent Words with Mismatches and Reverse Complements 517
BA1K Generate the Frequency Array of a String 474
BA1L Implement PatternToNumber 534
BA1M Implement NumberToPattern 498
BA1N Generate the d-Neighborhood of a String 522
BA2A Implement MotifEnumeration 430
BA2B Find a Median String 426
BA2C Find a Profile-most Probable k-mer in a String 452
BA2D Implement GreedyMotifSearch 374
BA2E Implement GreedyMotifSearch with Pseudocounts 320
BA2F Implement RandomizedMotifSearch 256
BA2G Implement GibbsSampler 232
BA2H Implement DistanceBetweenPatternAndStrings 294
BA3A Generate the k-mer Composition of a String 549
BA3B Reconstruct a String from its Genome Path 486
BA3C Construct the Overlap Graph of a Collection of k-mers 454
BA3D Construct the De Bruijn Graph of a String 456
BA3E Construct the De Bruijn Graph of a Collection of k-mers 415
BA3F Find an Eulerian Cycle in a Graph 313
BA3G Find an Eulerian Path in a Graph 259
BA3H Reconstruct a String from its k-mer Composition 257
BA3I Find a k-Universal Circular String 201
BA3J Reconstruct a String from its Paired Composition 183
BA3K Generate Contigs from a Collection of Reads 184
BA3L Construct a String Spelled by a Gapped Genome Path 150
BA3M Generate All Maximal Non-Branching Paths in a Graph 136
BA4A Translate an RNA String into an Amino Acid String 362
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 268
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 270
BA4D Compute the Number of Peptides of Given Total Mass 158
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 199
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 161
BA4G Implement LeaderboardCyclopeptideSequencing 151
BA4H Generate the Convolution of a Spectrum 156
BA4I Implement ConvolutionCyclopeptideSequencing 112
BA4J Generate the Theoretical Spectrum of a Linear Peptide 176
BA4K Compute the Score of a Linear Peptide 136
BA4L Trim a Peptide Leaderboard 120
BA4M Solve the Turnpike Problem 71
BA5A Find the Minimum Number of Coins Needed to Make Change 473
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 386
BA5C Find a Longest Common Subsequence of Two Strings 480
BA5D Find the Longest Path in a DAG 314
BA5E Find a Highest-Scoring Alignment of Two Strings 438
BA5F Find a Highest-Scoring Local Alignment of Two Strings 361
BA5G Compute the Edit Distance Between Two Strings 435
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 267
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 244
BA5J Align Two Strings Using Affine Gap Penalties 271
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 174
BA5L Align Two Strings Using Linear Space 153
BA5M Find a Highest-Scoring Multiple Sequence Alignment 175
BA5N Find a Topological Ordering of a DAG 120
BA6A Implement GreedySorting to Sort a Permutation by Reversals 275
BA6B Compute the Number of Breakpoints in a Permutation 301
BA6C Compute the 2-Break Distance Between a Pair of Genomes 199
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 60
BA6E Find All Shared k-mers of a Pair of Strings 203
BA6F Implement ChromosomeToCycle 121
BA6G Implement CycleToChromosome 116
BA6H Implement ColoredEdges 106
BA6I Implement GraphToGenome 87
BA6J Implement 2-BreakOnGenomeGraph 80
BA6K Implement 2-BreakOnGenome 70
BA7A Compute Distances Between Leaves 136
BA7B Compute Limb Lengths in a Tree 145
BA7C Implement AdditivePhylogeny 98
BA7D Implement UPGMA 95
BA7E Implement the Neighbor Joining Algorithm 81
BA7F Implement SmallParsimony 72
BA7G Adapt SmallParsimony to Unrooted Trees 46
BA8A Implement FarthestFirstTraversal 108
BA8B Compute the Squared Error Distortion 102
BA8C Implement the Lloyd Algorithm for k-Means Clustering 110
BA8D Implement the Soft k-Means Clustering Algorithm 89
BA8E Implement Hierarchical Clustering 83
BA9A Construct a Trie from a Collection of Patterns 238
BA9B Implement TrieMatching 211
BA9C Construct the Suffix Tree of a String 166
BA9D Find the Longest Repeat in a String 192
BA9E Find the Longest Substring Shared by Two Strings 180
BA9F Find the Shortest Non-Shared Substring of Two Strings 146
BA9G Construct the Suffix Array of a String 190
BA9H Pattern Matching with the Suffix Array 103
BA9I Construct the Burrows-Wheeler Transform of a String 231
BA9J Reconstruct a String from its Burrows-Wheeler Transform 189
BA9K Generate the Last-to-First Mapping of a String 119
BA9L Implement BWMatching 150
BA9M Implement BetterBWMatching 132
BA9N Find All Occurrences of a Collection of Patterns in a String 145
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 115
BA9P Implement TreeColoring 59
BA9Q Construct the Partial Suffix Array of a String 119
BA9R Construct a Suffix Tree from a Suffix Array 90