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: robert.torgusen3 vs. “Counting DNA Nucleotides”, 14 minutes ago
Problems: 284 (total), users: 136723
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1068
BA10B Compute the Probability of an Outcome Given a Hidden Path 864
BA10C Implement the Viterbi Algorithm 796
BA10D Compute the Probability of a String Emitted by an HMM 464
BA10E Construct a Profile HMM 253
BA10F Construct a Profile HMM with Pseudocounts 244
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 144
BA10H Estimate the Parameters of an HMM 215
BA10I Implement Viterbi Learning 173
BA10J Solve the Soft Decoding Problem 200
BA10K Implement Baum-Welch Learning 177
BA11A Construct the Graph of a Spectrum 221
BA11B Implement DecodingIdealSpectrum 170
BA11C Convert a Peptide into a Peptide Vector 236
BA11D Convert a Peptide Vector into a Peptide 224
BA11E Sequence a Peptide 146
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 144
BA11G Implement PSMSearch 131
BA11H Compute the Size of a Spectral Dictionary 123
BA11I Compute the Probability of a Spectral Dictionary 123
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 89
BA1A Compute the Number of Times a Pattern Appears in a Text 3684
BA1B Find the Most Frequent Words in a String 3785
BA1C Find the Reverse Complement of a String 3499
BA1D Find All Occurrences of a Pattern in a String 3354
BA1E Find Patterns Forming Clumps in a String 3010
BA1F Find a Position in a Genome Minimizing the Skew 2918
BA1G Compute the Hamming Distance Between Two Strings 3056
BA1H Find All Approximate Occurrences of a Pattern in a String 2393
BA1I Find the Most Frequent Words with Mismatches in a String 1925
BA1J Find Frequent Words with Mismatches and Reverse Complements 1766
BA1K Generate the Frequency Array of a String 1544
BA1L Implement PatternToNumber 1777
BA1M Implement NumberToPattern 1711
BA1N Generate the d-Neighborhood of a String 1605
BA2A Implement MotifEnumeration 1653
BA2B Find a Median String 1749
BA2C Find a Profile-most Probable k-mer in a String 1567
BA2D Implement GreedyMotifSearch 1367
BA2E Implement GreedyMotifSearch with Pseudocounts 1265
BA2F Implement RandomizedMotifSearch 1359
BA2G Implement GibbsSampler 1025
BA2H Implement DistanceBetweenPatternAndStrings 1296
BA3A Generate the k-mer Composition of a String 1825
BA3B Reconstruct a String from its Genome Path 1642
BA3C Construct the Overlap Graph of a Collection of k-mers 1614
BA3D Construct the De Bruijn Graph of a String 1540
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1481
BA3F Find an Eulerian Cycle in a Graph 1243
BA3G Find an Eulerian Path in a Graph 1217
BA3H Reconstruct a String from its k-mer Composition 1236
BA3I Find a k-Universal Circular String 854
BA3J Reconstruct a String from its Paired Composition 885
BA3K Generate Contigs from a Collection of Reads 693
BA3L Construct a String Spelled by a Gapped Genome Path 679
BA3M Generate All Maximal Non-Branching Paths in a Graph 532
BA4A Translate an RNA String into an Amino Acid String 1155
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1094
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 938
BA4D Compute the Number of Peptides of Given Total Mass 793
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 787
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 650
BA4G Implement LeaderboardCyclopeptideSequencing 634
BA4H Generate the Convolution of a Spectrum 624
BA4I Implement ConvolutionCyclopeptideSequencing 449
BA4J Generate the Theoretical Spectrum of a Linear Peptide 593
BA4K Compute the Score of a Linear Peptide 532
BA4L Trim a Peptide Leaderboard 495
BA4M Solve the Turnpike Problem 310
BA5A Find the Minimum Number of Coins Needed to Make Change 1277
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1138
BA5C Find a Longest Common Subsequence of Two Strings 1222
BA5D Find the Longest Path in a DAG 868
BA5E Find a Highest-Scoring Alignment of Two Strings 1172
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1021
BA5G Compute the Edit Distance Between Two Strings 1031
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 761
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 626
BA5J Align Two Strings Using Affine Gap Penalties 987
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 516
BA5L Align Two Strings Using Linear Space 446
BA5M Find a Highest-Scoring Multiple Sequence Alignment 516
BA5N Find a Topological Ordering of a DAG 506
BA6A Implement GreedySorting to Sort a Permutation by Reversals 609
BA6B Compute the Number of Breakpoints in a Permutation 648
BA6C Compute the 2-Break Distance Between a Pair of Genomes 451
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 284
BA6E Find All Shared k-mers of a Pair of Strings 360
BA6F Implement ChromosomeToCycle 333
BA6G Implement CycleToChromosome 326
BA6H Implement ColoredEdges 298
BA6I Implement GraphToGenome 263
BA6J Implement 2-BreakOnGenomeGraph 259
BA6K Implement 2-BreakOnGenome 226
BA7A Compute Distances Between Leaves 391
BA7B Compute Limb Lengths in a Tree 397
BA7C Implement AdditivePhylogeny 413
BA7D Implement UPGMA 333
BA7E Implement the Neighbor Joining Algorithm 296
BA7F Implement SmallParsimony 182
BA7G Adapt SmallParsimony to Unrooted Trees 139
BA8A Implement FarthestFirstTraversal 269
BA8B Compute the Squared Error Distortion 268
BA8C Implement the Lloyd Algorithm for k-Means Clustering 308
BA8D Implement the Soft k-Means Clustering Algorithm 229
BA8E Implement Hierarchical Clustering 232
BA9A Construct a Trie from a Collection of Patterns 530
BA9B Implement TrieMatching 533
BA9C Construct the Suffix Tree of a String 387
BA9D Find the Longest Repeat in a String 461
BA9E Find the Longest Substring Shared by Two Strings 336
BA9F Find the Shortest Non-Shared Substring of Two Strings 288
BA9G Construct the Suffix Array of a String 434
BA9H Pattern Matching with the Suffix Array 420
BA9I Construct the Burrows-Wheeler Transform of a String 576
BA9J Reconstruct a String from its Burrows-Wheeler Transform 526
BA9K Generate the Last-to-First Mapping of a String 347
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