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: ekayserili vs. “Translating RNA into Protein”, 7 minutes ago
Problems: 284 (total), users: 129838
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1028
BA10B Compute the Probability of an Outcome Given a Hidden Path 836
BA10C Implement the Viterbi Algorithm 774
BA10D Compute the Probability of a String Emitted by an HMM 441
BA10E Construct a Profile HMM 239
BA10F Construct a Profile HMM with Pseudocounts 230
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 132
BA10H Estimate the Parameters of an HMM 204
BA10I Implement Viterbi Learning 163
BA10J Solve the Soft Decoding Problem 187
BA10K Implement Baum-Welch Learning 170
BA11A Construct the Graph of a Spectrum 210
BA11B Implement DecodingIdealSpectrum 159
BA11C Convert a Peptide into a Peptide Vector 225
BA11D Convert a Peptide Vector into a Peptide 212
BA11E Sequence a Peptide 135
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 133
BA11G Implement PSMSearch 120
BA11H Compute the Size of a Spectral Dictionary 113
BA11I Compute the Probability of a Spectral Dictionary 114
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 80
BA1A Compute the Number of Times a Pattern Appears in a Text 3547
BA1B Find the Most Frequent Words in a String 3622
BA1C Find the Reverse Complement of a String 3425
BA1D Find All Occurrences of a Pattern in a String 3286
BA1E Find Patterns Forming Clumps in a String 2913
BA1F Find a Position in a Genome Minimizing the Skew 2856
BA1G Compute the Hamming Distance Between Two Strings 2975
BA1H Find All Approximate Occurrences of a Pattern in a String 2342
BA1I Find the Most Frequent Words with Mismatches in a String 1874
BA1J Find Frequent Words with Mismatches and Reverse Complements 1719
BA1K Generate the Frequency Array of a String 1508
BA1L Implement PatternToNumber 1747
BA1M Implement NumberToPattern 1680
BA1N Generate the d-Neighborhood of a String 1570
BA2A Implement MotifEnumeration 1580
BA2B Find a Median String 1665
BA2C Find a Profile-most Probable k-mer in a String 1490
BA2D Implement GreedyMotifSearch 1332
BA2E Implement GreedyMotifSearch with Pseudocounts 1232
BA2F Implement RandomizedMotifSearch 1325
BA2G Implement GibbsSampler 979
BA2H Implement DistanceBetweenPatternAndStrings 1276
BA3A Generate the k-mer Composition of a String 1742
BA3B Reconstruct a String from its Genome Path 1590
BA3C Construct the Overlap Graph of a Collection of k-mers 1576
BA3D Construct the De Bruijn Graph of a String 1455
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1400
BA3F Find an Eulerian Cycle in a Graph 1166
BA3G Find an Eulerian Path in a Graph 1137
BA3H Reconstruct a String from its k-mer Composition 1116
BA3I Find a k-Universal Circular String 817
BA3J Reconstruct a String from its Paired Composition 847
BA3K Generate Contigs from a Collection of Reads 652
BA3L Construct a String Spelled by a Gapped Genome Path 642
BA3M Generate All Maximal Non-Branching Paths in a Graph 500
BA4A Translate an RNA String into an Amino Acid String 1117
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1064
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 911
BA4D Compute the Number of Peptides of Given Total Mass 774
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 765
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 629
BA4G Implement LeaderboardCyclopeptideSequencing 614
BA4H Generate the Convolution of a Spectrum 603
BA4I Implement ConvolutionCyclopeptideSequencing 432
BA4J Generate the Theoretical Spectrum of a Linear Peptide 578
BA4K Compute the Score of a Linear Peptide 519
BA4L Trim a Peptide Leaderboard 480
BA4M Solve the Turnpike Problem 297
BA5A Find the Minimum Number of Coins Needed to Make Change 1231
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1093
BA5C Find a Longest Common Subsequence of Two Strings 1179
BA5D Find the Longest Path in a DAG 822
BA5E Find a Highest-Scoring Alignment of Two Strings 1098
BA5F Find a Highest-Scoring Local Alignment of Two Strings 947
BA5G Compute the Edit Distance Between Two Strings 963
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 698
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 602
BA5J Align Two Strings Using Affine Gap Penalties 873
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 479
BA5L Align Two Strings Using Linear Space 416
BA5M Find a Highest-Scoring Multiple Sequence Alignment 480
BA5N Find a Topological Ordering of a DAG 472
BA6A Implement GreedySorting to Sort a Permutation by Reversals 594
BA6B Compute the Number of Breakpoints in a Permutation 630
BA6C Compute the 2-Break Distance Between a Pair of Genomes 434
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 272
BA6E Find All Shared k-mers of a Pair of Strings 346
BA6F Implement ChromosomeToCycle 320
BA6G Implement CycleToChromosome 314
BA6H Implement ColoredEdges 286
BA6I Implement GraphToGenome 251
BA6J Implement 2-BreakOnGenomeGraph 246
BA6K Implement 2-BreakOnGenome 213
BA7A Compute Distances Between Leaves 369
BA7B Compute Limb Lengths in a Tree 385
BA7C Implement AdditivePhylogeny 392
BA7D Implement UPGMA 272
BA7E Implement the Neighbor Joining Algorithm 245
BA7F Implement SmallParsimony 170
BA7G Adapt SmallParsimony to Unrooted Trees 127
BA8A Implement FarthestFirstTraversal 257
BA8B Compute the Squared Error Distortion 257
BA8C Implement the Lloyd Algorithm for k-Means Clustering 292
BA8D Implement the Soft k-Means Clustering Algorithm 214
BA8E Implement Hierarchical Clustering 215
BA9A Construct a Trie from a Collection of Patterns 481
BA9B Implement TrieMatching 467
BA9C Construct the Suffix Tree of a String 359
BA9D Find the Longest Repeat in a String 450
BA9E Find the Longest Substring Shared by Two Strings 326
BA9F Find the Shortest Non-Shared Substring of Two Strings 278
BA9G Construct the Suffix Array of a String 424
BA9H Pattern Matching with the Suffix Array 354
BA9I Construct the Burrows-Wheeler Transform of a String 514
BA9J Reconstruct a String from its Burrows-Wheeler Transform 437
BA9K Generate the Last-to-First Mapping of a String 335
BA9L Implement BWMatching 318
BA9M Implement BetterBWMatching 280
BA9N Find All Occurrences of a Collection of Patterns in a String 277
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