Problems

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: Matthew Behlmann vs. “k-Mer Composition”, 14 minutes ago
Problems: 285 (total), users: 56740, attempts: 955820, correct: 536519
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 388
BA10B Compute the Probability of an Outcome Given a Hidden Path 330
BA10C Implement the Viterbi Algorithm 201
BA10D Compute the Probability of a String Emitted by an HMM 178
BA10E Construct a Profile HMM 117
BA10F Construct a Profile HMM with Pseudocounts 107
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 53
BA10H Estimate the Parameters of an HMM 67
BA10I Implement Viterbi Learning 57
BA10J Solve the Soft Decoding Problem 58
BA10K Implement Baum-Welch Learning 45
BA11A Construct the Graph of a Spectrum 92
BA11B Implement DecodingIdealSpectrum 66
BA11C Convert a Peptide into a Peptide Vector 96
BA11D Convert a Peptide Vector into a Peptide 90
BA11E Sequence a Peptide 54
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 44
BA11I Compute the Probability of a Spectral Dictionary 44
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 35
BA1A Compute the Number of Times a Pattern Appears in a Text 815
BA1B Find the Most Frequent Words in a String 979
BA1C Find the Reverse Complement of a String 932
BA1D Find All Occurrences of a Pattern in a String 842
BA1E Find Patterns Forming Clumps in a String 644
BA1F Find a Position in a Genome Minimizing the Skew 643
BA1G Compute the Hamming Distance Between Two Strings 706
BA1H Find All Approximate Occurrences of a Pattern in a String 610
BA1I Find the Most Frequent Words with Mismatches in a String 488
BA1J Find Frequent Words with Mismatches and Reverse Complements 437
BA1K Generate the Frequency Array of a String 404
BA1L Implement PatternToNumber 456
BA1M Implement NumberToPattern 419
BA1N Generate the d-Neighborhood of a String 448
BA2A Implement MotifEnumeration 368
BA2B Find a Median String 357
BA2C Find a Profile-most Probable k-mer in a String 376
BA2D Implement GreedyMotifSearch 301
BA2E Implement GreedyMotifSearch with Pseudocounts 249
BA2F Implement RandomizedMotifSearch 210
BA2G Implement GibbsSampler 195
BA2H Implement DistanceBetweenPatternAndStrings 242
BA3A Generate the k-mer Composition of a String 448
BA3B Reconstruct a String from its Genome Path 418
BA3C Construct the Overlap Graph of a Collection of k-mers 365
BA3D Construct the De Bruijn Graph of a String 382
BA3E Construct the De Bruijn Graph of a Collection of k-mers 347
BA3F Find an Eulerian Cycle in a Graph 267
BA3G Find an Eulerian Path in a Graph 219
BA3H Reconstruct a String from its k-mer Composition 214
BA3I Find a k-Universal Circular String 162
BA3J Reconstruct a String from its Paired Composition 155
BA3K Generate Contigs from a Collection of Reads 158
BA3L Construct a String Spelled by a Gapped Genome Path 130
BA3M Generate All Maximal Non-Branching Paths in a Graph 110
BA4A Translate an RNA String into an Amino Acid String 306
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 119
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 152
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 124
BA4G Implement LeaderboardCyclopeptideSequencing 118
BA4H Generate the Convolution of a Spectrum 119
BA4I Implement ConvolutionCyclopeptideSequencing 88
BA4J Generate the Theoretical Spectrum of a Linear Peptide 125
BA4K Compute the Score of a Linear Peptide 106
BA4L Trim a Peptide Leaderboard 93
BA4M Solve the Turnpike Problem 62
BA5A Find the Minimum Number of Coins Needed to Make Change 440
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 354
BA5C Find a Longest Common Subsequence of Two Strings 441
BA5D Find the Longest Path in a DAG 289
BA5E Find a Highest-Scoring Alignment of Two Strings 386
BA5F Find a Highest-Scoring Local Alignment of Two Strings 328
BA5G Compute the Edit Distance Between Two Strings 401
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 245
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 229
BA5J Align Two Strings Using Affine Gap Penalties 245
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 163
BA5L Align Two Strings Using Linear Space 142
BA5M Find a Highest-Scoring Multiple Sequence Alignment 165
BA5N Find a Topological Ordering of a DAG 103
BA6A Implement GreedySorting to Sort a Permutation by Reversals 261
BA6B Compute the Number of Breakpoints in a Permutation 284
BA6C Compute the 2-Break Distance Between a Pair of Genomes 182
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 54
BA6E Find All Shared k-mers of a Pair of Strings 194
BA6F Implement ChromosomeToCycle 112
BA6G Implement CycleToChromosome 107
BA6H Implement ColoredEdges 97
BA6I Implement GraphToGenome 80
BA6J Implement 2-BreakOnGenomeGraph 73
BA6K Implement 2-BreakOnGenome 63
BA7A Compute Distances Between Leaves 120
BA7B Compute Limb Lengths in a Tree 126
BA7C Implement AdditivePhylogeny 87
BA7D Implement UPGMA 82
BA7E Implement the Neighbor Joining Algorithm 68
BA7F Implement SmallParsimony 60
BA7G Adapt SmallParsimony to Unrooted Trees 37
BA8A Implement FarthestFirstTraversal 94
BA8B Compute the Squared Error Distortion 91
BA8C Implement the Lloyd Algorithm for k-Means Clustering 91
BA8D Implement the Soft k-Means Clustering Algorithm 77
BA8E Implement Hierarchical Clustering 74
BA9A Construct a Trie from a Collection of Patterns 219
BA9B Implement TrieMatching 195
BA9C Construct the Suffix Tree of a String 153
BA9D Find the Longest Repeat in a String 179
BA9E Find the Longest Substring Shared by Two Strings 167
BA9F Find the Shortest Non-Shared Substring of Two Strings 134
BA9G Construct the Suffix Array of a String 179
BA9H Pattern Matching with the Suffix Array 94
BA9I Construct the Burrows-Wheeler Transform of a String 211
BA9J Reconstruct a String from its Burrows-Wheeler Transform 175
BA9K Generate the Last-to-First Mapping of a String 98
BA9L Implement BWMatching 134
BA9M Implement BetterBWMatching 122
BA9N Find All Occurrences of a Collection of Patterns in a String 134
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 107
BA9P Implement TreeColoring 51
BA9Q Construct the Partial Suffix Array of a String 108
BA9R Construct a Suffix Tree from a Suffix Array 80