Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.

Problems: 285 (total), users: 78921, attempts: 1294122, correct: 717067
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 567
BA10B Compute the Probability of an Outcome Given a Hidden Path 476
BA10C Implement the Viterbi Algorithm 278
BA10D Compute the Probability of a String Emitted by an HMM 236
BA10E Construct a Profile HMM 147
BA10F Construct a Profile HMM with Pseudocounts 134
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 76
BA10H Estimate the Parameters of an HMM 102
BA10I Implement Viterbi Learning 87
BA10J Solve the Soft Decoding Problem 94
BA10K Implement Baum-Welch Learning 74
BA11A Construct the Graph of a Spectrum 132
BA11B Implement DecodingIdealSpectrum 96
BA11C Convert a Peptide into a Peptide Vector 134
BA11D Convert a Peptide Vector into a Peptide 129
BA11E Sequence a Peptide 78
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 78
BA11G Implement PSMSearch 75
BA11H Compute the Size of a Spectral Dictionary 66
BA11I Compute the Probability of a Spectral Dictionary 65
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 51
BA1A Compute the Number of Times a Pattern Appears in a Text 1413
BA1B Find the Most Frequent Words in a String 1585
BA1C Find the Reverse Complement of a String 1520
BA1D Find All Occurrences of a Pattern in a String 1410
BA1E Find Patterns Forming Clumps in a String 1118
BA1F Find a Position in a Genome Minimizing the Skew 1126
BA1G Compute the Hamming Distance Between Two Strings 1191
BA1H Find All Approximate Occurrences of a Pattern in a String 989
BA1I Find the Most Frequent Words with Mismatches in a String 808
BA1J Find Frequent Words with Mismatches and Reverse Complements 739
BA1K Generate the Frequency Array of a String 679
BA1L Implement PatternToNumber 739
BA1M Implement NumberToPattern 705
BA1N Generate the d-Neighborhood of a String 710
BA2A Implement MotifEnumeration 586
BA2B Find a Median String 591
BA2C Find a Profile-most Probable k-mer in a String 597
BA2D Implement GreedyMotifSearch 502
BA2E Implement GreedyMotifSearch with Pseudocounts 439
BA2F Implement RandomizedMotifSearch 357
BA2G Implement GibbsSampler 309
BA2H Implement DistanceBetweenPatternAndStrings 396
BA3A Generate the k-mer Composition of a String 735
BA3B Reconstruct a String from its Genome Path 657
BA3C Construct the Overlap Graph of a Collection of k-mers 613
BA3D Construct the De Bruijn Graph of a String 639
BA3E Construct the De Bruijn Graph of a Collection of k-mers 554
BA3F Find an Eulerian Cycle in a Graph 421
BA3G Find an Eulerian Path in a Graph 357
BA3H Reconstruct a String from its k-mer Composition 381
BA3I Find a k-Universal Circular String 281
BA3J Reconstruct a String from its Paired Composition 244
BA3K Generate Contigs from a Collection of Reads 242
BA3L Construct a String Spelled by a Gapped Genome Path 203
BA3M Generate All Maximal Non-Branching Paths in a Graph 193
BA4A Translate an RNA String into an Amino Acid String 498
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 393
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 378
BA4D Compute the Number of Peptides of Given Total Mass 252
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 286
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 236
BA4G Implement LeaderboardCyclopeptideSequencing 214
BA4H Generate the Convolution of a Spectrum 222
BA4I Implement ConvolutionCyclopeptideSequencing 154
BA4J Generate the Theoretical Spectrum of a Linear Peptide 240
BA4K Compute the Score of a Linear Peptide 191
BA4L Trim a Peptide Leaderboard 170
BA4M Solve the Turnpike Problem 92
BA5A Find the Minimum Number of Coins Needed to Make Change 572
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 455
BA5C Find a Longest Common Subsequence of Two Strings 561
BA5D Find the Longest Path in a DAG 367
BA5E Find a Highest-Scoring Alignment of Two Strings 537
BA5F Find a Highest-Scoring Local Alignment of Two Strings 426
BA5G Compute the Edit Distance Between Two Strings 488
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 312
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 275
BA5J Align Two Strings Using Affine Gap Penalties 320
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 200
BA5L Align Two Strings Using Linear Space 177
BA5M Find a Highest-Scoring Multiple Sequence Alignment 210
BA5N Find a Topological Ordering of a DAG 148
BA6A Implement GreedySorting to Sort a Permutation by Reversals 329
BA6B Compute the Number of Breakpoints in a Permutation 365
BA6C Compute the 2-Break Distance Between a Pair of Genomes 242
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 84
BA6E Find All Shared k-mers of a Pair of Strings 220
BA6F Implement ChromosomeToCycle 141
BA6G Implement CycleToChromosome 137
BA6H Implement ColoredEdges 126
BA6I Implement GraphToGenome 104
BA6J Implement 2-BreakOnGenomeGraph 104
BA6K Implement 2-BreakOnGenome 97
BA7A Compute Distances Between Leaves 189
BA7B Compute Limb Lengths in a Tree 196
BA7C Implement AdditivePhylogeny 157
BA7D Implement UPGMA 144
BA7E Implement the Neighbor Joining Algorithm 121
BA7F Implement SmallParsimony 98
BA7G Adapt SmallParsimony to Unrooted Trees 68
BA8A Implement FarthestFirstTraversal 133
BA8B Compute the Squared Error Distortion 126
BA8C Implement the Lloyd Algorithm for k-Means Clustering 137
BA8D Implement the Soft k-Means Clustering Algorithm 104
BA8E Implement Hierarchical Clustering 104
BA9A Construct a Trie from a Collection of Patterns 277
BA9B Implement TrieMatching 249
BA9C Construct the Suffix Tree of a String 189
BA9D Find the Longest Repeat in a String 221
BA9E Find the Longest Substring Shared by Two Strings 199
BA9F Find the Shortest Non-Shared Substring of Two Strings 167
BA9G Construct the Suffix Array of a String 238
BA9H Pattern Matching with the Suffix Array 136
BA9I Construct the Burrows-Wheeler Transform of a String 283
BA9J Reconstruct a String from its Burrows-Wheeler Transform 227
BA9K Generate the Last-to-First Mapping of a String 169
BA9L Implement BWMatching 177
BA9M Implement BetterBWMatching 162
BA9N Find All Occurrences of a Collection of Patterns in a String 168
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 137
BA9P Implement TreeColoring 71
BA9Q Construct the Partial Suffix Array of a String 134
BA9R Construct a Suffix Tree from a Suffix Array 101