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: dshalamay vs. “Mortal Fibonacci Rabbits”, 1 minute ago
Problems: 284 (total), users: 127473
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1009
BA10B Compute the Probability of an Outcome Given a Hidden Path 825
BA10C Implement the Viterbi Algorithm 766
BA10D Compute the Probability of a String Emitted by an HMM 435
BA10E Construct a Profile HMM 236
BA10F Construct a Profile HMM with Pseudocounts 227
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 131
BA10H Estimate the Parameters of an HMM 203
BA10I Implement Viterbi Learning 163
BA10J Solve the Soft Decoding Problem 185
BA10K Implement Baum-Welch Learning 169
BA11A Construct the Graph of a Spectrum 209
BA11B Implement DecodingIdealSpectrum 157
BA11C Convert a Peptide into a Peptide Vector 223
BA11D Convert a Peptide Vector into a Peptide 210
BA11E Sequence a Peptide 134
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 132
BA11G Implement PSMSearch 119
BA11H Compute the Size of a Spectral Dictionary 112
BA11I Compute the Probability of a Spectral Dictionary 113
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 78
BA1A Compute the Number of Times a Pattern Appears in a Text 3500
BA1B Find the Most Frequent Words in a String 3569
BA1C Find the Reverse Complement of a String 3379
BA1D Find All Occurrences of a Pattern in a String 3238
BA1E Find Patterns Forming Clumps in a String 2862
BA1F Find a Position in a Genome Minimizing the Skew 2813
BA1G Compute the Hamming Distance Between Two Strings 2923
BA1H Find All Approximate Occurrences of a Pattern in a String 2299
BA1I Find the Most Frequent Words with Mismatches in a String 1841
BA1J Find Frequent Words with Mismatches and Reverse Complements 1683
BA1K Generate the Frequency Array of a String 1475
BA1L Implement PatternToNumber 1713
BA1M Implement NumberToPattern 1648
BA1N Generate the d-Neighborhood of a String 1540
BA2A Implement MotifEnumeration 1546
BA2B Find a Median String 1627
BA2C Find a Profile-most Probable k-mer in a String 1455
BA2D Implement GreedyMotifSearch 1310
BA2E Implement GreedyMotifSearch with Pseudocounts 1196
BA2F Implement RandomizedMotifSearch 1293
BA2G Implement GibbsSampler 949
BA2H Implement DistanceBetweenPatternAndStrings 1251
BA3A Generate the k-mer Composition of a String 1717
BA3B Reconstruct a String from its Genome Path 1574
BA3C Construct the Overlap Graph of a Collection of k-mers 1547
BA3D Construct the De Bruijn Graph of a String 1438
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1380
BA3F Find an Eulerian Cycle in a Graph 1147
BA3G Find an Eulerian Path in a Graph 1126
BA3H Reconstruct a String from its k-mer Composition 1104
BA3I Find a k-Universal Circular String 806
BA3J Reconstruct a String from its Paired Composition 838
BA3K Generate Contigs from a Collection of Reads 643
BA3L Construct a String Spelled by a Gapped Genome Path 634
BA3M Generate All Maximal Non-Branching Paths in a Graph 489
BA4A Translate an RNA String into an Amino Acid String 1095
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1039
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 887
BA4D Compute the Number of Peptides of Given Total Mass 752
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 739
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 607
BA4G Implement LeaderboardCyclopeptideSequencing 590
BA4H Generate the Convolution of a Spectrum 579
BA4I Implement ConvolutionCyclopeptideSequencing 411
BA4J Generate the Theoretical Spectrum of a Linear Peptide 556
BA4K Compute the Score of a Linear Peptide 496
BA4L Trim a Peptide Leaderboard 456
BA4M Solve the Turnpike Problem 275
BA5A Find the Minimum Number of Coins Needed to Make Change 1202
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1065
BA5C Find a Longest Common Subsequence of Two Strings 1152
BA5D Find the Longest Path in a DAG 793
BA5E Find a Highest-Scoring Alignment of Two Strings 1064
BA5F Find a Highest-Scoring Local Alignment of Two Strings 915
BA5G Compute the Edit Distance Between Two Strings 922
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 665
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 576
BA5J Align Two Strings Using Affine Gap Penalties 836
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 453
BA5L Align Two Strings Using Linear Space 393
BA5M Find a Highest-Scoring Multiple Sequence Alignment 455
BA5N Find a Topological Ordering of a DAG 444
BA6A Implement GreedySorting to Sort a Permutation by Reversals 587
BA6B Compute the Number of Breakpoints in a Permutation 624
BA6C Compute the 2-Break Distance Between a Pair of Genomes 427
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 266
BA6E Find All Shared k-mers of a Pair of Strings 343
BA6F Implement ChromosomeToCycle 317
BA6G Implement CycleToChromosome 311
BA6H Implement ColoredEdges 282
BA6I Implement GraphToGenome 246
BA6J Implement 2-BreakOnGenomeGraph 243
BA6K Implement 2-BreakOnGenome 209
BA7A Compute Distances Between Leaves 366
BA7B Compute Limb Lengths in a Tree 381
BA7C Implement AdditivePhylogeny 390
BA7D Implement UPGMA 270
BA7E Implement the Neighbor Joining Algorithm 242
BA7F Implement SmallParsimony 169
BA7G Adapt SmallParsimony to Unrooted Trees 126
BA8A Implement FarthestFirstTraversal 256
BA8B Compute the Squared Error Distortion 256
BA8C Implement the Lloyd Algorithm for k-Means Clustering 291
BA8D Implement the Soft k-Means Clustering Algorithm 211
BA8E Implement Hierarchical Clustering 213
BA9A Construct a Trie from a Collection of Patterns 475
BA9B Implement TrieMatching 462
BA9C Construct the Suffix Tree of a String 357
BA9D Find the Longest Repeat in a String 448
BA9E Find the Longest Substring Shared by Two Strings 325
BA9F Find the Shortest Non-Shared Substring of Two Strings 276
BA9G Construct the Suffix Array of a String 423
BA9H Pattern Matching with the Suffix Array 352
BA9I Construct the Burrows-Wheeler Transform of a String 508
BA9J Reconstruct a String from its Burrows-Wheeler Transform 433
BA9K Generate the Last-to-First Mapping of a String 334
BA9L Implement BWMatching 316
BA9M Implement BetterBWMatching 278
BA9N Find All Occurrences of a Collection of Patterns in a String 276
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 255
BA9P Implement TreeColoring 141
BA9Q Construct the Partial Suffix Array of a String 209
BA9R Construct a Suffix Tree from a Suffix Array 154