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: a3chiang vs. “Find a Median String”, just now
Problems: 285 (total), users: 51975, attempts: 872292, correct: 490760
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 350
BA10B Compute the Probability of an Outcome Given a Hidden Path 301
BA10C Implement the Viterbi Algorithm 185
BA10D Compute the Probability of a String Emitted by an HMM 164
BA10E Construct a Profile HMM 108
BA10F Construct a Profile HMM with Pseudocounts 98
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 51
BA10K Implement Baum-Welch Learning 37
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 735
BA1B Find the Most Frequent Words in a String 888
BA1C Find the Reverse Complement of a String 845
BA1D Find All Occurrences of a Pattern in a String 765
BA1E Find Patterns Forming Clumps in a String 576
BA1F Find a Position in a Genome Minimizing the Skew 578
BA1G Compute the Hamming Distance Between Two Strings 635
BA1H Find All Approximate Occurrences of a Pattern in a String 553
BA1I Find the Most Frequent Words with Mismatches in a String 445
BA1J Find Frequent Words with Mismatches and Reverse Complements 394
BA1K Generate the Frequency Array of a String 356
BA1L Implement PatternToNumber 402
BA1M Implement NumberToPattern 367
BA1N Generate the d-Neighborhood of a String 406
BA2A Implement MotifEnumeration 343
BA2B Find a Median String 319
BA2C Find a Profile-most Probable k-mer in a String 338
BA2D Implement GreedyMotifSearch 268
BA2E Implement GreedyMotifSearch with Pseudocounts 224
BA2F Implement RandomizedMotifSearch 180
BA2G Implement GibbsSampler 162
BA2H Implement DistanceBetweenPatternAndStrings 214
BA3A Generate the k-mer Composition of a String 409
BA3B Reconstruct a String from its Genome Path 379
BA3C Construct the Overlap Graph of a Collection of k-mers 322
BA3D Construct the De Bruijn Graph of a String 345
BA3E Construct the De Bruijn Graph of a Collection of k-mers 313
BA3F Find an Eulerian Cycle in a Graph 237
BA3G Find an Eulerian Path in a Graph 191
BA3H Reconstruct a String from its k-mer Composition 189
BA3I Find a k-Universal Circular String 142
BA3J Reconstruct a String from its Paired Composition 138
BA3K Generate Contigs from a Collection of Reads 145
BA3L Construct a String Spelled by a Gapped Genome Path 113
BA3M Generate All Maximal Non-Branching Paths in a Graph 98
BA4A Translate an RNA String into an Amino Acid String 281
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 196
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 191
BA4D Compute the Number of Peptides of Given Total Mass 105
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 136
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 110
BA4G Implement LeaderboardCyclopeptideSequencing 108
BA4H Generate the Convolution of a Spectrum 109
BA4I Implement ConvolutionCyclopeptideSequencing 77
BA4J Generate the Theoretical Spectrum of a Linear Peptide 114
BA4K Compute the Score of a Linear Peptide 97
BA4L Trim a Peptide Leaderboard 84
BA4M Solve the Turnpike Problem 55
BA5A Find the Minimum Number of Coins Needed to Make Change 414
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 338
BA5C Find a Longest Common Subsequence of Two Strings 419
BA5D Find the Longest Path in a DAG 277
BA5E Find a Highest-Scoring Alignment of Two Strings 364
BA5F Find a Highest-Scoring Local Alignment of Two Strings 310
BA5G Compute the Edit Distance Between Two Strings 376
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 234
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 217
BA5J Align Two Strings Using Affine Gap Penalties 226
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 153
BA5L Align Two Strings Using Linear Space 135
BA5M Find a Highest-Scoring Multiple Sequence Alignment 156
BA5N Find a Topological Ordering of a DAG 90
BA6A Implement GreedySorting to Sort a Permutation by Reversals 245
BA6B Compute the Number of Breakpoints in a Permutation 266
BA6C Compute the 2-Break Distance Between a Pair of Genomes 169
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 41
BA6E Find All Shared k-mers of a Pair of Strings 178
BA6F Implement ChromosomeToCycle 99
BA6G Implement CycleToChromosome 94
BA6H Implement ColoredEdges 86
BA6I Implement GraphToGenome 70
BA6J Implement 2-BreakOnGenomeGraph 62
BA6K Implement 2-BreakOnGenome 47
BA7A Compute Distances Between Leaves 109
BA7B Compute Limb Lengths in a Tree 114
BA7C Implement AdditivePhylogeny 77
BA7D Implement UPGMA 72
BA7E Implement the Neighbor Joining Algorithm 59
BA7F Implement SmallParsimony 49
BA7G Adapt SmallParsimony to Unrooted Trees 30
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 205
BA9B Implement TrieMatching 181
BA9C Construct the Suffix Tree of a String 141
BA9D Find the Longest Repeat in a String 167
BA9E Find the Longest Substring Shared by Two Strings 157
BA9F Find the Shortest Non-Shared Substring of Two Strings 124
BA9G Construct the Suffix Array of a String 169
BA9H Pattern Matching with the Suffix Array 83
BA9I Construct the Burrows-Wheeler Transform of a String 194
BA9J Reconstruct a String from its Burrows-Wheeler Transform 161
BA9K Generate the Last-to-First Mapping of a String 86
BA9L Implement BWMatching 121
BA9M Implement BetterBWMatching 112
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 95
BA9P Implement TreeColoring 42
BA9Q Construct the Partial Suffix Array of a String 99
BA9R Construct a Suffix Tree from a Suffix Array 72