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: Lucas Manns vs. “Complementing a Strand of DNA”, 10 minutes ago
Problems: 284 (total), users: 113327
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 859
BA10B Compute the Probability of an Outcome Given a Hidden Path 713
BA10C Implement the Viterbi Algorithm 566
BA10D Compute the Probability of a String Emitted by an HMM 361
BA10E Construct a Profile HMM 201
BA10F Construct a Profile HMM with Pseudocounts 191
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 110
BA10H Estimate the Parameters of an HMM 173
BA10I Implement Viterbi Learning 135
BA10J Solve the Soft Decoding Problem 159
BA10K Implement Baum-Welch Learning 147
BA11A Construct the Graph of a Spectrum 185
BA11B Implement DecodingIdealSpectrum 136
BA11C Convert a Peptide into a Peptide Vector 193
BA11D Convert a Peptide Vector into a Peptide 185
BA11E Sequence a Peptide 111
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 110
BA11G Implement PSMSearch 103
BA11H Compute the Size of a Spectral Dictionary 95
BA11I Compute the Probability of a Spectral Dictionary 94
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 69
BA1A Compute the Number of Times a Pattern Appears in a Text 3056
BA1B Find the Most Frequent Words in a String 3138
BA1C Find the Reverse Complement of a String 2968
BA1D Find All Occurrences of a Pattern in a String 2856
BA1E Find Patterns Forming Clumps in a String 2487
BA1F Find a Position in a Genome Minimizing the Skew 2463
BA1G Compute the Hamming Distance Between Two Strings 2549
BA1H Find All Approximate Occurrences of a Pattern in a String 1974
BA1I Find the Most Frequent Words with Mismatches in a String 1548
BA1J Find Frequent Words with Mismatches and Reverse Complements 1410
BA1K Generate the Frequency Array of a String 1246
BA1L Implement PatternToNumber 1480
BA1M Implement NumberToPattern 1421
BA1N Generate the d-Neighborhood of a String 1282
BA2A Implement MotifEnumeration 1287
BA2B Find a Median String 1359
BA2C Find a Profile-most Probable k-mer in a String 1205
BA2D Implement GreedyMotifSearch 1085
BA2E Implement GreedyMotifSearch with Pseudocounts 970
BA2F Implement RandomizedMotifSearch 955
BA2G Implement GibbsSampler 733
BA2H Implement DistanceBetweenPatternAndStrings 1045
BA3A Generate the k-mer Composition of a String 1432
BA3B Reconstruct a String from its Genome Path 1335
BA3C Construct the Overlap Graph of a Collection of k-mers 1244
BA3D Construct the De Bruijn Graph of a String 1207
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1109
BA3F Find an Eulerian Cycle in a Graph 875
BA3G Find an Eulerian Path in a Graph 805
BA3H Reconstruct a String from its k-mer Composition 911
BA3I Find a k-Universal Circular String 647
BA3J Reconstruct a String from its Paired Composition 655
BA3K Generate Contigs from a Collection of Reads 496
BA3L Construct a String Spelled by a Gapped Genome Path 491
BA3M Generate All Maximal Non-Branching Paths in a Graph 369
BA4A Translate an RNA String into an Amino Acid String 932
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 855
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 768
BA4D Compute the Number of Peptides of Given Total Mass 633
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 629
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 498
BA4G Implement LeaderboardCyclopeptideSequencing 481
BA4H Generate the Convolution of a Spectrum 476
BA4I Implement ConvolutionCyclopeptideSequencing 317
BA4J Generate the Theoretical Spectrum of a Linear Peptide 451
BA4K Compute the Score of a Linear Peptide 395
BA4L Trim a Peptide Leaderboard 356
BA4M Solve the Turnpike Problem 199
BA5A Find the Minimum Number of Coins Needed to Make Change 1039
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 878
BA5C Find a Longest Common Subsequence of Two Strings 964
BA5D Find the Longest Path in a DAG 639
BA5E Find a Highest-Scoring Alignment of Two Strings 887
BA5F Find a Highest-Scoring Local Alignment of Two Strings 755
BA5G Compute the Edit Distance Between Two Strings 784
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 537
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 465
BA5J Align Two Strings Using Affine Gap Penalties 622
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 360
BA5L Align Two Strings Using Linear Space 317
BA5M Find a Highest-Scoring Multiple Sequence Alignment 362
BA5N Find a Topological Ordering of a DAG 344
BA6A Implement GreedySorting to Sort a Permutation by Reversals 544
BA6B Compute the Number of Breakpoints in a Permutation 580
BA6C Compute the 2-Break Distance Between a Pair of Genomes 393
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 247
BA6E Find All Shared k-mers of a Pair of Strings 312
BA6F Implement ChromosomeToCycle 285
BA6G Implement CycleToChromosome 279
BA6H Implement ColoredEdges 253
BA6I Implement GraphToGenome 217
BA6J Implement 2-BreakOnGenomeGraph 214
BA6K Implement 2-BreakOnGenome 183
BA7A Compute Distances Between Leaves 295
BA7B Compute Limb Lengths in a Tree 345
BA7C Implement AdditivePhylogeny 324
BA7D Implement UPGMA 224
BA7E Implement the Neighbor Joining Algorithm 208
BA7F Implement SmallParsimony 149
BA7G Adapt SmallParsimony to Unrooted Trees 108
BA8A Implement FarthestFirstTraversal 219
BA8B Compute the Squared Error Distortion 220
BA8C Implement the Lloyd Algorithm for k-Means Clustering 257
BA8D Implement the Soft k-Means Clustering Algorithm 183
BA8E Implement Hierarchical Clustering 187
BA9A Construct a Trie from a Collection of Patterns 391
BA9B Implement TrieMatching 409
BA9C Construct the Suffix Tree of a String 300
BA9D Find the Longest Repeat in a String 413
BA9E Find the Longest Substring Shared by Two Strings 300
BA9F Find the Shortest Non-Shared Substring of Two Strings 252
BA9G Construct the Suffix Array of a String 358
BA9H Pattern Matching with the Suffix Array 304
BA9I Construct the Burrows-Wheeler Transform of a String 414
BA9J Reconstruct a String from its Burrows-Wheeler Transform 363
BA9K Generate the Last-to-First Mapping of a String 301
BA9L Implement BWMatching 269
BA9M Implement BetterBWMatching 237
BA9N Find All Occurrences of a Collection of Patterns in a String 250
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 231
BA9P Implement TreeColoring 117
BA9Q Construct the Partial Suffix Array of a String 191
BA9R Construct a Suffix Tree from a Suffix Array 138