Problems

Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.

Problems: 285 (total), users: 84865, attempts: 1403921, correct: 776857
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 628
BA10B Compute the Probability of an Outcome Given a Hidden Path 525
BA10C Implement the Viterbi Algorithm 317
BA10D Compute the Probability of a String Emitted by an HMM 258
BA10E Construct a Profile HMM 158
BA10F Construct a Profile HMM with Pseudocounts 149
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 84
BA10H Estimate the Parameters of an HMM 125
BA10I Implement Viterbi Learning 100
BA10J Solve the Soft Decoding Problem 105
BA10K Implement Baum-Welch Learning 83
BA11A Construct the Graph of a Spectrum 144
BA11B Implement DecodingIdealSpectrum 101
BA11C Convert a Peptide into a Peptide Vector 150
BA11D Convert a Peptide Vector into a Peptide 144
BA11E Sequence a Peptide 83
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 83
BA11G Implement PSMSearch 80
BA11H Compute the Size of a Spectral Dictionary 71
BA11I Compute the Probability of a Spectral Dictionary 70
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 56
BA1A Compute the Number of Times a Pattern Appears in a Text 1741
BA1B Find the Most Frequent Words in a String 1900
BA1C Find the Reverse Complement of a String 1831
BA1D Find All Occurrences of a Pattern in a String 1699
BA1E Find Patterns Forming Clumps in a String 1415
BA1F Find a Position in a Genome Minimizing the Skew 1310
BA1G Compute the Hamming Distance Between Two Strings 1484
BA1H Find All Approximate Occurrences of a Pattern in a String 1165
BA1I Find the Most Frequent Words with Mismatches in a String 954
BA1J Find Frequent Words with Mismatches and Reverse Complements 862
BA1K Generate the Frequency Array of a String 765
BA1L Implement PatternToNumber 844
BA1M Implement NumberToPattern 800
BA1N Generate the d-Neighborhood of a String 796
BA2A Implement MotifEnumeration 683
BA2B Find a Median String 715
BA2C Find a Profile-most Probable k-mer in a String 711
BA2D Implement GreedyMotifSearch 618
BA2E Implement GreedyMotifSearch with Pseudocounts 543
BA2F Implement RandomizedMotifSearch 451
BA2G Implement GibbsSampler 385
BA2H Implement DistanceBetweenPatternAndStrings 489
BA3A Generate the k-mer Composition of a String 866
BA3B Reconstruct a String from its Genome Path 782
BA3C Construct the Overlap Graph of a Collection of k-mers 731
BA3D Construct the De Bruijn Graph of a String 753
BA3E Construct the De Bruijn Graph of a Collection of k-mers 664
BA3F Find an Eulerian Cycle in a Graph 501
BA3G Find an Eulerian Path in a Graph 449
BA3H Reconstruct a String from its k-mer Composition 516
BA3I Find a k-Universal Circular String 355
BA3J Reconstruct a String from its Paired Composition 307
BA3K Generate Contigs from a Collection of Reads 292
BA3L Construct a String Spelled by a Gapped Genome Path 264
BA3M Generate All Maximal Non-Branching Paths in a Graph 225
BA4A Translate an RNA String into an Amino Acid String 574
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 476
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 445
BA4D Compute the Number of Peptides of Given Total Mass 314
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 355
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 278
BA4G Implement LeaderboardCyclopeptideSequencing 266
BA4H Generate the Convolution of a Spectrum 261
BA4I Implement ConvolutionCyclopeptideSequencing 187
BA4J Generate the Theoretical Spectrum of a Linear Peptide 276
BA4K Compute the Score of a Linear Peptide 222
BA4L Trim a Peptide Leaderboard 201
BA4M Solve the Turnpike Problem 118
BA5A Find the Minimum Number of Coins Needed to Make Change 649
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 519
BA5C Find a Longest Common Subsequence of Two Strings 657
BA5D Find the Longest Path in a DAG 409
BA5E Find a Highest-Scoring Alignment of Two Strings 608
BA5F Find a Highest-Scoring Local Alignment of Two Strings 479
BA5G Compute the Edit Distance Between Two Strings 534
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 347
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 310
BA5J Align Two Strings Using Affine Gap Penalties 351
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 223
BA5L Align Two Strings Using Linear Space 195
BA5M Find a Highest-Scoring Multiple Sequence Alignment 231
BA5N Find a Topological Ordering of a DAG 175
BA6A Implement GreedySorting to Sort a Permutation by Reversals 354
BA6B Compute the Number of Breakpoints in a Permutation 392
BA6C Compute the 2-Break Distance Between a Pair of Genomes 259
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 95
BA6E Find All Shared k-mers of a Pair of Strings 230
BA6F Implement ChromosomeToCycle 160
BA6G Implement CycleToChromosome 154
BA6H Implement ColoredEdges 145
BA6I Implement GraphToGenome 118
BA6J Implement 2-BreakOnGenomeGraph 123
BA6K Implement 2-BreakOnGenome 108
BA7A Compute Distances Between Leaves 207
BA7B Compute Limb Lengths in a Tree 227
BA7C Implement AdditivePhylogeny 177
BA7D Implement UPGMA 157
BA7E Implement the Neighbor Joining Algorithm 160
BA7F Implement SmallParsimony 113
BA7G Adapt SmallParsimony to Unrooted Trees 79
BA8A Implement FarthestFirstTraversal 150
BA8B Compute the Squared Error Distortion 146
BA8C Implement the Lloyd Algorithm for k-Means Clustering 159
BA8D Implement the Soft k-Means Clustering Algorithm 112
BA8E Implement Hierarchical Clustering 118
BA9A Construct a Trie from a Collection of Patterns 297
BA9B Implement TrieMatching 276
BA9C Construct the Suffix Tree of a String 214
BA9D Find the Longest Repeat in a String 235
BA9E Find the Longest Substring Shared by Two Strings 214
BA9F Find the Shortest Non-Shared Substring of Two Strings 176
BA9G Construct the Suffix Array of a String 264
BA9H Pattern Matching with the Suffix Array 147
BA9I Construct the Burrows-Wheeler Transform of a String 305
BA9J Reconstruct a String from its Burrows-Wheeler Transform 257
BA9K Generate the Last-to-First Mapping of a String 194
BA9L Implement BWMatching 199
BA9M Implement BetterBWMatching 181
BA9N Find All Occurrences of a Collection of Patterns in a String 183
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 149
BA9P Implement TreeColoring 78
BA9Q Construct the Partial Suffix Array of a String 144
BA9R Construct a Suffix Tree from a Suffix Array 108