Problems

List Tree
Bioinformatics Textbook Track

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: RachL20 vs. “Strings and Lists”, 3 minutes ago
Problems: 284 (total), users: 132981
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1047
BA10B Compute the Probability of an Outcome Given a Hidden Path 852
BA10C Implement the Viterbi Algorithm 789
BA10D Compute the Probability of a String Emitted by an HMM 454
BA10E Construct a Profile HMM 244
BA10F Construct a Profile HMM with Pseudocounts 237
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 140
BA10H Estimate the Parameters of an HMM 211
BA10I Implement Viterbi Learning 169
BA10J Solve the Soft Decoding Problem 197
BA10K Implement Baum-Welch Learning 175
BA11A Construct the Graph of a Spectrum 218
BA11B Implement DecodingIdealSpectrum 167
BA11C Convert a Peptide into a Peptide Vector 233
BA11D Convert a Peptide Vector into a Peptide 221
BA11E Sequence a Peptide 143
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 140
BA11G Implement PSMSearch 128
BA11H Compute the Size of a Spectral Dictionary 120
BA11I Compute the Probability of a Spectral Dictionary 120
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 87
BA1A Compute the Number of Times a Pattern Appears in a Text 3594
BA1B Find the Most Frequent Words in a String 3698
BA1C Find the Reverse Complement of a String 3465
BA1D Find All Occurrences of a Pattern in a String 3318
BA1E Find Patterns Forming Clumps in a String 2967
BA1F Find a Position in a Genome Minimizing the Skew 2882
BA1G Compute the Hamming Distance Between Two Strings 3031
BA1H Find All Approximate Occurrences of a Pattern in a String 2364
BA1I Find the Most Frequent Words with Mismatches in a String 1896
BA1J Find Frequent Words with Mismatches and Reverse Complements 1741
BA1K Generate the Frequency Array of a String 1527
BA1L Implement PatternToNumber 1765
BA1M Implement NumberToPattern 1698
BA1N Generate the d-Neighborhood of a String 1586
BA2A Implement MotifEnumeration 1636
BA2B Find a Median String 1722
BA2C Find a Profile-most Probable k-mer in a String 1546
BA2D Implement GreedyMotifSearch 1350
BA2E Implement GreedyMotifSearch with Pseudocounts 1248
BA2F Implement RandomizedMotifSearch 1344
BA2G Implement GibbsSampler 1001
BA2H Implement DistanceBetweenPatternAndStrings 1291
BA3A Generate the k-mer Composition of a String 1807
BA3B Reconstruct a String from its Genome Path 1625
BA3C Construct the Overlap Graph of a Collection of k-mers 1605
BA3D Construct the De Bruijn Graph of a String 1525
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1470
BA3F Find an Eulerian Cycle in a Graph 1235
BA3G Find an Eulerian Path in a Graph 1210
BA3H Reconstruct a String from its k-mer Composition 1228
BA3I Find a k-Universal Circular String 849
BA3J Reconstruct a String from its Paired Composition 878
BA3K Generate Contigs from a Collection of Reads 688
BA3L Construct a String Spelled by a Gapped Genome Path 674
BA3M Generate All Maximal Non-Branching Paths in a Graph 526
BA4A Translate an RNA String into an Amino Acid String 1138
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1089
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 932
BA4D Compute the Number of Peptides of Given Total Mass 788
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 784
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 645
BA4G Implement LeaderboardCyclopeptideSequencing 631
BA4H Generate the Convolution of a Spectrum 620
BA4I Implement ConvolutionCyclopeptideSequencing 446
BA4J Generate the Theoretical Spectrum of a Linear Peptide 588
BA4K Compute the Score of a Linear Peptide 528
BA4L Trim a Peptide Leaderboard 491
BA4M Solve the Turnpike Problem 306
BA5A Find the Minimum Number of Coins Needed to Make Change 1268
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1132
BA5C Find a Longest Common Subsequence of Two Strings 1215
BA5D Find the Longest Path in a DAG 854
BA5E Find a Highest-Scoring Alignment of Two Strings 1156
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1011
BA5G Compute the Edit Distance Between Two Strings 1016
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 753
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 620
BA5J Align Two Strings Using Affine Gap Penalties 981
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 510
BA5L Align Two Strings Using Linear Space 441
BA5M Find a Highest-Scoring Multiple Sequence Alignment 510
BA5N Find a Topological Ordering of a DAG 501
BA6A Implement GreedySorting to Sort a Permutation by Reversals 603
BA6B Compute the Number of Breakpoints in a Permutation 643
BA6C Compute the 2-Break Distance Between a Pair of Genomes 446
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 279
BA6E Find All Shared k-mers of a Pair of Strings 355
BA6F Implement ChromosomeToCycle 328
BA6G Implement CycleToChromosome 322
BA6H Implement ColoredEdges 294
BA6I Implement GraphToGenome 259
BA6J Implement 2-BreakOnGenomeGraph 254
BA6K Implement 2-BreakOnGenome 221
BA7A Compute Distances Between Leaves 378
BA7B Compute Limb Lengths in a Tree 392
BA7C Implement AdditivePhylogeny 399
BA7D Implement UPGMA 319
BA7E Implement the Neighbor Joining Algorithm 290
BA7F Implement SmallParsimony 177
BA7G Adapt SmallParsimony to Unrooted Trees 134
BA8A Implement FarthestFirstTraversal 264
BA8B Compute the Squared Error Distortion 263
BA8C Implement the Lloyd Algorithm for k-Means Clustering 303
BA8D Implement the Soft k-Means Clustering Algorithm 224
BA8E Implement Hierarchical Clustering 227
BA9A Construct a Trie from a Collection of Patterns 523
BA9B Implement TrieMatching 526
BA9C Construct the Suffix Tree of a String 382
BA9D Find the Longest Repeat in a String 456
BA9E Find the Longest Substring Shared by Two Strings 331
BA9F Find the Shortest Non-Shared Substring of Two Strings 283
BA9G Construct the Suffix Array of a String 429
BA9H Pattern Matching with the Suffix Array 413
BA9I Construct the Burrows-Wheeler Transform of a String 571
BA9J Reconstruct a String from its Burrows-Wheeler Transform 491
BA9K Generate the Last-to-First Mapping of a String 341
BA9L Implement BWMatching 324
BA9M Implement BetterBWMatching 302
BA9N Find All Occurrences of a Collection of Patterns in a String 306
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 260
BA9P Implement TreeColoring 146
BA9Q Construct the Partial Suffix Array of a String 214
BA9R Construct a Suffix Tree from a Suffix Array 159