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: mmarroufin vs. “Conditions and Loops”, 5 minutes ago
Problems: 284 (total), users: 132528
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1043
BA10B Compute the Probability of an Outcome Given a Hidden Path 848
BA10C Implement the Viterbi Algorithm 786
BA10D Compute the Probability of a String Emitted by an HMM 452
BA10E Construct a Profile HMM 242
BA10F Construct a Profile HMM with Pseudocounts 235
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 138
BA10H Estimate the Parameters of an HMM 209
BA10I Implement Viterbi Learning 167
BA10J Solve the Soft Decoding Problem 195
BA10K Implement Baum-Welch Learning 174
BA11A Construct the Graph of a Spectrum 216
BA11B Implement DecodingIdealSpectrum 165
BA11C Convert a Peptide into a Peptide Vector 231
BA11D Convert a Peptide Vector into a Peptide 218
BA11E Sequence a Peptide 141
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 138
BA11G Implement PSMSearch 126
BA11H Compute the Size of a Spectral Dictionary 118
BA11I Compute the Probability of a Spectral Dictionary 119
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 85
BA1A Compute the Number of Times a Pattern Appears in a Text 3583
BA1B Find the Most Frequent Words in a String 3686
BA1C Find the Reverse Complement of a String 3451
BA1D Find All Occurrences of a Pattern in a String 3305
BA1E Find Patterns Forming Clumps in a String 2962
BA1F Find a Position in a Genome Minimizing the Skew 2879
BA1G Compute the Hamming Distance Between Two Strings 3025
BA1H Find All Approximate Occurrences of a Pattern in a String 2361
BA1I Find the Most Frequent Words with Mismatches in a String 1893
BA1J Find Frequent Words with Mismatches and Reverse Complements 1738
BA1K Generate the Frequency Array of a String 1522
BA1L Implement PatternToNumber 1760
BA1M Implement NumberToPattern 1693
BA1N Generate the d-Neighborhood of a String 1582
BA2A Implement MotifEnumeration 1634
BA2B Find a Median String 1719
BA2C Find a Profile-most Probable k-mer in a String 1543
BA2D Implement GreedyMotifSearch 1348
BA2E Implement GreedyMotifSearch with Pseudocounts 1246
BA2F Implement RandomizedMotifSearch 1342
BA2G Implement GibbsSampler 998
BA2H Implement DistanceBetweenPatternAndStrings 1288
BA3A Generate the k-mer Composition of a String 1800
BA3B Reconstruct a String from its Genome Path 1619
BA3C Construct the Overlap Graph of a Collection of k-mers 1601
BA3D Construct the De Bruijn Graph of a String 1521
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1467
BA3F Find an Eulerian Cycle in a Graph 1232
BA3G Find an Eulerian Path in a Graph 1207
BA3H Reconstruct a String from its k-mer Composition 1225
BA3I Find a k-Universal Circular String 846
BA3J Reconstruct a String from its Paired Composition 875
BA3K Generate Contigs from a Collection of Reads 686
BA3L Construct a String Spelled by a Gapped Genome Path 671
BA3M Generate All Maximal Non-Branching Paths in a Graph 525
BA4A Translate an RNA String into an Amino Acid String 1133
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1086
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 926
BA4D Compute the Number of Peptides of Given Total Mass 785
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 781
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 642
BA4G Implement LeaderboardCyclopeptideSequencing 628
BA4H Generate the Convolution of a Spectrum 616
BA4I Implement ConvolutionCyclopeptideSequencing 443
BA4J Generate the Theoretical Spectrum of a Linear Peptide 585
BA4K Compute the Score of a Linear Peptide 525
BA4L Trim a Peptide Leaderboard 488
BA4M Solve the Turnpike Problem 303
BA5A Find the Minimum Number of Coins Needed to Make Change 1265
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1129
BA5C Find a Longest Common Subsequence of Two Strings 1213
BA5D Find the Longest Path in a DAG 852
BA5E Find a Highest-Scoring Alignment of Two Strings 1154
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1009
BA5G Compute the Edit Distance Between Two Strings 1013
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 750
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 617
BA5J Align Two Strings Using Affine Gap Penalties 977
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 506
BA5L Align Two Strings Using Linear Space 438
BA5M Find a Highest-Scoring Multiple Sequence Alignment 506
BA5N Find a Topological Ordering of a DAG 497
BA6A Implement GreedySorting to Sort a Permutation by Reversals 599
BA6B Compute the Number of Breakpoints in a Permutation 639
BA6C Compute the 2-Break Distance Between a Pair of Genomes 441
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 275
BA6E Find All Shared k-mers of a Pair of Strings 349
BA6F Implement ChromosomeToCycle 323
BA6G Implement CycleToChromosome 317
BA6H Implement ColoredEdges 289
BA6I Implement GraphToGenome 254
BA6J Implement 2-BreakOnGenomeGraph 249
BA6K Implement 2-BreakOnGenome 216
BA7A Compute Distances Between Leaves 375
BA7B Compute Limb Lengths in a Tree 389
BA7C Implement AdditivePhylogeny 397
BA7D Implement UPGMA 317
BA7E Implement the Neighbor Joining Algorithm 288
BA7F Implement SmallParsimony 176
BA7G Adapt SmallParsimony to Unrooted Trees 132
BA8A Implement FarthestFirstTraversal 262
BA8B Compute the Squared Error Distortion 260
BA8C Implement the Lloyd Algorithm for k-Means Clustering 301
BA8D Implement the Soft k-Means Clustering Algorithm 222
BA8E Implement Hierarchical Clustering 225
BA9A Construct a Trie from a Collection of Patterns 520
BA9B Implement TrieMatching 523
BA9C Construct the Suffix Tree of a String 380
BA9D Find the Longest Repeat in a String 454
BA9E Find the Longest Substring Shared by Two Strings 329
BA9F Find the Shortest Non-Shared Substring of Two Strings 281
BA9G Construct the Suffix Array of a String 427
BA9H Pattern Matching with the Suffix Array 411
BA9I Construct the Burrows-Wheeler Transform of a String 569
BA9J Reconstruct a String from its Burrows-Wheeler Transform 489
BA9K Generate the Last-to-First Mapping of a String 339
BA9L Implement BWMatching 322
BA9M Implement BetterBWMatching 300
BA9N Find All Occurrences of a Collection of Patterns in a String 304
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 258
BA9P Implement TreeColoring 144
BA9Q Construct the Partial Suffix Array of a String 212
BA9R Construct a Suffix Tree from a Suffix Array 157