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: suke_13 vs. “Merge Two Sorted Arrays”, 1 minute ago
Problems: 284 (total), users: 99026, attempts: 1635574, correct: 902382
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 731
BA10B Compute the Probability of an Outcome Given a Hidden Path 607
BA10C Implement the Viterbi Algorithm 450
BA10D Compute the Probability of a String Emitted by an HMM 313
BA10E Construct a Profile HMM 178
BA10F Construct a Profile HMM with Pseudocounts 171
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 95
BA10H Estimate the Parameters of an HMM 153
BA10I Implement Viterbi Learning 118
BA10J Solve the Soft Decoding Problem 135
BA10K Implement Baum-Welch Learning 126
BA11A Construct the Graph of a Spectrum 171
BA11B Implement DecodingIdealSpectrum 126
BA11C Convert a Peptide into a Peptide Vector 176
BA11D Convert a Peptide Vector into a Peptide 170
BA11E Sequence a Peptide 103
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 102
BA11G Implement PSMSearch 95
BA11H Compute the Size of a Spectral Dictionary 89
BA11I Compute the Probability of a Spectral Dictionary 87
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 63
BA1A Compute the Number of Times a Pattern Appears in a Text 2400
BA1B Find the Most Frequent Words in a String 2495
BA1C Find the Reverse Complement of a String 2391
BA1D Find All Occurrences of a Pattern in a String 2289
BA1E Find Patterns Forming Clumps in a String 1939
BA1F Find a Position in a Genome Minimizing the Skew 1894
BA1G Compute the Hamming Distance Between Two Strings 1959
BA1H Find All Approximate Occurrences of a Pattern in a String 1491
BA1I Find the Most Frequent Words with Mismatches in a String 1248
BA1J Find Frequent Words with Mismatches and Reverse Complements 1123
BA1K Generate the Frequency Array of a String 993
BA1L Implement PatternToNumber 1181
BA1M Implement NumberToPattern 1134
BA1N Generate the d-Neighborhood of a String 1029
BA2A Implement MotifEnumeration 1035
BA2B Find a Median String 1011
BA2C Find a Profile-most Probable k-mer in a String 922
BA2D Implement GreedyMotifSearch 864
BA2E Implement GreedyMotifSearch with Pseudocounts 750
BA2F Implement RandomizedMotifSearch 683
BA2G Implement GibbsSampler 545
BA2H Implement DistanceBetweenPatternAndStrings 794
BA3A Generate the k-mer Composition of a String 1104
BA3B Reconstruct a String from its Genome Path 1028
BA3C Construct the Overlap Graph of a Collection of k-mers 959
BA3D Construct the De Bruijn Graph of a String 946
BA3E Construct the De Bruijn Graph of a Collection of k-mers 843
BA3F Find an Eulerian Cycle in a Graph 662
BA3G Find an Eulerian Path in a Graph 598
BA3H Reconstruct a String from its k-mer Composition 719
BA3I Find a k-Universal Circular String 486
BA3J Reconstruct a String from its Paired Composition 471
BA3K Generate Contigs from a Collection of Reads 382
BA3L Construct a String Spelled by a Gapped Genome Path 367
BA3M Generate All Maximal Non-Branching Paths in a Graph 283
BA4A Translate an RNA String into an Amino Acid String 757
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 658
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 594
BA4D Compute the Number of Peptides of Given Total Mass 441
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 470
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 370
BA4G Implement LeaderboardCyclopeptideSequencing 370
BA4H Generate the Convolution of a Spectrum 358
BA4I Implement ConvolutionCyclopeptideSequencing 240
BA4J Generate the Theoretical Spectrum of a Linear Peptide 351
BA4K Compute the Score of a Linear Peptide 295
BA4L Trim a Peptide Leaderboard 269
BA4M Solve the Turnpike Problem 154
BA5A Find the Minimum Number of Coins Needed to Make Change 798
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 655
BA5C Find a Longest Common Subsequence of Two Strings 769
BA5D Find the Longest Path in a DAG 480
BA5E Find a Highest-Scoring Alignment of Two Strings 733
BA5F Find a Highest-Scoring Local Alignment of Two Strings 588
BA5G Compute the Edit Distance Between Two Strings 622
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 406
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 363
BA5J Align Two Strings Using Affine Gap Penalties 479
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 269
BA5L Align Two Strings Using Linear Space 232
BA5M Find a Highest-Scoring Multiple Sequence Alignment 272
BA5N Find a Topological Ordering of a DAG 236
BA6A Implement GreedySorting to Sort a Permutation by Reversals 428
BA6B Compute the Number of Breakpoints in a Permutation 481
BA6C Compute the 2-Break Distance Between a Pair of Genomes 322
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 166
BA6E Find All Shared k-mers of a Pair of Strings 265
BA6F Implement ChromosomeToCycle 216
BA6G Implement CycleToChromosome 211
BA6H Implement ColoredEdges 191
BA6I Implement GraphToGenome 158
BA6J Implement 2-BreakOnGenomeGraph 165
BA6K Implement 2-BreakOnGenome 137
BA7A Compute Distances Between Leaves 248
BA7B Compute Limb Lengths in a Tree 282
BA7C Implement AdditivePhylogeny 248
BA7D Implement UPGMA 200
BA7E Implement the Neighbor Joining Algorithm 185
BA7F Implement SmallParsimony 130
BA7G Adapt SmallParsimony to Unrooted Trees 95
BA8A Implement FarthestFirstTraversal 184
BA8B Compute the Squared Error Distortion 185
BA8C Implement the Lloyd Algorithm for k-Means Clustering 209
BA8D Implement the Soft k-Means Clustering Algorithm 143
BA8E Implement Hierarchical Clustering 150
BA9A Construct a Trie from a Collection of Patterns 352
BA9B Implement TrieMatching 356
BA9C Construct the Suffix Tree of a String 261
BA9D Find the Longest Repeat in a String 328
BA9E Find the Longest Substring Shared by Two Strings 265
BA9F Find the Shortest Non-Shared Substring of Two Strings 215
BA9G Construct the Suffix Array of a String 325
BA9H Pattern Matching with the Suffix Array 234
BA9I Construct the Burrows-Wheeler Transform of a String 369
BA9J Reconstruct a String from its Burrows-Wheeler Transform 314
BA9K Generate the Last-to-First Mapping of a String 254
BA9L Implement BWMatching 233
BA9M Implement BetterBWMatching 204
BA9N Find All Occurrences of a Collection of Patterns in a String 211
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 195
BA9P Implement TreeColoring 98
BA9Q Construct the Partial Suffix Array of a String 168
BA9R Construct a Suffix Tree from a Suffix Array 124