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: chull vs. “Transcribing DNA into RNA”, 3 minutes ago
Problems: 284 (total), users: 96310, attempts: 1593037, correct: 879587
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 709
BA10B Compute the Probability of an Outcome Given a Hidden Path 591
BA10C Implement the Viterbi Algorithm 437
BA10D Compute the Probability of a String Emitted by an HMM 303
BA10E Construct a Profile HMM 175
BA10F Construct a Profile HMM with Pseudocounts 168
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 94
BA10H Estimate the Parameters of an HMM 149
BA10I Implement Viterbi Learning 114
BA10J Solve the Soft Decoding Problem 130
BA10K Implement Baum-Welch Learning 122
BA11A Construct the Graph of a Spectrum 164
BA11B Implement DecodingIdealSpectrum 120
BA11C Convert a Peptide into a Peptide Vector 170
BA11D Convert a Peptide Vector into a Peptide 164
BA11E Sequence a Peptide 96
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 97
BA11G Implement PSMSearch 90
BA11H Compute the Size of a Spectral Dictionary 84
BA11I Compute the Probability of a Spectral Dictionary 83
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 62
BA1A Compute the Number of Times a Pattern Appears in a Text 2242
BA1B Find the Most Frequent Words in a String 2381
BA1C Find the Reverse Complement of a String 2282
BA1D Find All Occurrences of a Pattern in a String 2151
BA1E Find Patterns Forming Clumps in a String 1853
BA1F Find a Position in a Genome Minimizing the Skew 1822
BA1G Compute the Hamming Distance Between Two Strings 1897
BA1H Find All Approximate Occurrences of a Pattern in a String 1430
BA1I Find the Most Frequent Words with Mismatches in a String 1187
BA1J Find Frequent Words with Mismatches and Reverse Complements 1070
BA1K Generate the Frequency Array of a String 951
BA1L Implement PatternToNumber 1145
BA1M Implement NumberToPattern 1095
BA1N Generate the d-Neighborhood of a String 981
BA2A Implement MotifEnumeration 989
BA2B Find a Median String 958
BA2C Find a Profile-most Probable k-mer in a String 878
BA2D Implement GreedyMotifSearch 820
BA2E Implement GreedyMotifSearch with Pseudocounts 721
BA2F Implement RandomizedMotifSearch 647
BA2G Implement GibbsSampler 520
BA2H Implement DistanceBetweenPatternAndStrings 766
BA3A Generate the k-mer Composition of a String 1070
BA3B Reconstruct a String from its Genome Path 998
BA3C Construct the Overlap Graph of a Collection of k-mers 933
BA3D Construct the De Bruijn Graph of a String 918
BA3E Construct the De Bruijn Graph of a Collection of k-mers 817
BA3F Find an Eulerian Cycle in a Graph 636
BA3G Find an Eulerian Path in a Graph 573
BA3H Reconstruct a String from its k-mer Composition 693
BA3I Find a k-Universal Circular String 471
BA3J Reconstruct a String from its Paired Composition 452
BA3K Generate Contigs from a Collection of Reads 374
BA3L Construct a String Spelled by a Gapped Genome Path 349
BA3M Generate All Maximal Non-Branching Paths in a Graph 274
BA4A Translate an RNA String into an Amino Acid String 715
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 624
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 562
BA4D Compute the Number of Peptides of Given Total Mass 411
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 441
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 348
BA4G Implement LeaderboardCyclopeptideSequencing 340
BA4H Generate the Convolution of a Spectrum 335
BA4I Implement ConvolutionCyclopeptideSequencing 229
BA4J Generate the Theoretical Spectrum of a Linear Peptide 335
BA4K Compute the Score of a Linear Peptide 277
BA4L Trim a Peptide Leaderboard 251
BA4M Solve the Turnpike Problem 150
BA5A Find the Minimum Number of Coins Needed to Make Change 771
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 626
BA5C Find a Longest Common Subsequence of Two Strings 750
BA5D Find the Longest Path in a DAG 468
BA5E Find a Highest-Scoring Alignment of Two Strings 711
BA5F Find a Highest-Scoring Local Alignment of Two Strings 573
BA5G Compute the Edit Distance Between Two Strings 611
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 398
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 357
BA5J Align Two Strings Using Affine Gap Penalties 470
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 265
BA5L Align Two Strings Using Linear Space 229
BA5M Find a Highest-Scoring Multiple Sequence Alignment 269
BA5N Find a Topological Ordering of a DAG 224
BA6A Implement GreedySorting to Sort a Permutation by Reversals 408
BA6B Compute the Number of Breakpoints in a Permutation 462
BA6C Compute the 2-Break Distance Between a Pair of Genomes 300
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 154
BA6E Find All Shared k-mers of a Pair of Strings 258
BA6F Implement ChromosomeToCycle 196
BA6G Implement CycleToChromosome 191
BA6H Implement ColoredEdges 177
BA6I Implement GraphToGenome 147
BA6J Implement 2-BreakOnGenomeGraph 154
BA6K Implement 2-BreakOnGenome 133
BA7A Compute Distances Between Leaves 243
BA7B Compute Limb Lengths in a Tree 277
BA7C Implement AdditivePhylogeny 242
BA7D Implement UPGMA 195
BA7E Implement the Neighbor Joining Algorithm 184
BA7F Implement SmallParsimony 129
BA7G Adapt SmallParsimony to Unrooted Trees 94
BA8A Implement FarthestFirstTraversal 178
BA8B Compute the Squared Error Distortion 179
BA8C Implement the Lloyd Algorithm for k-Means Clustering 204
BA8D Implement the Soft k-Means Clustering Algorithm 141
BA8E Implement Hierarchical Clustering 147
BA9A Construct a Trie from a Collection of Patterns 346
BA9B Implement TrieMatching 351
BA9C Construct the Suffix Tree of a String 260
BA9D Find the Longest Repeat in a String 321
BA9E Find the Longest Substring Shared by Two Strings 259
BA9F Find the Shortest Non-Shared Substring of Two Strings 213
BA9G Construct the Suffix Array of a String 321
BA9H Pattern Matching with the Suffix Array 231
BA9I Construct the Burrows-Wheeler Transform of a String 363
BA9J Reconstruct a String from its Burrows-Wheeler Transform 310
BA9K Generate the Last-to-First Mapping of a String 250
BA9L Implement BWMatching 230
BA9M Implement BetterBWMatching 202
BA9N Find All Occurrences of a Collection of Patterns in a String 209
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 191
BA9P Implement TreeColoring 95
BA9Q Construct the Partial Suffix Array of a String 167
BA9R Construct a Suffix Tree from a Suffix Array 124