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: chris1805 vs. “Transcribing DNA into RNA”, 6 minutes ago
Problems: 284 (total), users: 125791
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 982
BA10B Compute the Probability of an Outcome Given a Hidden Path 808
BA10C Implement the Viterbi Algorithm 751
BA10D Compute the Probability of a String Emitted by an HMM 420
BA10E Construct a Profile HMM 230
BA10F Construct a Profile HMM with Pseudocounts 220
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 126
BA10H Estimate the Parameters of an HMM 196
BA10I Implement Viterbi Learning 157
BA10J Solve the Soft Decoding Problem 181
BA10K Implement Baum-Welch Learning 166
BA11A Construct the Graph of a Spectrum 202
BA11B Implement DecodingIdealSpectrum 151
BA11C Convert a Peptide into a Peptide Vector 217
BA11D Convert a Peptide Vector into a Peptide 204
BA11E Sequence a Peptide 126
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 125
BA11G Implement PSMSearch 114
BA11H Compute the Size of a Spectral Dictionary 107
BA11I Compute the Probability of a Spectral Dictionary 107
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 75
BA1A Compute the Number of Times a Pattern Appears in a Text 3403
BA1B Find the Most Frequent Words in a String 3476
BA1C Find the Reverse Complement of a String 3283
BA1D Find All Occurrences of a Pattern in a String 3138
BA1E Find Patterns Forming Clumps in a String 2759
BA1F Find a Position in a Genome Minimizing the Skew 2717
BA1G Compute the Hamming Distance Between Two Strings 2826
BA1H Find All Approximate Occurrences of a Pattern in a String 2195
BA1I Find the Most Frequent Words with Mismatches in a String 1758
BA1J Find Frequent Words with Mismatches and Reverse Complements 1607
BA1K Generate the Frequency Array of a String 1403
BA1L Implement PatternToNumber 1643
BA1M Implement NumberToPattern 1581
BA1N Generate the d-Neighborhood of a String 1475
BA2A Implement MotifEnumeration 1470
BA2B Find a Median String 1540
BA2C Find a Profile-most Probable k-mer in a String 1379
BA2D Implement GreedyMotifSearch 1246
BA2E Implement GreedyMotifSearch with Pseudocounts 1128
BA2F Implement RandomizedMotifSearch 1223
BA2G Implement GibbsSampler 883
BA2H Implement DistanceBetweenPatternAndStrings 1189
BA3A Generate the k-mer Composition of a String 1649
BA3B Reconstruct a String from its Genome Path 1505
BA3C Construct the Overlap Graph of a Collection of k-mers 1479
BA3D Construct the De Bruijn Graph of a String 1374
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1313
BA3F Find an Eulerian Cycle in a Graph 1081
BA3G Find an Eulerian Path in a Graph 1065
BA3H Reconstruct a String from its k-mer Composition 1046
BA3I Find a k-Universal Circular String 749
BA3J Reconstruct a String from its Paired Composition 778
BA3K Generate Contigs from a Collection of Reads 582
BA3L Construct a String Spelled by a Gapped Genome Path 575
BA3M Generate All Maximal Non-Branching Paths in a Graph 436
BA4A Translate an RNA String into an Amino Acid String 1053
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1002
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 852
BA4D Compute the Number of Peptides of Given Total Mass 715
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 703
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 570
BA4G Implement LeaderboardCyclopeptideSequencing 553
BA4H Generate the Convolution of a Spectrum 542
BA4I Implement ConvolutionCyclopeptideSequencing 376
BA4J Generate the Theoretical Spectrum of a Linear Peptide 521
BA4K Compute the Score of a Linear Peptide 462
BA4L Trim a Peptide Leaderboard 422
BA4M Solve the Turnpike Problem 245
BA5A Find the Minimum Number of Coins Needed to Make Change 1154
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1020
BA5C Find a Longest Common Subsequence of Two Strings 1108
BA5D Find the Longest Path in a DAG 753
BA5E Find a Highest-Scoring Alignment of Two Strings 1028
BA5F Find a Highest-Scoring Local Alignment of Two Strings 880
BA5G Compute the Edit Distance Between Two Strings 889
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 633
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 549
BA5J Align Two Strings Using Affine Gap Penalties 801
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 420
BA5L Align Two Strings Using Linear Space 362
BA5M Find a Highest-Scoring Multiple Sequence Alignment 421
BA5N Find a Topological Ordering of a DAG 412
BA6A Implement GreedySorting to Sort a Permutation by Reversals 576
BA6B Compute the Number of Breakpoints in a Permutation 613
BA6C Compute the 2-Break Distance Between a Pair of Genomes 418
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 259
BA6E Find All Shared k-mers of a Pair of Strings 333
BA6F Implement ChromosomeToCycle 307
BA6G Implement CycleToChromosome 301
BA6H Implement ColoredEdges 273
BA6I Implement GraphToGenome 238
BA6J Implement 2-BreakOnGenomeGraph 235
BA6K Implement 2-BreakOnGenome 202
BA7A Compute Distances Between Leaves 357
BA7B Compute Limb Lengths in a Tree 375
BA7C Implement AdditivePhylogeny 374
BA7D Implement UPGMA 257
BA7E Implement the Neighbor Joining Algorithm 231
BA7F Implement SmallParsimony 164
BA7G Adapt SmallParsimony to Unrooted Trees 119
BA8A Implement FarthestFirstTraversal 250
BA8B Compute the Squared Error Distortion 249
BA8C Implement the Lloyd Algorithm for k-Means Clustering 285
BA8D Implement the Soft k-Means Clustering Algorithm 205
BA8E Implement Hierarchical Clustering 207
BA9A Construct a Trie from a Collection of Patterns 468
BA9B Implement TrieMatching 447
BA9C Construct the Suffix Tree of a String 346
BA9D Find the Longest Repeat in a String 439
BA9E Find the Longest Substring Shared by Two Strings 321
BA9F Find the Shortest Non-Shared Substring of Two Strings 270
BA9G Construct the Suffix Array of a String 415
BA9H Pattern Matching with the Suffix Array 339
BA9I Construct the Burrows-Wheeler Transform of a String 495
BA9J Reconstruct a String from its Burrows-Wheeler Transform 422
BA9K Generate the Last-to-First Mapping of a String 330
BA9L Implement BWMatching 313
BA9M Implement BetterBWMatching 267
BA9N Find All Occurrences of a Collection of Patterns in a String 270
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 253
BA9P Implement TreeColoring 139
BA9Q Construct the Partial Suffix Array of a String 206
BA9R Construct a Suffix Tree from a Suffix Array 151