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: johnsekar vs. “Computing GC Content”, 1 minute ago
Problems: 284 (total), users: 92440, attempts: 1524474, correct: 843189
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 675
BA10B Compute the Probability of an Outcome Given a Hidden Path 567
BA10C Implement the Viterbi Algorithm 386
BA10D Compute the Probability of a String Emitted by an HMM 283
BA10E Construct a Profile HMM 169
BA10F Construct a Profile HMM with Pseudocounts 160
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 92
BA10H Estimate the Parameters of an HMM 144
BA10I Implement Viterbi Learning 111
BA10J Solve the Soft Decoding Problem 119
BA10K Implement Baum-Welch Learning 104
BA11A Construct the Graph of a Spectrum 160
BA11B Implement DecodingIdealSpectrum 114
BA11C Convert a Peptide into a Peptide Vector 165
BA11D Convert a Peptide Vector into a Peptide 159
BA11E Sequence a Peptide 93
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 91
BA11G Implement PSMSearch 87
BA11H Compute the Size of a Spectral Dictionary 80
BA11I Compute the Probability of a Spectral Dictionary 79
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 59
BA1A Compute the Number of Times a Pattern Appears in a Text 2006
BA1B Find the Most Frequent Words in a String 2155
BA1C Find the Reverse Complement of a String 2065
BA1D Find All Occurrences of a Pattern in a String 1932
BA1E Find Patterns Forming Clumps in a String 1652
BA1F Find a Position in a Genome Minimizing the Skew 1630
BA1G Compute the Hamming Distance Between Two Strings 1688
BA1H Find All Approximate Occurrences of a Pattern in a String 1359
BA1I Find the Most Frequent Words with Mismatches in a String 1138
BA1J Find Frequent Words with Mismatches and Reverse Complements 1026
BA1K Generate the Frequency Array of a String 904
BA1L Implement PatternToNumber 1092
BA1M Implement NumberToPattern 1046
BA1N Generate the d-Neighborhood of a String 933
BA2A Implement MotifEnumeration 917
BA2B Find a Median String 891
BA2C Find a Profile-most Probable k-mer in a String 834
BA2D Implement GreedyMotifSearch 776
BA2E Implement GreedyMotifSearch with Pseudocounts 667
BA2F Implement RandomizedMotifSearch 583
BA2G Implement GibbsSampler 486
BA2H Implement DistanceBetweenPatternAndStrings 704
BA3A Generate the k-mer Composition of a String 1018
BA3B Reconstruct a String from its Genome Path 951
BA3C Construct the Overlap Graph of a Collection of k-mers 885
BA3D Construct the De Bruijn Graph of a String 870
BA3E Construct the De Bruijn Graph of a Collection of k-mers 768
BA3F Find an Eulerian Cycle in a Graph 599
BA3G Find an Eulerian Path in a Graph 540
BA3H Reconstruct a String from its k-mer Composition 658
BA3I Find a k-Universal Circular String 451
BA3J Reconstruct a String from its Paired Composition 408
BA3K Generate Contigs from a Collection of Reads 347
BA3L Construct a String Spelled by a Gapped Genome Path 334
BA3M Generate All Maximal Non-Branching Paths in a Graph 262
BA4A Translate an RNA String into an Amino Acid String 679
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 595
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 532
BA4D Compute the Number of Peptides of Given Total Mass 394
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 421
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 331
BA4G Implement LeaderboardCyclopeptideSequencing 325
BA4H Generate the Convolution of a Spectrum 321
BA4I Implement ConvolutionCyclopeptideSequencing 219
BA4J Generate the Theoretical Spectrum of a Linear Peptide 320
BA4K Compute the Score of a Linear Peptide 263
BA4L Trim a Peptide Leaderboard 238
BA4M Solve the Turnpike Problem 143
BA5A Find the Minimum Number of Coins Needed to Make Change 747
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 598
BA5C Find a Longest Common Subsequence of Two Strings 721
BA5D Find the Longest Path in a DAG 454
BA5E Find a Highest-Scoring Alignment of Two Strings 670
BA5F Find a Highest-Scoring Local Alignment of Two Strings 543
BA5G Compute the Edit Distance Between Two Strings 585
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 382
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 345
BA5J Align Two Strings Using Affine Gap Penalties 422
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 252
BA5L Align Two Strings Using Linear Space 222
BA5M Find a Highest-Scoring Multiple Sequence Alignment 261
BA5N Find a Topological Ordering of a DAG 215
BA6A Implement GreedySorting to Sort a Permutation by Reversals 395
BA6B Compute the Number of Breakpoints in a Permutation 442
BA6C Compute the 2-Break Distance Between a Pair of Genomes 286
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 125
BA6E Find All Shared k-mers of a Pair of Strings 251
BA6F Implement ChromosomeToCycle 186
BA6G Implement CycleToChromosome 181
BA6H Implement ColoredEdges 168
BA6I Implement GraphToGenome 140
BA6J Implement 2-BreakOnGenomeGraph 145
BA6K Implement 2-BreakOnGenome 128
BA7A Compute Distances Between Leaves 235
BA7B Compute Limb Lengths in a Tree 265
BA7C Implement AdditivePhylogeny 216
BA7D Implement UPGMA 190
BA7E Implement the Neighbor Joining Algorithm 178
BA7F Implement SmallParsimony 122
BA7G Adapt SmallParsimony to Unrooted Trees 89
BA8A Implement FarthestFirstTraversal 170
BA8B Compute the Squared Error Distortion 169
BA8C Implement the Lloyd Algorithm for k-Means Clustering 182
BA8D Implement the Soft k-Means Clustering Algorithm 128
BA8E Implement Hierarchical Clustering 130
BA9A Construct a Trie from a Collection of Patterns 338
BA9B Implement TrieMatching 343
BA9C Construct the Suffix Tree of a String 240
BA9D Find the Longest Repeat in a String 293
BA9E Find the Longest Substring Shared by Two Strings 247
BA9F Find the Shortest Non-Shared Substring of Two Strings 204
BA9G Construct the Suffix Array of a String 303
BA9H Pattern Matching with the Suffix Array 202
BA9I Construct the Burrows-Wheeler Transform of a String 351
BA9J Reconstruct a String from its Burrows-Wheeler Transform 295
BA9K Generate the Last-to-First Mapping of a String 242
BA9L Implement BWMatching 221
BA9M Implement BetterBWMatching 193
BA9N Find All Occurrences of a Collection of Patterns in a String 198
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 171
BA9P Implement TreeColoring 87
BA9Q Construct the Partial Suffix Array of a String 158
BA9R Construct a Suffix Tree from a Suffix Array 119