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: ak1gd vs. “Translating RNA into Protein”, 4 minutes ago
Problems: 284 (total), users: 127385
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1006
BA10B Compute the Probability of an Outcome Given a Hidden Path 822
BA10C Implement the Viterbi Algorithm 765
BA10D Compute the Probability of a String Emitted by an HMM 434
BA10E Construct a Profile HMM 235
BA10F Construct a Profile HMM with Pseudocounts 226
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 130
BA10H Estimate the Parameters of an HMM 201
BA10I Implement Viterbi Learning 161
BA10J Solve the Soft Decoding Problem 184
BA10K Implement Baum-Welch Learning 168
BA11A Construct the Graph of a Spectrum 208
BA11B Implement DecodingIdealSpectrum 156
BA11C Convert a Peptide into a Peptide Vector 223
BA11D Convert a Peptide Vector into a Peptide 210
BA11E Sequence a Peptide 133
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 131
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 3497
BA1B Find the Most Frequent Words in a String 3566
BA1C Find the Reverse Complement of a String 3377
BA1D Find All Occurrences of a Pattern in a String 3236
BA1E Find Patterns Forming Clumps in a String 2860
BA1F Find a Position in a Genome Minimizing the Skew 2810
BA1G Compute the Hamming Distance Between Two Strings 2921
BA1H Find All Approximate Occurrences of a Pattern in a String 2296
BA1I Find the Most Frequent Words with Mismatches in a String 1837
BA1J Find Frequent Words with Mismatches and Reverse Complements 1681
BA1K Generate the Frequency Array of a String 1472
BA1L Implement PatternToNumber 1709
BA1M Implement NumberToPattern 1646
BA1N Generate the d-Neighborhood of a String 1538
BA2A Implement MotifEnumeration 1544
BA2B Find a Median String 1625
BA2C Find a Profile-most Probable k-mer in a String 1453
BA2D Implement GreedyMotifSearch 1309
BA2E Implement GreedyMotifSearch with Pseudocounts 1195
BA2F Implement RandomizedMotifSearch 1290
BA2G Implement GibbsSampler 947
BA2H Implement DistanceBetweenPatternAndStrings 1250
BA3A Generate the k-mer Composition of a String 1715
BA3B Reconstruct a String from its Genome Path 1571
BA3C Construct the Overlap Graph of a Collection of k-mers 1545
BA3D Construct the De Bruijn Graph of a String 1435
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1378
BA3F Find an Eulerian Cycle in a Graph 1145
BA3G Find an Eulerian Path in a Graph 1124
BA3H Reconstruct a String from its k-mer Composition 1102
BA3I Find a k-Universal Circular String 804
BA3J Reconstruct a String from its Paired Composition 834
BA3K Generate Contigs from a Collection of Reads 639
BA3L Construct a String Spelled by a Gapped Genome Path 632
BA3M Generate All Maximal Non-Branching Paths in a Graph 487
BA4A Translate an RNA String into an Amino Acid String 1093
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1038
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 885
BA4D Compute the Number of Peptides of Given Total Mass 749
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 738
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 605
BA4G Implement LeaderboardCyclopeptideSequencing 587
BA4H Generate the Convolution of a Spectrum 575
BA4I Implement ConvolutionCyclopeptideSequencing 406
BA4J Generate the Theoretical Spectrum of a Linear Peptide 552
BA4K Compute the Score of a Linear Peptide 493
BA4L Trim a Peptide Leaderboard 453
BA4M Solve the Turnpike Problem 269
BA5A Find the Minimum Number of Coins Needed to Make Change 1196
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1059
BA5C Find a Longest Common Subsequence of Two Strings 1147
BA5D Find the Longest Path in a DAG 789
BA5E Find a Highest-Scoring Alignment of Two Strings 1059
BA5F Find a Highest-Scoring Local Alignment of Two Strings 910
BA5G Compute the Edit Distance Between Two Strings 918
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 659
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 571
BA5J Align Two Strings Using Affine Gap Penalties 831
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 447
BA5L Align Two Strings Using Linear Space 386
BA5M Find a Highest-Scoring Multiple Sequence Alignment 450
BA5N Find a Topological Ordering of a DAG 438
BA6A Implement GreedySorting to Sort a Permutation by Reversals 586
BA6B Compute the Number of Breakpoints in a Permutation 623
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 310
BA6H Implement ColoredEdges 282
BA6I Implement GraphToGenome 245
BA6J Implement 2-BreakOnGenomeGraph 242
BA6K Implement 2-BreakOnGenome 208
BA7A Compute Distances Between Leaves 365
BA7B Compute Limb Lengths in a Tree 381
BA7C Implement AdditivePhylogeny 389
BA7D Implement UPGMA 268
BA7E Implement the Neighbor Joining Algorithm 241
BA7F Implement SmallParsimony 167
BA7G Adapt SmallParsimony to Unrooted Trees 124
BA8A Implement FarthestFirstTraversal 254
BA8B Compute the Squared Error Distortion 254
BA8C Implement the Lloyd Algorithm for k-Means Clustering 289
BA8D Implement the Soft k-Means Clustering Algorithm 209
BA8E Implement Hierarchical Clustering 211
BA9A Construct a Trie from a Collection of Patterns 472
BA9B Implement TrieMatching 460
BA9C Construct the Suffix Tree of a String 356
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 421
BA9H Pattern Matching with the Suffix Array 350
BA9I Construct the Burrows-Wheeler Transform of a String 506
BA9J Reconstruct a String from its Burrows-Wheeler Transform 433
BA9K Generate the Last-to-First Mapping of a String 333
BA9L Implement BWMatching 316
BA9M Implement BetterBWMatching 277
BA9N Find All Occurrences of a Collection of Patterns in a String 274
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