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: mj.ste vs. “Counting Point Mutations”, 9 minutes ago
Problems: 284 (total), users: 100445, attempts: 1660643, correct: 915530
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 751
BA10B Compute the Probability of an Outcome Given a Hidden Path 622
BA10C Implement the Viterbi Algorithm 460
BA10D Compute the Probability of a String Emitted by an HMM 318
BA10E Construct a Profile HMM 181
BA10F Construct a Profile HMM with Pseudocounts 173
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 97
BA10H Estimate the Parameters of an HMM 154
BA10I Implement Viterbi Learning 118
BA10J Solve the Soft Decoding Problem 135
BA10K Implement Baum-Welch Learning 129
BA11A Construct the Graph of a Spectrum 173
BA11B Implement DecodingIdealSpectrum 126
BA11C Convert a Peptide into a Peptide Vector 177
BA11D Convert a Peptide Vector into a Peptide 171
BA11E Sequence a Peptide 103
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 103
BA11G Implement PSMSearch 96
BA11H Compute the Size of a Spectral Dictionary 90
BA11I Compute the Probability of a Spectral Dictionary 88
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 65
BA1A Compute the Number of Times a Pattern Appears in a Text 2456
BA1B Find the Most Frequent Words in a String 2541
BA1C Find the Reverse Complement of a String 2431
BA1D Find All Occurrences of a Pattern in a String 2329
BA1E Find Patterns Forming Clumps in a String 2018
BA1F Find a Position in a Genome Minimizing the Skew 1960
BA1G Compute the Hamming Distance Between Two Strings 2032
BA1H Find All Approximate Occurrences of a Pattern in a String 1563
BA1I Find the Most Frequent Words with Mismatches in a String 1276
BA1J Find Frequent Words with Mismatches and Reverse Complements 1158
BA1K Generate the Frequency Array of a String 1032
BA1L Implement PatternToNumber 1225
BA1M Implement NumberToPattern 1177
BA1N Generate the d-Neighborhood of a String 1062
BA2A Implement MotifEnumeration 1071
BA2B Find a Median String 1069
BA2C Find a Profile-most Probable k-mer in a String 962
BA2D Implement GreedyMotifSearch 906
BA2E Implement GreedyMotifSearch with Pseudocounts 786
BA2F Implement RandomizedMotifSearch 715
BA2G Implement GibbsSampler 566
BA2H Implement DistanceBetweenPatternAndStrings 840
BA3A Generate the k-mer Composition of a String 1163
BA3B Reconstruct a String from its Genome Path 1088
BA3C Construct the Overlap Graph of a Collection of k-mers 1007
BA3D Construct the De Bruijn Graph of a String 984
BA3E Construct the De Bruijn Graph of a Collection of k-mers 892
BA3F Find an Eulerian Cycle in a Graph 689
BA3G Find an Eulerian Path in a Graph 622
BA3H Reconstruct a String from its k-mer Composition 736
BA3I Find a k-Universal Circular String 498
BA3J Reconstruct a String from its Paired Composition 486
BA3K Generate Contigs from a Collection of Reads 390
BA3L Construct a String Spelled by a Gapped Genome Path 377
BA3M Generate All Maximal Non-Branching Paths in a Graph 289
BA4A Translate an RNA String into an Amino Acid String 785
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 693
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 628
BA4D Compute the Number of Peptides of Given Total Mass 467
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 498
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 390
BA4G Implement LeaderboardCyclopeptideSequencing 385
BA4H Generate the Convolution of a Spectrum 373
BA4I Implement ConvolutionCyclopeptideSequencing 251
BA4J Generate the Theoretical Spectrum of a Linear Peptide 364
BA4K Compute the Score of a Linear Peptide 309
BA4L Trim a Peptide Leaderboard 277
BA4M Solve the Turnpike Problem 159
BA5A Find the Minimum Number of Coins Needed to Make Change 831
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 678
BA5C Find a Longest Common Subsequence of Two Strings 789
BA5D Find the Longest Path in a DAG 493
BA5E Find a Highest-Scoring Alignment of Two Strings 740
BA5F Find a Highest-Scoring Local Alignment of Two Strings 596
BA5G Compute the Edit Distance Between Two Strings 634
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 414
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 367
BA5J Align Two Strings Using Affine Gap Penalties 490
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 272
BA5L Align Two Strings Using Linear Space 236
BA5M Find a Highest-Scoring Multiple Sequence Alignment 275
BA5N Find a Topological Ordering of a DAG 240
BA6A Implement GreedySorting to Sort a Permutation by Reversals 435
BA6B Compute the Number of Breakpoints in a Permutation 487
BA6C Compute the 2-Break Distance Between a Pair of Genomes 324
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 169
BA6E Find All Shared k-mers of a Pair of Strings 266
BA6F Implement ChromosomeToCycle 220
BA6G Implement CycleToChromosome 215
BA6H Implement ColoredEdges 194
BA6I Implement GraphToGenome 159
BA6J Implement 2-BreakOnGenomeGraph 169
BA6K Implement 2-BreakOnGenome 137
BA7A Compute Distances Between Leaves 256
BA7B Compute Limb Lengths in a Tree 289
BA7C Implement AdditivePhylogeny 255
BA7D Implement UPGMA 203
BA7E Implement the Neighbor Joining Algorithm 192
BA7F Implement SmallParsimony 133
BA7G Adapt SmallParsimony to Unrooted Trees 97
BA8A Implement FarthestFirstTraversal 189
BA8B Compute the Squared Error Distortion 192
BA8C Implement the Lloyd Algorithm for k-Means Clustering 217
BA8D Implement the Soft k-Means Clustering Algorithm 146
BA8E Implement Hierarchical Clustering 153
BA9A Construct a Trie from a Collection of Patterns 357
BA9B Implement TrieMatching 359
BA9C Construct the Suffix Tree of a String 267
BA9D Find the Longest Repeat in a String 339
BA9E Find the Longest Substring Shared by Two Strings 266
BA9F Find the Shortest Non-Shared Substring of Two Strings 220
BA9G Construct the Suffix Array of a String 331
BA9H Pattern Matching with the Suffix Array 241
BA9I Construct the Burrows-Wheeler Transform of a String 375
BA9J Reconstruct a String from its Burrows-Wheeler Transform 320
BA9K Generate the Last-to-First Mapping of a String 259
BA9L Implement BWMatching 237
BA9M Implement BetterBWMatching 206
BA9N Find All Occurrences of a Collection of Patterns in a String 214
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 197
BA9P Implement TreeColoring 98
BA9Q Construct the Partial Suffix Array of a String 169
BA9R Construct a Suffix Tree from a Suffix Array 124