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: sampereztamayo vs. “Counting DNA Nucleotides”, 32 minutes ago
Problems: 284 (total), users: 124557
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 971
BA10B Compute the Probability of an Outcome Given a Hidden Path 802
BA10C Implement the Viterbi Algorithm 642
BA10D Compute the Probability of a String Emitted by an HMM 418
BA10E Construct a Profile HMM 230
BA10F Construct a Profile HMM with Pseudocounts 219
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 126
BA10H Estimate the Parameters of an HMM 195
BA10I Implement Viterbi Learning 156
BA10J Solve the Soft Decoding Problem 180
BA10K Implement Baum-Welch Learning 165
BA11A Construct the Graph of a Spectrum 202
BA11B Implement DecodingIdealSpectrum 151
BA11C Convert a Peptide into a Peptide Vector 216
BA11D Convert a Peptide Vector into a Peptide 203
BA11E Sequence a Peptide 126
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 125
BA11G Implement PSMSearch 114
BA11H Compute the Size of a Spectral Dictionary 107
BA11I Compute the Probability of a Spectral Dictionary 107
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 75
BA1A Compute the Number of Times a Pattern Appears in a Text 3362
BA1B Find the Most Frequent Words in a String 3431
BA1C Find the Reverse Complement of a String 3252
BA1D Find All Occurrences of a Pattern in a String 3110
BA1E Find Patterns Forming Clumps in a String 2729
BA1F Find a Position in a Genome Minimizing the Skew 2692
BA1G Compute the Hamming Distance Between Two Strings 2806
BA1H Find All Approximate Occurrences of a Pattern in a String 2180
BA1I Find the Most Frequent Words with Mismatches in a String 1743
BA1J Find Frequent Words with Mismatches and Reverse Complements 1594
BA1K Generate the Frequency Array of a String 1391
BA1L Implement PatternToNumber 1630
BA1M Implement NumberToPattern 1567
BA1N Generate the d-Neighborhood of a String 1453
BA2A Implement MotifEnumeration 1460
BA2B Find a Median String 1533
BA2C Find a Profile-most Probable k-mer in a String 1373
BA2D Implement GreedyMotifSearch 1234
BA2E Implement GreedyMotifSearch with Pseudocounts 1120
BA2F Implement RandomizedMotifSearch 1205
BA2G Implement GibbsSampler 873
BA2H Implement DistanceBetweenPatternAndStrings 1182
BA3A Generate the k-mer Composition of a String 1635
BA3B Reconstruct a String from its Genome Path 1499
BA3C Construct the Overlap Graph of a Collection of k-mers 1474
BA3D Construct the De Bruijn Graph of a String 1366
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1308
BA3F Find an Eulerian Cycle in a Graph 1074
BA3G Find an Eulerian Path in a Graph 1051
BA3H Reconstruct a String from its k-mer Composition 1041
BA3I Find a k-Universal Circular String 746
BA3J Reconstruct a String from its Paired Composition 775
BA3K Generate Contigs from a Collection of Reads 579
BA3L Construct a String Spelled by a Gapped Genome Path 573
BA3M Generate All Maximal Non-Branching Paths in a Graph 435
BA4A Translate an RNA String into an Amino Acid String 1040
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 999
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 848
BA4D Compute the Number of Peptides of Given Total Mass 713
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 700
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 566
BA4G Implement LeaderboardCyclopeptideSequencing 551
BA4H Generate the Convolution of a Spectrum 539
BA4I Implement ConvolutionCyclopeptideSequencing 375
BA4J Generate the Theoretical Spectrum of a Linear Peptide 519
BA4K Compute the Score of a Linear Peptide 459
BA4L Trim a Peptide Leaderboard 419
BA4M Solve the Turnpike Problem 243
BA5A Find the Minimum Number of Coins Needed to Make Change 1151
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1015
BA5C Find a Longest Common Subsequence of Two Strings 1105
BA5D Find the Longest Path in a DAG 741
BA5E Find a Highest-Scoring Alignment of Two Strings 1016
BA5F Find a Highest-Scoring Local Alignment of Two Strings 875
BA5G Compute the Edit Distance Between Two Strings 877
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 630
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 546
BA5J Align Two Strings Using Affine Gap Penalties 693
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 417
BA5L Align Two Strings Using Linear Space 360
BA5M Find a Highest-Scoring Multiple Sequence Alignment 419
BA5N Find a Topological Ordering of a DAG 410
BA6A Implement GreedySorting to Sort a Permutation by Reversals 575
BA6B Compute the Number of Breakpoints in a Permutation 612
BA6C Compute the 2-Break Distance Between a Pair of Genomes 417
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 259
BA6E Find All Shared k-mers of a Pair of Strings 332
BA6F Implement ChromosomeToCycle 306
BA6G Implement CycleToChromosome 300
BA6H Implement ColoredEdges 272
BA6I Implement GraphToGenome 238
BA6J Implement 2-BreakOnGenomeGraph 234
BA6K Implement 2-BreakOnGenome 201
BA7A Compute Distances Between Leaves 347
BA7B Compute Limb Lengths in a Tree 373
BA7C Implement AdditivePhylogeny 364
BA7D Implement UPGMA 246
BA7E Implement the Neighbor Joining Algorithm 229
BA7F Implement SmallParsimony 162
BA7G Adapt SmallParsimony to Unrooted Trees 117
BA8A Implement FarthestFirstTraversal 247
BA8B Compute the Squared Error Distortion 247
BA8C Implement the Lloyd Algorithm for k-Means Clustering 283
BA8D Implement the Soft k-Means Clustering Algorithm 204
BA8E Implement Hierarchical Clustering 206
BA9A Construct a Trie from a Collection of Patterns 465
BA9B Implement TrieMatching 444
BA9C Construct the Suffix Tree of a String 345
BA9D Find the Longest Repeat in a String 438
BA9E Find the Longest Substring Shared by Two Strings 319
BA9F Find the Shortest Non-Shared Substring of Two Strings 269
BA9G Construct the Suffix Array of a String 414
BA9H Pattern Matching with the Suffix Array 338
BA9I Construct the Burrows-Wheeler Transform of a String 493
BA9J Reconstruct a String from its Burrows-Wheeler Transform 419
BA9K Generate the Last-to-First Mapping of a String 328
BA9L Implement BWMatching 312
BA9M Implement BetterBWMatching 266
BA9N Find All Occurrences of a Collection of Patterns in a String 269
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 252
BA9P Implement TreeColoring 138
BA9Q Construct the Partial Suffix Array of a String 206
BA9R Construct a Suffix Tree from a Suffix Array 151