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: cxrjj vs. “Inferring Genotype from a Pedigree”, 1 minute ago
Problems: 285 (total), users: 57797, attempts: 968324, correct: 543146
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 394
BA10B Compute the Probability of an Outcome Given a Hidden Path 335
BA10C Implement the Viterbi Algorithm 203
BA10D Compute the Probability of a String Emitted by an HMM 180
BA10E Construct a Profile HMM 118
BA10F Construct a Profile HMM with Pseudocounts 109
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 54
BA10H Estimate the Parameters of an HMM 68
BA10I Implement Viterbi Learning 59
BA10J Solve the Soft Decoding Problem 59
BA10K Implement Baum-Welch Learning 46
BA11A Construct the Graph of a Spectrum 95
BA11B Implement DecodingIdealSpectrum 67
BA11C Convert a Peptide into a Peptide Vector 99
BA11D Convert a Peptide Vector into a Peptide 93
BA11E Sequence a Peptide 55
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 55
BA11G Implement PSMSearch 54
BA11H Compute the Size of a Spectral Dictionary 45
BA11I Compute the Probability of a Spectral Dictionary 45
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 36
BA1A Compute the Number of Times a Pattern Appears in a Text 837
BA1B Find the Most Frequent Words in a String 999
BA1C Find the Reverse Complement of a String 950
BA1D Find All Occurrences of a Pattern in a String 868
BA1E Find Patterns Forming Clumps in a String 666
BA1F Find a Position in a Genome Minimizing the Skew 652
BA1G Compute the Hamming Distance Between Two Strings 718
BA1H Find All Approximate Occurrences of a Pattern in a String 620
BA1I Find the Most Frequent Words with Mismatches in a String 495
BA1J Find Frequent Words with Mismatches and Reverse Complements 443
BA1K Generate the Frequency Array of a String 410
BA1L Implement PatternToNumber 465
BA1M Implement NumberToPattern 427
BA1N Generate the d-Neighborhood of a String 452
BA2A Implement MotifEnumeration 373
BA2B Find a Median String 364
BA2C Find a Profile-most Probable k-mer in a String 381
BA2D Implement GreedyMotifSearch 310
BA2E Implement GreedyMotifSearch with Pseudocounts 263
BA2F Implement RandomizedMotifSearch 215
BA2G Implement GibbsSampler 199
BA2H Implement DistanceBetweenPatternAndStrings 247
BA3A Generate the k-mer Composition of a String 453
BA3B Reconstruct a String from its Genome Path 423
BA3C Construct the Overlap Graph of a Collection of k-mers 368
BA3D Construct the De Bruijn Graph of a String 385
BA3E Construct the De Bruijn Graph of a Collection of k-mers 356
BA3F Find an Eulerian Cycle in a Graph 269
BA3G Find an Eulerian Path in a Graph 222
BA3H Reconstruct a String from its k-mer Composition 216
BA3I Find a k-Universal Circular String 164
BA3J Reconstruct a String from its Paired Composition 157
BA3K Generate Contigs from a Collection of Reads 159
BA3L Construct a String Spelled by a Gapped Genome Path 132
BA3M Generate All Maximal Non-Branching Paths in a Graph 111
BA4A Translate an RNA String into an Amino Acid String 307
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 218
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 216
BA4D Compute the Number of Peptides of Given Total Mass 121
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 153
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 126
BA4G Implement LeaderboardCyclopeptideSequencing 119
BA4H Generate the Convolution of a Spectrum 121
BA4I Implement ConvolutionCyclopeptideSequencing 89
BA4J Generate the Theoretical Spectrum of a Linear Peptide 127
BA4K Compute the Score of a Linear Peptide 108
BA4L Trim a Peptide Leaderboard 94
BA4M Solve the Turnpike Problem 63
BA5A Find the Minimum Number of Coins Needed to Make Change 441
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 356
BA5C Find a Longest Common Subsequence of Two Strings 444
BA5D Find the Longest Path in a DAG 291
BA5E Find a Highest-Scoring Alignment of Two Strings 389
BA5F Find a Highest-Scoring Local Alignment of Two Strings 330
BA5G Compute the Edit Distance Between Two Strings 403
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 246
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 230
BA5J Align Two Strings Using Affine Gap Penalties 246
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 164
BA5L Align Two Strings Using Linear Space 143
BA5M Find a Highest-Scoring Multiple Sequence Alignment 167
BA5N Find a Topological Ordering of a DAG 104
BA6A Implement GreedySorting to Sort a Permutation by Reversals 262
BA6B Compute the Number of Breakpoints in a Permutation 286
BA6C Compute the 2-Break Distance Between a Pair of Genomes 183
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 55
BA6E Find All Shared k-mers of a Pair of Strings 197
BA6F Implement ChromosomeToCycle 113
BA6G Implement CycleToChromosome 108
BA6H Implement ColoredEdges 98
BA6I Implement GraphToGenome 81
BA6J Implement 2-BreakOnGenomeGraph 74
BA6K Implement 2-BreakOnGenome 64
BA7A Compute Distances Between Leaves 122
BA7B Compute Limb Lengths in a Tree 127
BA7C Implement AdditivePhylogeny 88
BA7D Implement UPGMA 83
BA7E Implement the Neighbor Joining Algorithm 69
BA7F Implement SmallParsimony 63
BA7G Adapt SmallParsimony to Unrooted Trees 40
BA8A Implement FarthestFirstTraversal 96
BA8B Compute the Squared Error Distortion 92
BA8C Implement the Lloyd Algorithm for k-Means Clustering 93
BA8D Implement the Soft k-Means Clustering Algorithm 79
BA8E Implement Hierarchical Clustering 75
BA9A Construct a Trie from a Collection of Patterns 219
BA9B Implement TrieMatching 196
BA9C Construct the Suffix Tree of a String 154
BA9D Find the Longest Repeat in a String 181
BA9E Find the Longest Substring Shared by Two Strings 169
BA9F Find the Shortest Non-Shared Substring of Two Strings 136
BA9G Construct the Suffix Array of a String 181
BA9H Pattern Matching with the Suffix Array 95
BA9I Construct the Burrows-Wheeler Transform of a String 212
BA9J Reconstruct a String from its Burrows-Wheeler Transform 176
BA9K Generate the Last-to-First Mapping of a String 99
BA9L Implement BWMatching 135
BA9M Implement BetterBWMatching 123
BA9N Find All Occurrences of a Collection of Patterns in a String 136
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 108
BA9P Implement TreeColoring 52
BA9Q Construct the Partial Suffix Array of a String 110
BA9R Construct a Suffix Tree from a Suffix Array 82