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: Abedboat vs. “Finding a Shared Motif”, 1 hour, 42 minutes ago
Problems: 284 (total), users: 138543
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1080
BA10B Compute the Probability of an Outcome Given a Hidden Path 874
BA10C Implement the Viterbi Algorithm 800
BA10D Compute the Probability of a String Emitted by an HMM 467
BA10E Construct a Profile HMM 257
BA10F Construct a Profile HMM with Pseudocounts 247
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 147
BA10H Estimate the Parameters of an HMM 217
BA10I Implement Viterbi Learning 174
BA10J Solve the Soft Decoding Problem 201
BA10K Implement Baum-Welch Learning 178
BA11A Construct the Graph of a Spectrum 222
BA11B Implement DecodingIdealSpectrum 171
BA11C Convert a Peptide into a Peptide Vector 237
BA11D Convert a Peptide Vector into a Peptide 226
BA11E Sequence a Peptide 147
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 145
BA11G Implement PSMSearch 132
BA11H Compute the Size of a Spectral Dictionary 124
BA11I Compute the Probability of a Spectral Dictionary 124
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 91
BA1A Compute the Number of Times a Pattern Appears in a Text 3708
BA1B Find the Most Frequent Words in a String 3817
BA1C Find the Reverse Complement of a String 3542
BA1D Find All Occurrences of a Pattern in a String 3401
BA1E Find Patterns Forming Clumps in a String 3052
BA1F Find a Position in a Genome Minimizing the Skew 2934
BA1G Compute the Hamming Distance Between Two Strings 3096
BA1H Find All Approximate Occurrences of a Pattern in a String 2424
BA1I Find the Most Frequent Words with Mismatches in a String 1959
BA1J Find Frequent Words with Mismatches and Reverse Complements 1796
BA1K Generate the Frequency Array of a String 1568
BA1L Implement PatternToNumber 1805
BA1M Implement NumberToPattern 1738
BA1N Generate the d-Neighborhood of a String 1620
BA2A Implement MotifEnumeration 1670
BA2B Find a Median String 1773
BA2C Find a Profile-most Probable k-mer in a String 1620
BA2D Implement GreedyMotifSearch 1387
BA2E Implement GreedyMotifSearch with Pseudocounts 1272
BA2F Implement RandomizedMotifSearch 1363
BA2G Implement GibbsSampler 1036
BA2H Implement DistanceBetweenPatternAndStrings 1298
BA3A Generate the k-mer Composition of a String 1881
BA3B Reconstruct a String from its Genome Path 1661
BA3C Construct the Overlap Graph of a Collection of k-mers 1628
BA3D Construct the De Bruijn Graph of a String 1549
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1485
BA3F Find an Eulerian Cycle in a Graph 1245
BA3G Find an Eulerian Path in a Graph 1219
BA3H Reconstruct a String from its k-mer Composition 1242
BA3I Find a k-Universal Circular String 855
BA3J Reconstruct a String from its Paired Composition 887
BA3K Generate Contigs from a Collection of Reads 694
BA3L Construct a String Spelled by a Gapped Genome Path 680
BA3M Generate All Maximal Non-Branching Paths in a Graph 533
BA4A Translate an RNA String into an Amino Acid String 1156
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1105
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 940
BA4D Compute the Number of Peptides of Given Total Mass 795
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 789
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 661
BA4G Implement LeaderboardCyclopeptideSequencing 645
BA4H Generate the Convolution of a Spectrum 625
BA4I Implement ConvolutionCyclopeptideSequencing 460
BA4J Generate the Theoretical Spectrum of a Linear Peptide 595
BA4K Compute the Score of a Linear Peptide 534
BA4L Trim a Peptide Leaderboard 496
BA4M Solve the Turnpike Problem 311
BA5A Find the Minimum Number of Coins Needed to Make Change 1280
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1140
BA5C Find a Longest Common Subsequence of Two Strings 1225
BA5D Find the Longest Path in a DAG 870
BA5E Find a Highest-Scoring Alignment of Two Strings 1176
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1024
BA5G Compute the Edit Distance Between Two Strings 1033
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 764
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 628
BA5J Align Two Strings Using Affine Gap Penalties 988
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 518
BA5L Align Two Strings Using Linear Space 449
BA5M Find a Highest-Scoring Multiple Sequence Alignment 518
BA5N Find a Topological Ordering of a DAG 509
BA6A Implement GreedySorting to Sort a Permutation by Reversals 610
BA6B Compute the Number of Breakpoints in a Permutation 649
BA6C Compute the 2-Break Distance Between a Pair of Genomes 453
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 285
BA6E Find All Shared k-mers of a Pair of Strings 363
BA6F Implement ChromosomeToCycle 334
BA6G Implement CycleToChromosome 327
BA6H Implement ColoredEdges 300
BA6I Implement GraphToGenome 265
BA6J Implement 2-BreakOnGenomeGraph 260
BA6K Implement 2-BreakOnGenome 227
BA7A Compute Distances Between Leaves 394
BA7B Compute Limb Lengths in a Tree 400
BA7C Implement AdditivePhylogeny 417
BA7D Implement UPGMA 335
BA7E Implement the Neighbor Joining Algorithm 297
BA7F Implement SmallParsimony 183
BA7G Adapt SmallParsimony to Unrooted Trees 140
BA8A Implement FarthestFirstTraversal 271
BA8B Compute the Squared Error Distortion 270
BA8C Implement the Lloyd Algorithm for k-Means Clustering 310
BA8D Implement the Soft k-Means Clustering Algorithm 230
BA8E Implement Hierarchical Clustering 233
BA9A Construct a Trie from a Collection of Patterns 533
BA9B Implement TrieMatching 535
BA9C Construct the Suffix Tree of a String 388
BA9D Find the Longest Repeat in a String 462
BA9E Find the Longest Substring Shared by Two Strings 338
BA9F Find the Shortest Non-Shared Substring of Two Strings 289
BA9G Construct the Suffix Array of a String 435
BA9H Pattern Matching with the Suffix Array 421
BA9I Construct the Burrows-Wheeler Transform of a String 577
BA9J Reconstruct a String from its Burrows-Wheeler Transform 527
BA9K Generate the Last-to-First Mapping of a String 348
BA9L Implement BWMatching 328
BA9M Implement BetterBWMatching 335
BA9N Find All Occurrences of a Collection of Patterns in a String 309
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 263
BA9P Implement TreeColoring 148
BA9Q Construct the Partial Suffix Array of a String 218
BA9R Construct a Suffix Tree from a Suffix Array 161