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: dlalswo0321 vs. “Find Substrings of a Genome Encoding a Given Amino Acid String”, 20 minutes ago
Problems: 284 (total), users: 127005
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1002
BA10B Compute the Probability of an Outcome Given a Hidden Path 820
BA10C Implement the Viterbi Algorithm 764
BA10D Compute the Probability of a String Emitted by an HMM 433
BA10E Construct a Profile HMM 235
BA10F Construct a Profile HMM with Pseudocounts 226
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 130
BA10H Estimate the Parameters of an HMM 199
BA10I Implement Viterbi Learning 160
BA10J Solve the Soft Decoding Problem 183
BA10K Implement Baum-Welch Learning 168
BA11A Construct the Graph of a Spectrum 206
BA11B Implement DecodingIdealSpectrum 155
BA11C Convert a Peptide into a Peptide Vector 221
BA11D Convert a Peptide Vector into a Peptide 208
BA11E Sequence a Peptide 132
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 130
BA11G Implement PSMSearch 118
BA11H Compute the Size of a Spectral Dictionary 110
BA11I Compute the Probability of a Spectral Dictionary 111
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 78
BA1A Compute the Number of Times a Pattern Appears in a Text 3474
BA1B Find the Most Frequent Words in a String 3547
BA1C Find the Reverse Complement of a String 3356
BA1D Find All Occurrences of a Pattern in a String 3216
BA1E Find Patterns Forming Clumps in a String 2842
BA1F Find a Position in a Genome Minimizing the Skew 2790
BA1G Compute the Hamming Distance Between Two Strings 2901
BA1H Find All Approximate Occurrences of a Pattern in a String 2276
BA1I Find the Most Frequent Words with Mismatches in a String 1824
BA1J Find Frequent Words with Mismatches and Reverse Complements 1668
BA1K Generate the Frequency Array of a String 1464
BA1L Implement PatternToNumber 1702
BA1M Implement NumberToPattern 1640
BA1N Generate the d-Neighborhood of a String 1531
BA2A Implement MotifEnumeration 1527
BA2B Find a Median String 1603
BA2C Find a Profile-most Probable k-mer in a String 1443
BA2D Implement GreedyMotifSearch 1300
BA2E Implement GreedyMotifSearch with Pseudocounts 1187
BA2F Implement RandomizedMotifSearch 1283
BA2G Implement GibbsSampler 941
BA2H Implement DistanceBetweenPatternAndStrings 1246
BA3A Generate the k-mer Composition of a String 1713
BA3B Reconstruct a String from its Genome Path 1569
BA3C Construct the Overlap Graph of a Collection of k-mers 1541
BA3D Construct the De Bruijn Graph of a String 1433
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1375
BA3F Find an Eulerian Cycle in a Graph 1140
BA3G Find an Eulerian Path in a Graph 1121
BA3H Reconstruct a String from its k-mer Composition 1100
BA3I Find a k-Universal Circular String 802
BA3J Reconstruct a String from its Paired Composition 833
BA3K Generate Contigs from a Collection of Reads 637
BA3L Construct a String Spelled by a Gapped Genome Path 629
BA3M Generate All Maximal Non-Branching Paths in a Graph 483
BA4A Translate an RNA String into an Amino Acid String 1086
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1029
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 875
BA4D Compute the Number of Peptides of Given Total Mass 737
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 728
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 592
BA4G Implement LeaderboardCyclopeptideSequencing 575
BA4H Generate the Convolution of a Spectrum 564
BA4I Implement ConvolutionCyclopeptideSequencing 393
BA4J Generate the Theoretical Spectrum of a Linear Peptide 542
BA4K Compute the Score of a Linear Peptide 482
BA4L Trim a Peptide Leaderboard 442
BA4M Solve the Turnpike Problem 262
BA5A Find the Minimum Number of Coins Needed to Make Change 1183
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1044
BA5C Find a Longest Common Subsequence of Two Strings 1133
BA5D Find the Longest Path in a DAG 776
BA5E Find a Highest-Scoring Alignment of Two Strings 1045
BA5F Find a Highest-Scoring Local Alignment of Two Strings 897
BA5G Compute the Edit Distance Between Two Strings 903
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 645
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 561
BA5J Align Two Strings Using Affine Gap Penalties 818
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 432
BA5L Align Two Strings Using Linear Space 375
BA5M Find a Highest-Scoring Multiple Sequence Alignment 435
BA5N Find a Topological Ordering of a DAG 429
BA6A Implement GreedySorting to Sort a Permutation by Reversals 583
BA6B Compute the Number of Breakpoints in a Permutation 620
BA6C Compute the 2-Break Distance Between a Pair of Genomes 424
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 262
BA6E Find All Shared k-mers of a Pair of Strings 340
BA6F Implement ChromosomeToCycle 313
BA6G Implement CycleToChromosome 306
BA6H Implement ColoredEdges 279
BA6I Implement GraphToGenome 243
BA6J Implement 2-BreakOnGenomeGraph 241
BA6K Implement 2-BreakOnGenome 206
BA7A Compute Distances Between Leaves 363
BA7B Compute Limb Lengths in a Tree 381
BA7C Implement AdditivePhylogeny 387
BA7D Implement UPGMA 267
BA7E Implement the Neighbor Joining Algorithm 239
BA7F Implement SmallParsimony 167
BA7G Adapt SmallParsimony to Unrooted Trees 124
BA8A Implement FarthestFirstTraversal 254
BA8B Compute the Squared Error Distortion 254
BA8C Implement the Lloyd Algorithm for k-Means Clustering 289
BA8D Implement the Soft k-Means Clustering Algorithm 209
BA8E Implement Hierarchical Clustering 211
BA9A Construct a Trie from a Collection of Patterns 470
BA9B Implement TrieMatching 452
BA9C Construct the Suffix Tree of a String 348
BA9D Find the Longest Repeat in a String 442
BA9E Find the Longest Substring Shared by Two Strings 323
BA9F Find the Shortest Non-Shared Substring of Two Strings 274
BA9G Construct the Suffix Array of a String 419
BA9H Pattern Matching with the Suffix Array 342
BA9I Construct the Burrows-Wheeler Transform of a String 499
BA9J Reconstruct a String from its Burrows-Wheeler Transform 427
BA9K Generate the Last-to-First Mapping of a String 332
BA9L Implement BWMatching 315
BA9M Implement BetterBWMatching 272
BA9N Find All Occurrences of a Collection of Patterns in a String 272
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