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: ekaantonenko vs. “Majority Element”, 4 minutes ago
Problems: 285 (total), users: 64221, attempts: 1064147, correct: 593648
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 444
BA10B Compute the Probability of an Outcome Given a Hidden Path 378
BA10C Implement the Viterbi Algorithm 235
BA10D Compute the Probability of a String Emitted by an HMM 205
BA10E Construct a Profile HMM 129
BA10F Construct a Profile HMM with Pseudocounts 119
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 63
BA10H Estimate the Parameters of an HMM 82
BA10I Implement Viterbi Learning 74
BA10J Solve the Soft Decoding Problem 77
BA10K Implement Baum-Welch Learning 60
BA11A Construct the Graph of a Spectrum 108
BA11B Implement DecodingIdealSpectrum 81
BA11C Convert a Peptide into a Peptide Vector 113
BA11D Convert a Peptide Vector into a Peptide 107
BA11E Sequence a Peptide 66
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 66
BA11G Implement PSMSearch 65
BA11H Compute the Size of a Spectral Dictionary 54
BA11I Compute the Probability of a Spectral Dictionary 54
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 43
BA1A Compute the Number of Times a Pattern Appears in a Text 971
BA1B Find the Most Frequent Words in a String 1134
BA1C Find the Reverse Complement of a String 1091
BA1D Find All Occurrences of a Pattern in a String 992
BA1E Find Patterns Forming Clumps in a String 780
BA1F Find a Position in a Genome Minimizing the Skew 755
BA1G Compute the Hamming Distance Between Two Strings 833
BA1H Find All Approximate Occurrences of a Pattern in a String 714
BA1I Find the Most Frequent Words with Mismatches in a String 580
BA1J Find Frequent Words with Mismatches and Reverse Complements 522
BA1K Generate the Frequency Array of a String 477
BA1L Implement PatternToNumber 535
BA1M Implement NumberToPattern 499
BA1N Generate the d-Neighborhood of a String 525
BA2A Implement MotifEnumeration 434
BA2B Find a Median String 429
BA2C Find a Profile-most Probable k-mer in a String 455
BA2D Implement GreedyMotifSearch 375
BA2E Implement GreedyMotifSearch with Pseudocounts 321
BA2F Implement RandomizedMotifSearch 257
BA2G Implement GibbsSampler 234
BA2H Implement DistanceBetweenPatternAndStrings 296
BA3A Generate the k-mer Composition of a String 553
BA3B Reconstruct a String from its Genome Path 490
BA3C Construct the Overlap Graph of a Collection of k-mers 458
BA3D Construct the De Bruijn Graph of a String 462
BA3E Construct the De Bruijn Graph of a Collection of k-mers 418
BA3F Find an Eulerian Cycle in a Graph 317
BA3G Find an Eulerian Path in a Graph 262
BA3H Reconstruct a String from its k-mer Composition 260
BA3I Find a k-Universal Circular String 205
BA3J Reconstruct a String from its Paired Composition 186
BA3K Generate Contigs from a Collection of Reads 187
BA3L Construct a String Spelled by a Gapped Genome Path 153
BA3M Generate All Maximal Non-Branching Paths in a Graph 137
BA4A Translate an RNA String into an Amino Acid String 364
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 271
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 270
BA4D Compute the Number of Peptides of Given Total Mass 161
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 201
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 163
BA4G Implement LeaderboardCyclopeptideSequencing 153
BA4H Generate the Convolution of a Spectrum 156
BA4I Implement ConvolutionCyclopeptideSequencing 114
BA4J Generate the Theoretical Spectrum of a Linear Peptide 179
BA4K Compute the Score of a Linear Peptide 138
BA4L Trim a Peptide Leaderboard 122
BA4M Solve the Turnpike Problem 71
BA5A Find the Minimum Number of Coins Needed to Make Change 475
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 387
BA5C Find a Longest Common Subsequence of Two Strings 481
BA5D Find the Longest Path in a DAG 316
BA5E Find a Highest-Scoring Alignment of Two Strings 448
BA5F Find a Highest-Scoring Local Alignment of Two Strings 366
BA5G Compute the Edit Distance Between Two Strings 437
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 268
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 245
BA5J Align Two Strings Using Affine Gap Penalties 274
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 175
BA5L Align Two Strings Using Linear Space 157
BA5M Find a Highest-Scoring Multiple Sequence Alignment 177
BA5N Find a Topological Ordering of a DAG 120
BA6A Implement GreedySorting to Sort a Permutation by Reversals 276
BA6B Compute the Number of Breakpoints in a Permutation 304
BA6C Compute the 2-Break Distance Between a Pair of Genomes 201
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 61
BA6E Find All Shared k-mers of a Pair of Strings 204
BA6F Implement ChromosomeToCycle 121
BA6G Implement CycleToChromosome 117
BA6H Implement ColoredEdges 107
BA6I Implement GraphToGenome 88
BA6J Implement 2-BreakOnGenomeGraph 82
BA6K Implement 2-BreakOnGenome 72
BA7A Compute Distances Between Leaves 136
BA7B Compute Limb Lengths in a Tree 148
BA7C Implement AdditivePhylogeny 103
BA7D Implement UPGMA 99
BA7E Implement the Neighbor Joining Algorithm 83
BA7F Implement SmallParsimony 77
BA7G Adapt SmallParsimony to Unrooted Trees 46
BA8A Implement FarthestFirstTraversal 109
BA8B Compute the Squared Error Distortion 103
BA8C Implement the Lloyd Algorithm for k-Means Clustering 115
BA8D Implement the Soft k-Means Clustering Algorithm 93
BA8E Implement Hierarchical Clustering 88
BA9A Construct a Trie from a Collection of Patterns 241
BA9B Implement TrieMatching 213
BA9C Construct the Suffix Tree of a String 166
BA9D Find the Longest Repeat in a String 193
BA9E Find the Longest Substring Shared by Two Strings 180
BA9F Find the Shortest Non-Shared Substring of Two Strings 146
BA9G Construct the Suffix Array of a String 195
BA9H Pattern Matching with the Suffix Array 106
BA9I Construct the Burrows-Wheeler Transform of a String 235
BA9J Reconstruct a String from its Burrows-Wheeler Transform 192
BA9K Generate the Last-to-First Mapping of a String 121
BA9L Implement BWMatching 152
BA9M Implement BetterBWMatching 133
BA9N Find All Occurrences of a Collection of Patterns in a String 148
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 117
BA9P Implement TreeColoring 59
BA9Q Construct the Partial Suffix Array of a String 119
BA9R Construct a Suffix Tree from a Suffix Array 90