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: Toemba vs. “Counting DNA Nucleotides”, 7 minutes ago
Problems: 285 (total), users: 53691, attempts: 897765, correct: 504717
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 357
BA10B Compute the Probability of an Outcome Given a Hidden Path 307
BA10C Implement the Viterbi Algorithm 187
BA10D Compute the Probability of a String Emitted by an HMM 166
BA10E Construct a Profile HMM 110
BA10F Construct a Profile HMM with Pseudocounts 100
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 48
BA10H Estimate the Parameters of an HMM 61
BA10I Implement Viterbi Learning 50
BA10J Solve the Soft Decoding Problem 53
BA10K Implement Baum-Welch Learning 38
BA11A Construct the Graph of a Spectrum 83
BA11B Implement DecodingIdealSpectrum 59
BA11C Convert a Peptide into a Peptide Vector 89
BA11D Convert a Peptide Vector into a Peptide 83
BA11E Sequence a Peptide 47
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 49
BA11G Implement PSMSearch 47
BA11H Compute the Size of a Spectral Dictionary 40
BA11I Compute the Probability of a Spectral Dictionary 39
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 30
BA1A Compute the Number of Times a Pattern Appears in a Text 755
BA1B Find the Most Frequent Words in a String 911
BA1C Find the Reverse Complement of a String 864
BA1D Find All Occurrences of a Pattern in a String 783
BA1E Find Patterns Forming Clumps in a String 593
BA1F Find a Position in a Genome Minimizing the Skew 596
BA1G Compute the Hamming Distance Between Two Strings 655
BA1H Find All Approximate Occurrences of a Pattern in a String 570
BA1I Find the Most Frequent Words with Mismatches in a String 456
BA1J Find Frequent Words with Mismatches and Reverse Complements 408
BA1K Generate the Frequency Array of a String 369
BA1L Implement PatternToNumber 415
BA1M Implement NumberToPattern 380
BA1N Generate the d-Neighborhood of a String 418
BA2A Implement MotifEnumeration 350
BA2B Find a Median String 330
BA2C Find a Profile-most Probable k-mer in a String 351
BA2D Implement GreedyMotifSearch 282
BA2E Implement GreedyMotifSearch with Pseudocounts 233
BA2F Implement RandomizedMotifSearch 190
BA2G Implement GibbsSampler 171
BA2H Implement DistanceBetweenPatternAndStrings 220
BA3A Generate the k-mer Composition of a String 420
BA3B Reconstruct a String from its Genome Path 391
BA3C Construct the Overlap Graph of a Collection of k-mers 335
BA3D Construct the De Bruijn Graph of a String 358
BA3E Construct the De Bruijn Graph of a Collection of k-mers 323
BA3F Find an Eulerian Cycle in a Graph 247
BA3G Find an Eulerian Path in a Graph 200
BA3H Reconstruct a String from its k-mer Composition 198
BA3I Find a k-Universal Circular String 151
BA3J Reconstruct a String from its Paired Composition 145
BA3K Generate Contigs from a Collection of Reads 150
BA3L Construct a String Spelled by a Gapped Genome Path 119
BA3M Generate All Maximal Non-Branching Paths in a Graph 102
BA4A Translate an RNA String into an Amino Acid String 288
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 201
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 199
BA4D Compute the Number of Peptides of Given Total Mass 110
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 140
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 115
BA4G Implement LeaderboardCyclopeptideSequencing 111
BA4H Generate the Convolution of a Spectrum 114
BA4I Implement ConvolutionCyclopeptideSequencing 79
BA4J Generate the Theoretical Spectrum of a Linear Peptide 117
BA4K Compute the Score of a Linear Peptide 100
BA4L Trim a Peptide Leaderboard 86
BA4M Solve the Turnpike Problem 57
BA5A Find the Minimum Number of Coins Needed to Make Change 424
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 348
BA5C Find a Longest Common Subsequence of Two Strings 427
BA5D Find the Longest Path in a DAG 284
BA5E Find a Highest-Scoring Alignment of Two Strings 375
BA5F Find a Highest-Scoring Local Alignment of Two Strings 320
BA5G Compute the Edit Distance Between Two Strings 390
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 238
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 221
BA5J Align Two Strings Using Affine Gap Penalties 239
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 157
BA5L Align Two Strings Using Linear Space 137
BA5M Find a Highest-Scoring Multiple Sequence Alignment 161
BA5N Find a Topological Ordering of a DAG 96
BA6A Implement GreedySorting to Sort a Permutation by Reversals 248
BA6B Compute the Number of Breakpoints in a Permutation 269
BA6C Compute the 2-Break Distance Between a Pair of Genomes 173
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 46
BA6E Find All Shared k-mers of a Pair of Strings 183
BA6F Implement ChromosomeToCycle 102
BA6G Implement CycleToChromosome 97
BA6H Implement ColoredEdges 90
BA6I Implement GraphToGenome 74
BA6J Implement 2-BreakOnGenomeGraph 67
BA6K Implement 2-BreakOnGenome 55
BA7A Compute Distances Between Leaves 113
BA7B Compute Limb Lengths in a Tree 119
BA7C Implement AdditivePhylogeny 80
BA7D Implement UPGMA 75
BA7E Implement the Neighbor Joining Algorithm 61
BA7F Implement SmallParsimony 50
BA7G Adapt SmallParsimony to Unrooted Trees 32
BA8A Implement FarthestFirstTraversal 84
BA8B Compute the Squared Error Distortion 81
BA8C Implement the Lloyd Algorithm for k-Means Clustering 78
BA8D Implement the Soft k-Means Clustering Algorithm 70
BA8E Implement Hierarchical Clustering 68
BA9A Construct a Trie from a Collection of Patterns 211
BA9B Implement TrieMatching 186
BA9C Construct the Suffix Tree of a String 146
BA9D Find the Longest Repeat in a String 171
BA9E Find the Longest Substring Shared by Two Strings 160
BA9F Find the Shortest Non-Shared Substring of Two Strings 129
BA9G Construct the Suffix Array of a String 172
BA9H Pattern Matching with the Suffix Array 88
BA9I Construct the Burrows-Wheeler Transform of a String 201
BA9J Reconstruct a String from its Burrows-Wheeler Transform 166
BA9K Generate the Last-to-First Mapping of a String 91
BA9L Implement BWMatching 128
BA9M Implement BetterBWMatching 116
BA9N Find All Occurrences of a Collection of Patterns in a String 128
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 100
BA9P Implement TreeColoring 45
BA9Q Construct the Partial Suffix Array of a String 103
BA9R Construct a Suffix Tree from a Suffix Array 75