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: maxhebditch vs. “Counting Point Mutations”, 2 minutes ago
Problems: 285 (total), users: 56230, attempts: 946409, correct: 531444
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 379
BA10B Compute the Probability of an Outcome Given a Hidden Path 323
BA10C Implement the Viterbi Algorithm 197
BA10D Compute the Probability of a String Emitted by an HMM 175
BA10E Construct a Profile HMM 114
BA10F Construct a Profile HMM with Pseudocounts 105
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 52
BA10H Estimate the Parameters of an HMM 64
BA10I Implement Viterbi Learning 53
BA10J Solve the Soft Decoding Problem 55
BA10K Implement Baum-Welch Learning 42
BA11A Construct the Graph of a Spectrum 88
BA11B Implement DecodingIdealSpectrum 63
BA11C Convert a Peptide into a Peptide Vector 92
BA11D Convert a Peptide Vector into a Peptide 86
BA11E Sequence a Peptide 51
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 52
BA11G Implement PSMSearch 51
BA11H Compute the Size of a Spectral Dictionary 42
BA11I Compute the Probability of a Spectral Dictionary 42
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 33
BA1A Compute the Number of Times a Pattern Appears in a Text 804
BA1B Find the Most Frequent Words in a String 965
BA1C Find the Reverse Complement of a String 919
BA1D Find All Occurrences of a Pattern in a String 829
BA1E Find Patterns Forming Clumps in a String 634
BA1F Find a Position in a Genome Minimizing the Skew 633
BA1G Compute the Hamming Distance Between Two Strings 695
BA1H Find All Approximate Occurrences of a Pattern in a String 604
BA1I Find the Most Frequent Words with Mismatches in a String 484
BA1J Find Frequent Words with Mismatches and Reverse Complements 432
BA1K Generate the Frequency Array of a String 400
BA1L Implement PatternToNumber 449
BA1M Implement NumberToPattern 412
BA1N Generate the d-Neighborhood of a String 441
BA2A Implement MotifEnumeration 364
BA2B Find a Median String 353
BA2C Find a Profile-most Probable k-mer in a String 372
BA2D Implement GreedyMotifSearch 298
BA2E Implement GreedyMotifSearch with Pseudocounts 247
BA2F Implement RandomizedMotifSearch 209
BA2G Implement GibbsSampler 194
BA2H Implement DistanceBetweenPatternAndStrings 241
BA3A Generate the k-mer Composition of a String 445
BA3B Reconstruct a String from its Genome Path 415
BA3C Construct the Overlap Graph of a Collection of k-mers 364
BA3D Construct the De Bruijn Graph of a String 381
BA3E Construct the De Bruijn Graph of a Collection of k-mers 346
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 213
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 304
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 216
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 213
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 438
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 353
BA5C Find a Longest Common Subsequence of Two Strings 439
BA5D Find the Longest Path in a DAG 288
BA5E Find a Highest-Scoring Alignment of Two Strings 385
BA5F Find a Highest-Scoring Local Alignment of Two Strings 328
BA5G Compute the Edit Distance Between Two Strings 400
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 102
BA6A Implement GreedySorting to Sort a Permutation by Reversals 260
BA6B Compute the Number of Breakpoints in a Permutation 282
BA6C Compute the 2-Break Distance Between a Pair of Genomes 181
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 53
BA6E Find All Shared k-mers of a Pair of Strings 193
BA6F Implement ChromosomeToCycle 111
BA6G Implement CycleToChromosome 106
BA6H Implement ColoredEdges 96
BA6I Implement GraphToGenome 79
BA6J Implement 2-BreakOnGenomeGraph 73
BA6K Implement 2-BreakOnGenome 62
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 59
BA7G Adapt SmallParsimony to Unrooted Trees 36
BA8A Implement FarthestFirstTraversal 92
BA8B Compute the Squared Error Distortion 88
BA8C Implement the Lloyd Algorithm for k-Means Clustering 89
BA8D Implement the Soft k-Means Clustering Algorithm 75
BA8E Implement Hierarchical Clustering 73
BA9A Construct a Trie from a Collection of Patterns 217
BA9B Implement TrieMatching 194
BA9C Construct the Suffix Tree of a String 151
BA9D Find the Longest Repeat in a String 177
BA9E Find the Longest Substring Shared by Two Strings 166
BA9F Find the Shortest Non-Shared Substring of Two Strings 134
BA9G Construct the Suffix Array of a String 178
BA9H Pattern Matching with the Suffix Array 93
BA9I Construct the Burrows-Wheeler Transform of a String 209
BA9J Reconstruct a String from its Burrows-Wheeler Transform 173
BA9K Generate the Last-to-First Mapping of a String 97
BA9L Implement BWMatching 133
BA9M Implement BetterBWMatching 121
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 106
BA9P Implement TreeColoring 50
BA9Q Construct the Partial Suffix Array of a String 107
BA9R Construct a Suffix Tree from a Suffix Array 80