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: Aalu vs. “Counting Phylogenetic Ancestors”, 6 minutes ago
Problems: 285 (total), users: 66131, attempts: 1099212, correct: 612528
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 459
BA10B Compute the Probability of an Outcome Given a Hidden Path 387
BA10C Implement the Viterbi Algorithm 243
BA10D Compute the Probability of a String Emitted by an HMM 208
BA10E Construct a Profile HMM 131
BA10F Construct a Profile HMM with Pseudocounts 120
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 64
BA10H Estimate the Parameters of an HMM 86
BA10I Implement Viterbi Learning 76
BA10J Solve the Soft Decoding Problem 79
BA10K Implement Baum-Welch Learning 62
BA11A Construct the Graph of a Spectrum 111
BA11B Implement DecodingIdealSpectrum 85
BA11C Convert a Peptide into a Peptide Vector 116
BA11D Convert a Peptide Vector into a Peptide 110
BA11E Sequence a Peptide 67
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 67
BA11G Implement PSMSearch 66
BA11H Compute the Size of a Spectral Dictionary 55
BA11I Compute the Probability of a Spectral Dictionary 55
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 44
BA1A Compute the Number of Times a Pattern Appears in a Text 1012
BA1B Find the Most Frequent Words in a String 1174
BA1C Find the Reverse Complement of a String 1134
BA1D Find All Occurrences of a Pattern in a String 1025
BA1E Find Patterns Forming Clumps in a String 807
BA1F Find a Position in a Genome Minimizing the Skew 785
BA1G Compute the Hamming Distance Between Two Strings 865
BA1H Find All Approximate Occurrences of a Pattern in a String 740
BA1I Find the Most Frequent Words with Mismatches in a String 605
BA1J Find Frequent Words with Mismatches and Reverse Complements 543
BA1K Generate the Frequency Array of a String 498
BA1L Implement PatternToNumber 558
BA1M Implement NumberToPattern 518
BA1N Generate the d-Neighborhood of a String 546
BA2A Implement MotifEnumeration 451
BA2B Find a Median String 447
BA2C Find a Profile-most Probable k-mer in a String 471
BA2D Implement GreedyMotifSearch 391
BA2E Implement GreedyMotifSearch with Pseudocounts 337
BA2F Implement RandomizedMotifSearch 269
BA2G Implement GibbsSampler 244
BA2H Implement DistanceBetweenPatternAndStrings 310
BA3A Generate the k-mer Composition of a String 578
BA3B Reconstruct a String from its Genome Path 511
BA3C Construct the Overlap Graph of a Collection of k-mers 480
BA3D Construct the De Bruijn Graph of a String 481
BA3E Construct the De Bruijn Graph of a Collection of k-mers 439
BA3F Find an Eulerian Cycle in a Graph 333
BA3G Find an Eulerian Path in a Graph 276
BA3H Reconstruct a String from its k-mer Composition 278
BA3I Find a k-Universal Circular String 220
BA3J Reconstruct a String from its Paired Composition 196
BA3K Generate Contigs from a Collection of Reads 196
BA3L Construct a String Spelled by a Gapped Genome Path 162
BA3M Generate All Maximal Non-Branching Paths in a Graph 143
BA4A Translate an RNA String into an Amino Acid String 376
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 289
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 279
BA4D Compute the Number of Peptides of Given Total Mass 174
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 211
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 171
BA4G Implement LeaderboardCyclopeptideSequencing 162
BA4H Generate the Convolution of a Spectrum 164
BA4I Implement ConvolutionCyclopeptideSequencing 121
BA4J Generate the Theoretical Spectrum of a Linear Peptide 186
BA4K Compute the Score of a Linear Peptide 145
BA4L Trim a Peptide Leaderboard 129
BA4M Solve the Turnpike Problem 76
BA5A Find the Minimum Number of Coins Needed to Make Change 491
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 401
BA5C Find a Longest Common Subsequence of Two Strings 492
BA5D Find the Longest Path in a DAG 327
BA5E Find a Highest-Scoring Alignment of Two Strings 461
BA5F Find a Highest-Scoring Local Alignment of Two Strings 376
BA5G Compute the Edit Distance Between Two Strings 446
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 275
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 252
BA5J Align Two Strings Using Affine Gap Penalties 281
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 182
BA5L Align Two Strings Using Linear Space 161
BA5M Find a Highest-Scoring Multiple Sequence Alignment 181
BA5N Find a Topological Ordering of a DAG 126
BA6A Implement GreedySorting to Sort a Permutation by Reversals 287
BA6B Compute the Number of Breakpoints in a Permutation 315
BA6C Compute the 2-Break Distance Between a Pair of Genomes 207
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 65
BA6E Find All Shared k-mers of a Pair of Strings 211
BA6F Implement ChromosomeToCycle 126
BA6G Implement CycleToChromosome 122
BA6H Implement ColoredEdges 112
BA6I Implement GraphToGenome 92
BA6J Implement 2-BreakOnGenomeGraph 85
BA6K Implement 2-BreakOnGenome 77
BA7A Compute Distances Between Leaves 141
BA7B Compute Limb Lengths in a Tree 151
BA7C Implement AdditivePhylogeny 106
BA7D Implement UPGMA 104
BA7E Implement the Neighbor Joining Algorithm 87
BA7F Implement SmallParsimony 79
BA7G Adapt SmallParsimony to Unrooted Trees 48
BA8A Implement FarthestFirstTraversal 111
BA8B Compute the Squared Error Distortion 106
BA8C Implement the Lloyd Algorithm for k-Means Clustering 118
BA8D Implement the Soft k-Means Clustering Algorithm 95
BA8E Implement Hierarchical Clustering 91
BA9A Construct a Trie from a Collection of Patterns 243
BA9B Implement TrieMatching 217
BA9C Construct the Suffix Tree of a String 169
BA9D Find the Longest Repeat in a String 199
BA9E Find the Longest Substring Shared by Two Strings 184
BA9F Find the Shortest Non-Shared Substring of Two Strings 149
BA9G Construct the Suffix Array of a String 202
BA9H Pattern Matching with the Suffix Array 110
BA9I Construct the Burrows-Wheeler Transform of a String 241
BA9J Reconstruct a String from its Burrows-Wheeler Transform 198
BA9K Generate the Last-to-First Mapping of a String 126
BA9L Implement BWMatching 156
BA9M Implement BetterBWMatching 140
BA9N Find All Occurrences of a Collection of Patterns in a String 152
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 119
BA9P Implement TreeColoring 61
BA9Q Construct the Partial Suffix Array of a String 120
BA9R Construct a Suffix Tree from a Suffix Array 91