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: dboceck vs. “Installing Python”, 2 minutes ago
Problems: 285 (total), users: 54919, attempts: 921681, correct: 518057
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 367
BA10B Compute the Probability of an Outcome Given a Hidden Path 315
BA10C Implement the Viterbi Algorithm 194
BA10D Compute the Probability of a String Emitted by an HMM 172
BA10E Construct a Profile HMM 113
BA10F Construct a Profile HMM with Pseudocounts 104
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 51
BA10H Estimate the Parameters of an HMM 62
BA10I Implement Viterbi Learning 51
BA10J Solve the Soft Decoding Problem 53
BA10K Implement Baum-Welch Learning 40
BA11A Construct the Graph of a Spectrum 85
BA11B Implement DecodingIdealSpectrum 61
BA11C Convert a Peptide into a Peptide Vector 90
BA11D Convert a Peptide Vector into a Peptide 84
BA11E Sequence a Peptide 48
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 50
BA11G Implement PSMSearch 49
BA11H Compute the Size of a Spectral Dictionary 40
BA11I Compute the Probability of a Spectral Dictionary 40
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 32
BA1A Compute the Number of Times a Pattern Appears in a Text 773
BA1B Find the Most Frequent Words in a String 932
BA1C Find the Reverse Complement of a String 883
BA1D Find All Occurrences of a Pattern in a String 798
BA1E Find Patterns Forming Clumps in a String 606
BA1F Find a Position in a Genome Minimizing the Skew 612
BA1G Compute the Hamming Distance Between Two Strings 672
BA1H Find All Approximate Occurrences of a Pattern in a String 584
BA1I Find the Most Frequent Words with Mismatches in a String 469
BA1J Find Frequent Words with Mismatches and Reverse Complements 419
BA1K Generate the Frequency Array of a String 383
BA1L Implement PatternToNumber 426
BA1M Implement NumberToPattern 391
BA1N Generate the d-Neighborhood of a String 429
BA2A Implement MotifEnumeration 356
BA2B Find a Median String 339
BA2C Find a Profile-most Probable k-mer in a String 361
BA2D Implement GreedyMotifSearch 289
BA2E Implement GreedyMotifSearch with Pseudocounts 238
BA2F Implement RandomizedMotifSearch 195
BA2G Implement GibbsSampler 181
BA2H Implement DistanceBetweenPatternAndStrings 227
BA3A Generate the k-mer Composition of a String 434
BA3B Reconstruct a String from its Genome Path 405
BA3C Construct the Overlap Graph of a Collection of k-mers 357
BA3D Construct the De Bruijn Graph of a String 374
BA3E Construct the De Bruijn Graph of a Collection of k-mers 339
BA3F Find an Eulerian Cycle in a Graph 262
BA3G Find an Eulerian Path in a Graph 214
BA3H Reconstruct a String from its k-mer Composition 207
BA3I Find a k-Universal Circular String 155
BA3J Reconstruct a String from its Paired Composition 149
BA3K Generate Contigs from a Collection of Reads 153
BA3L Construct a String Spelled by a Gapped Genome Path 123
BA3M Generate All Maximal Non-Branching Paths in a Graph 105
BA4A Translate an RNA String into an Amino Acid String 298
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 210
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 208
BA4D Compute the Number of Peptides of Given Total Mass 112
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 146
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 119
BA4G Implement LeaderboardCyclopeptideSequencing 114
BA4H Generate the Convolution of a Spectrum 116
BA4I Implement ConvolutionCyclopeptideSequencing 84
BA4J Generate the Theoretical Spectrum of a Linear Peptide 120
BA4K Compute the Score of a Linear Peptide 103
BA4L Trim a Peptide Leaderboard 90
BA4M Solve the Turnpike Problem 58
BA5A Find the Minimum Number of Coins Needed to Make Change 431
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 350
BA5C Find a Longest Common Subsequence of Two Strings 434
BA5D Find the Longest Path in a DAG 285
BA5E Find a Highest-Scoring Alignment of Two Strings 382
BA5F Find a Highest-Scoring Local Alignment of Two Strings 326
BA5G Compute the Edit Distance Between Two Strings 395
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 241
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 224
BA5J Align Two Strings Using Affine Gap Penalties 242
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 160
BA5L Align Two Strings Using Linear Space 139
BA5M Find a Highest-Scoring Multiple Sequence Alignment 162
BA5N Find a Topological Ordering of a DAG 100
BA6A Implement GreedySorting to Sort a Permutation by Reversals 255
BA6B Compute the Number of Breakpoints in a Permutation 277
BA6C Compute the 2-Break Distance Between a Pair of Genomes 177
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 49
BA6E Find All Shared k-mers of a Pair of Strings 190
BA6F Implement ChromosomeToCycle 109
BA6G Implement CycleToChromosome 104
BA6H Implement ColoredEdges 93
BA6I Implement GraphToGenome 76
BA6J Implement 2-BreakOnGenomeGraph 70
BA6K Implement 2-BreakOnGenome 59
BA7A Compute Distances Between Leaves 116
BA7B Compute Limb Lengths in a Tree 122
BA7C Implement AdditivePhylogeny 83
BA7D Implement UPGMA 78
BA7E Implement the Neighbor Joining Algorithm 64
BA7F Implement SmallParsimony 56
BA7G Adapt SmallParsimony to Unrooted Trees 34
BA8A Implement FarthestFirstTraversal 89
BA8B Compute the Squared Error Distortion 86
BA8C Implement the Lloyd Algorithm for k-Means Clustering 85
BA8D Implement the Soft k-Means Clustering Algorithm 72
BA8E Implement Hierarchical Clustering 70
BA9A Construct a Trie from a Collection of Patterns 215
BA9B Implement TrieMatching 191
BA9C Construct the Suffix Tree of a String 149
BA9D Find the Longest Repeat in a String 176
BA9E Find the Longest Substring Shared by Two Strings 165
BA9F Find the Shortest Non-Shared Substring of Two Strings 132
BA9G Construct the Suffix Array of a String 176
BA9H Pattern Matching with the Suffix Array 91
BA9I Construct the Burrows-Wheeler Transform of a String 208
BA9J Reconstruct a String from its Burrows-Wheeler Transform 171
BA9K Generate the Last-to-First Mapping of a String 95
BA9L Implement BWMatching 131
BA9M Implement BetterBWMatching 119
BA9N Find All Occurrences of a Collection of Patterns in a String 131
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 103
BA9P Implement TreeColoring 48
BA9Q Construct the Partial Suffix Array of a String 105
BA9R Construct a Suffix Tree from a Suffix Array 78