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: Nidhi_Gujar vs. “Mortal Fibonacci Rabbits”, 5 minutes ago
Problems: 285 (total), users: 55600, attempts: 935231, correct: 525305
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 375
BA10B Compute the Probability of an Outcome Given a Hidden Path 320
BA10C Implement the Viterbi Algorithm 195
BA10D Compute the Probability of a String Emitted by an HMM 174
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 788
BA1B Find the Most Frequent Words in a String 952
BA1C Find the Reverse Complement of a String 899
BA1D Find All Occurrences of a Pattern in a String 812
BA1E Find Patterns Forming Clumps in a String 625
BA1F Find a Position in a Genome Minimizing the Skew 626
BA1G Compute the Hamming Distance Between Two Strings 686
BA1H Find All Approximate Occurrences of a Pattern in a String 599
BA1I Find the Most Frequent Words with Mismatches in a String 479
BA1J Find Frequent Words with Mismatches and Reverse Complements 429
BA1K Generate the Frequency Array of a String 395
BA1L Implement PatternToNumber 443
BA1M Implement NumberToPattern 406
BA1N Generate the d-Neighborhood of a String 438
BA2A Implement MotifEnumeration 362
BA2B Find a Median String 349
BA2C Find a Profile-most Probable k-mer in a String 366
BA2D Implement GreedyMotifSearch 297
BA2E Implement GreedyMotifSearch with Pseudocounts 247
BA2F Implement RandomizedMotifSearch 205
BA2G Implement GibbsSampler 190
BA2H Implement DistanceBetweenPatternAndStrings 240
BA3A Generate the k-mer Composition of a String 440
BA3B Reconstruct a String from its Genome Path 412
BA3C Construct the Overlap Graph of a Collection of k-mers 362
BA3D Construct the De Bruijn Graph of a String 379
BA3E Construct the De Bruijn Graph of a Collection of k-mers 343
BA3F Find an Eulerian Cycle in a Graph 266
BA3G Find an Eulerian Path in a Graph 218
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 154
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 301
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 214
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 212
BA4D Compute the Number of Peptides of Given Total Mass 118
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 151
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 123
BA4G Implement LeaderboardCyclopeptideSequencing 117
BA4H Generate the Convolution of a Spectrum 118
BA4I Implement ConvolutionCyclopeptideSequencing 86
BA4J Generate the Theoretical Spectrum of a Linear Peptide 122
BA4K Compute the Score of a Linear Peptide 104
BA4L Trim a Peptide Leaderboard 91
BA4M Solve the Turnpike Problem 59
BA5A Find the Minimum Number of Coins Needed to Make Change 435
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 351
BA5C Find a Longest Common Subsequence of Two Strings 436
BA5D Find the Longest Path in a DAG 287
BA5E Find a Highest-Scoring Alignment of Two Strings 382
BA5F Find a Highest-Scoring Local Alignment of Two Strings 326
BA5G Compute the Edit Distance Between Two Strings 396
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 243
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 226
BA5J Align Two Strings Using Affine Gap Penalties 243
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 161
BA5L Align Two Strings Using Linear Space 140
BA5M Find a Highest-Scoring Multiple Sequence Alignment 163
BA5N Find a Topological Ordering of a DAG 100
BA6A Implement GreedySorting to Sort a Permutation by Reversals 258
BA6B Compute the Number of Breakpoints in a Permutation 280
BA6C Compute the 2-Break Distance Between a Pair of Genomes 179
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 52
BA6E Find All Shared k-mers of a Pair of Strings 191
BA6F Implement ChromosomeToCycle 109
BA6G Implement CycleToChromosome 104
BA6H Implement ColoredEdges 94
BA6I Implement GraphToGenome 77
BA6J Implement 2-BreakOnGenomeGraph 71
BA6K Implement 2-BreakOnGenome 61
BA7A Compute Distances Between Leaves 119
BA7B Compute Limb Lengths in a Tree 125
BA7C Implement AdditivePhylogeny 85
BA7D Implement UPGMA 79
BA7E Implement the Neighbor Joining Algorithm 66
BA7F Implement SmallParsimony 57
BA7G Adapt SmallParsimony to Unrooted Trees 35
BA8A Implement FarthestFirstTraversal 90
BA8B Compute the Squared Error Distortion 86
BA8C Implement the Lloyd Algorithm for k-Means Clustering 87
BA8D Implement the Soft k-Means Clustering Algorithm 74
BA8E Implement Hierarchical Clustering 72
BA9A Construct a Trie from a Collection of Patterns 216
BA9B Implement TrieMatching 192
BA9C Construct the Suffix Tree of a String 150
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 133
BA9G Construct the Suffix Array of a String 177
BA9H Pattern Matching with the Suffix Array 92
BA9I Construct the Burrows-Wheeler Transform of a String 208
BA9J Reconstruct a String from its Burrows-Wheeler Transform 172
BA9K Generate the Last-to-First Mapping of a String 96
BA9L Implement BWMatching 132
BA9M Implement BetterBWMatching 120
BA9N Find All Occurrences of a Collection of Patterns in a String 133
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 105
BA9P Implement TreeColoring 49
BA9Q Construct the Partial Suffix Array of a String 106
BA9R Construct a Suffix Tree from a Suffix Array 79