Problems

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: 68292, attempts: 1123619, correct: 625682
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 473
BA10B Compute the Probability of an Outcome Given a Hidden Path 399
BA10C Implement the Viterbi Algorithm 249
BA10D Compute the Probability of a String Emitted by an HMM 213
BA10E Construct a Profile HMM 134
BA10F Construct a Profile HMM with Pseudocounts 123
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 68
BA10H Estimate the Parameters of an HMM 89
BA10I Implement Viterbi Learning 78
BA10J Solve the Soft Decoding Problem 83
BA10K Implement Baum-Welch Learning 65
BA11A Construct the Graph of a Spectrum 114
BA11B Implement DecodingIdealSpectrum 87
BA11C Convert a Peptide into a Peptide Vector 119
BA11D Convert a Peptide Vector into a Peptide 114
BA11E Sequence a Peptide 69
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 68
BA11G Implement PSMSearch 67
BA11H Compute the Size of a Spectral Dictionary 56
BA11I Compute the Probability of a Spectral Dictionary 56
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 45
BA1A Compute the Number of Times a Pattern Appears in a Text 1096
BA1B Find the Most Frequent Words in a String 1266
BA1C Find the Reverse Complement of a String 1225
BA1D Find All Occurrences of a Pattern in a String 1133
BA1E Find Patterns Forming Clumps in a String 864
BA1F Find a Position in a Genome Minimizing the Skew 877
BA1G Compute the Hamming Distance Between Two Strings 923
BA1H Find All Approximate Occurrences of a Pattern in a String 801
BA1I Find the Most Frequent Words with Mismatches in a String 653
BA1J Find Frequent Words with Mismatches and Reverse Complements 592
BA1K Generate the Frequency Array of a String 550
BA1L Implement PatternToNumber 599
BA1M Implement NumberToPattern 566
BA1N Generate the d-Neighborhood of a String 581
BA2A Implement MotifEnumeration 477
BA2B Find a Median String 480
BA2C Find a Profile-most Probable k-mer in a String 503
BA2D Implement GreedyMotifSearch 413
BA2E Implement GreedyMotifSearch with Pseudocounts 353
BA2F Implement RandomizedMotifSearch 286
BA2G Implement GibbsSampler 252
BA2H Implement DistanceBetweenPatternAndStrings 327
BA3A Generate the k-mer Composition of a String 601
BA3B Reconstruct a String from its Genome Path 533
BA3C Construct the Overlap Graph of a Collection of k-mers 497
BA3D Construct the De Bruijn Graph of a String 499
BA3E Construct the De Bruijn Graph of a Collection of k-mers 450
BA3F Find an Eulerian Cycle in a Graph 347
BA3G Find an Eulerian Path in a Graph 290
BA3H Reconstruct a String from its k-mer Composition 288
BA3I Find a k-Universal Circular String 224
BA3J Reconstruct a String from its Paired Composition 200
BA3K Generate Contigs from a Collection of Reads 199
BA3L Construct a String Spelled by a Gapped Genome Path 164
BA3M Generate All Maximal Non-Branching Paths in a Graph 146
BA4A Translate an RNA String into an Amino Acid String 402
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 311
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 304
BA4D Compute the Number of Peptides of Given Total Mass 185
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 221
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 180
BA4G Implement LeaderboardCyclopeptideSequencing 165
BA4H Generate the Convolution of a Spectrum 175
BA4I Implement ConvolutionCyclopeptideSequencing 124
BA4J Generate the Theoretical Spectrum of a Linear Peptide 189
BA4K Compute the Score of a Linear Peptide 148
BA4L Trim a Peptide Leaderboard 132
BA4M Solve the Turnpike Problem 79
BA5A Find the Minimum Number of Coins Needed to Make Change 496
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 404
BA5C Find a Longest Common Subsequence of Two Strings 502
BA5D Find the Longest Path in a DAG 330
BA5E Find a Highest-Scoring Alignment of Two Strings 469
BA5F Find a Highest-Scoring Local Alignment of Two Strings 383
BA5G Compute the Edit Distance Between Two Strings 454
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 280
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 257
BA5J Align Two Strings Using Affine Gap Penalties 283
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 182
BA5L Align Two Strings Using Linear Space 162
BA5M Find a Highest-Scoring Multiple Sequence Alignment 182
BA5N Find a Topological Ordering of a DAG 127
BA6A Implement GreedySorting to Sort a Permutation by Reversals 292
BA6B Compute the Number of Breakpoints in a Permutation 321
BA6C Compute the 2-Break Distance Between a Pair of Genomes 209
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 66
BA6E Find All Shared k-mers of a Pair of Strings 211
BA6F Implement ChromosomeToCycle 127
BA6G Implement CycleToChromosome 123
BA6H Implement ColoredEdges 113
BA6I Implement GraphToGenome 93
BA6J Implement 2-BreakOnGenomeGraph 86
BA6K Implement 2-BreakOnGenome 78
BA7A Compute Distances Between Leaves 144
BA7B Compute Limb Lengths in a Tree 154
BA7C Implement AdditivePhylogeny 109
BA7D Implement UPGMA 107
BA7E Implement the Neighbor Joining Algorithm 91
BA7F Implement SmallParsimony 80
BA7G Adapt SmallParsimony to Unrooted Trees 49
BA8A Implement FarthestFirstTraversal 116
BA8B Compute the Squared Error Distortion 109
BA8C Implement the Lloyd Algorithm for k-Means Clustering 121
BA8D Implement the Soft k-Means Clustering Algorithm 98
BA8E Implement Hierarchical Clustering 94
BA9A Construct a Trie from a Collection of Patterns 252
BA9B Implement TrieMatching 226
BA9C Construct the Suffix Tree of a String 172
BA9D Find the Longest Repeat in a String 203
BA9E Find the Longest Substring Shared by Two Strings 187
BA9F Find the Shortest Non-Shared Substring of Two Strings 152
BA9G Construct the Suffix Array of a String 213
BA9H Pattern Matching with the Suffix Array 114
BA9I Construct the Burrows-Wheeler Transform of a String 249
BA9J Reconstruct a String from its Burrows-Wheeler Transform 200
BA9K Generate the Last-to-First Mapping of a String 129
BA9L Implement BWMatching 157
BA9M Implement BetterBWMatching 141
BA9N Find All Occurrences of a Collection of Patterns in a String 154
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 120
BA9P Implement TreeColoring 62
BA9Q Construct the Partial Suffix Array of a String 121
BA9R Construct a Suffix Tree from a Suffix Array 92