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: 匡盟盟 vs. “Pairwise Global Alignment”, 10 minutes ago
Problems: 285 (total), users: 59410, attempts: 991141, correct: 555192
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 409
BA10B Compute the Probability of an Outcome Given a Hidden Path 348
BA10C Implement the Viterbi Algorithm 211
BA10D Compute the Probability of a String Emitted by an HMM 186
BA10E Construct a Profile HMM 120
BA10F Construct a Profile HMM with Pseudocounts 111
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 56
BA10H Estimate the Parameters of an HMM 73
BA10I Implement Viterbi Learning 63
BA10J Solve the Soft Decoding Problem 62
BA10K Implement Baum-Welch Learning 48
BA11A Construct the Graph of a Spectrum 98
BA11B Implement DecodingIdealSpectrum 69
BA11C Convert a Peptide into a Peptide Vector 101
BA11D Convert a Peptide Vector into a Peptide 95
BA11E Sequence a Peptide 57
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 58
BA11G Implement PSMSearch 57
BA11H Compute the Size of a Spectral Dictionary 48
BA11I Compute the Probability of a Spectral Dictionary 48
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 38
BA1A Compute the Number of Times a Pattern Appears in a Text 876
BA1B Find the Most Frequent Words in a String 1043
BA1C Find the Reverse Complement of a String 991
BA1D Find All Occurrences of a Pattern in a String 905
BA1E Find Patterns Forming Clumps in a String 694
BA1F Find a Position in a Genome Minimizing the Skew 684
BA1G Compute the Hamming Distance Between Two Strings 757
BA1H Find All Approximate Occurrences of a Pattern in a String 652
BA1I Find the Most Frequent Words with Mismatches in a String 521
BA1J Find Frequent Words with Mismatches and Reverse Complements 467
BA1K Generate the Frequency Array of a String 436
BA1L Implement PatternToNumber 490
BA1M Implement NumberToPattern 452
BA1N Generate the d-Neighborhood of a String 475
BA2A Implement MotifEnumeration 389
BA2B Find a Median String 379
BA2C Find a Profile-most Probable k-mer in a String 399
BA2D Implement GreedyMotifSearch 330
BA2E Implement GreedyMotifSearch with Pseudocounts 279
BA2F Implement RandomizedMotifSearch 229
BA2G Implement GibbsSampler 208
BA2H Implement DistanceBetweenPatternAndStrings 262
BA3A Generate the k-mer Composition of a String 485
BA3B Reconstruct a String from its Genome Path 444
BA3C Construct the Overlap Graph of a Collection of k-mers 390
BA3D Construct the De Bruijn Graph of a String 404
BA3E Construct the De Bruijn Graph of a Collection of k-mers 380
BA3F Find an Eulerian Cycle in a Graph 280
BA3G Find an Eulerian Path in a Graph 234
BA3H Reconstruct a String from its k-mer Composition 224
BA3I Find a k-Universal Circular String 169
BA3J Reconstruct a String from its Paired Composition 162
BA3K Generate Contigs from a Collection of Reads 166
BA3L Construct a String Spelled by a Gapped Genome Path 136
BA3M Generate All Maximal Non-Branching Paths in a Graph 113
BA4A Translate an RNA String into an Amino Acid String 339
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 242
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 239
BA4D Compute the Number of Peptides of Given Total Mass 133
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 165
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 138
BA4G Implement LeaderboardCyclopeptideSequencing 127
BA4H Generate the Convolution of a Spectrum 130
BA4I Implement ConvolutionCyclopeptideSequencing 96
BA4J Generate the Theoretical Spectrum of a Linear Peptide 148
BA4K Compute the Score of a Linear Peptide 113
BA4L Trim a Peptide Leaderboard 98
BA4M Solve the Turnpike Problem 66
BA5A Find the Minimum Number of Coins Needed to Make Change 452
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 363
BA5C Find a Longest Common Subsequence of Two Strings 447
BA5D Find the Longest Path in a DAG 299
BA5E Find a Highest-Scoring Alignment of Two Strings 402
BA5F Find a Highest-Scoring Local Alignment of Two Strings 330
BA5G Compute the Edit Distance Between Two Strings 404
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 251
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 230
BA5J Align Two Strings Using Affine Gap Penalties 249
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 164
BA5L Align Two Strings Using Linear Space 143
BA5M Find a Highest-Scoring Multiple Sequence Alignment 167
BA5N Find a Topological Ordering of a DAG 108
BA6A Implement GreedySorting to Sort a Permutation by Reversals 265
BA6B Compute the Number of Breakpoints in a Permutation 288
BA6C Compute the 2-Break Distance Between a Pair of Genomes 191
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 55
BA6E Find All Shared k-mers of a Pair of Strings 197
BA6F Implement ChromosomeToCycle 114
BA6G Implement CycleToChromosome 109
BA6H Implement ColoredEdges 99
BA6I Implement GraphToGenome 81
BA6J Implement 2-BreakOnGenomeGraph 74
BA6K Implement 2-BreakOnGenome 64
BA7A Compute Distances Between Leaves 126
BA7B Compute Limb Lengths in a Tree 136
BA7C Implement AdditivePhylogeny 90
BA7D Implement UPGMA 86
BA7E Implement the Neighbor Joining Algorithm 72
BA7F Implement SmallParsimony 64
BA7G Adapt SmallParsimony to Unrooted Trees 41
BA8A Implement FarthestFirstTraversal 98
BA8B Compute the Squared Error Distortion 94
BA8C Implement the Lloyd Algorithm for k-Means Clustering 100
BA8D Implement the Soft k-Means Clustering Algorithm 81
BA8E Implement Hierarchical Clustering 77
BA9A Construct a Trie from a Collection of Patterns 226
BA9B Implement TrieMatching 202
BA9C Construct the Suffix Tree of a String 159
BA9D Find the Longest Repeat in a String 185
BA9E Find the Longest Substring Shared by Two Strings 173
BA9F Find the Shortest Non-Shared Substring of Two Strings 138
BA9G Construct the Suffix Array of a String 184
BA9H Pattern Matching with the Suffix Array 99
BA9I Construct the Burrows-Wheeler Transform of a String 217
BA9J Reconstruct a String from its Burrows-Wheeler Transform 179
BA9K Generate the Last-to-First Mapping of a String 102
BA9L Implement BWMatching 138
BA9M Implement BetterBWMatching 125
BA9N Find All Occurrences of a Collection of Patterns in a String 139
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 110
BA9P Implement TreeColoring 54
BA9Q Construct the Partial Suffix Array of a String 112
BA9R Construct a Suffix Tree from a Suffix Array 84