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: AKSHYARAM vs. “Transcribing DNA into RNA”, 18 minutes ago
Problems: 284 (total), users: 134441
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1055
BA10B Compute the Probability of an Outcome Given a Hidden Path 858
BA10C Implement the Viterbi Algorithm 791
BA10D Compute the Probability of a String Emitted by an HMM 457
BA10E Construct a Profile HMM 246
BA10F Construct a Profile HMM with Pseudocounts 239
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 142
BA10H Estimate the Parameters of an HMM 213
BA10I Implement Viterbi Learning 171
BA10J Solve the Soft Decoding Problem 199
BA10K Implement Baum-Welch Learning 176
BA11A Construct the Graph of a Spectrum 219
BA11B Implement DecodingIdealSpectrum 168
BA11C Convert a Peptide into a Peptide Vector 234
BA11D Convert a Peptide Vector into a Peptide 222
BA11E Sequence a Peptide 144
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 142
BA11G Implement PSMSearch 129
BA11H Compute the Size of a Spectral Dictionary 121
BA11I Compute the Probability of a Spectral Dictionary 121
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 88
BA1A Compute the Number of Times a Pattern Appears in a Text 3607
BA1B Find the Most Frequent Words in a String 3717
BA1C Find the Reverse Complement of a String 3477
BA1D Find All Occurrences of a Pattern in a String 3327
BA1E Find Patterns Forming Clumps in a String 2977
BA1F Find a Position in a Genome Minimizing the Skew 2892
BA1G Compute the Hamming Distance Between Two Strings 3041
BA1H Find All Approximate Occurrences of a Pattern in a String 2379
BA1I Find the Most Frequent Words with Mismatches in a String 1910
BA1J Find Frequent Words with Mismatches and Reverse Complements 1752
BA1K Generate the Frequency Array of a String 1534
BA1L Implement PatternToNumber 1769
BA1M Implement NumberToPattern 1702
BA1N Generate the d-Neighborhood of a String 1598
BA2A Implement MotifEnumeration 1641
BA2B Find a Median String 1734
BA2C Find a Profile-most Probable k-mer in a String 1553
BA2D Implement GreedyMotifSearch 1360
BA2E Implement GreedyMotifSearch with Pseudocounts 1259
BA2F Implement RandomizedMotifSearch 1353
BA2G Implement GibbsSampler 1010
BA2H Implement DistanceBetweenPatternAndStrings 1293
BA3A Generate the k-mer Composition of a String 1819
BA3B Reconstruct a String from its Genome Path 1629
BA3C Construct the Overlap Graph of a Collection of k-mers 1611
BA3D Construct the De Bruijn Graph of a String 1531
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1477
BA3F Find an Eulerian Cycle in a Graph 1239
BA3G Find an Eulerian Path in a Graph 1214
BA3H Reconstruct a String from its k-mer Composition 1233
BA3I Find a k-Universal Circular String 853
BA3J Reconstruct a String from its Paired Composition 882
BA3K Generate Contigs from a Collection of Reads 692
BA3L Construct a String Spelled by a Gapped Genome Path 678
BA3M Generate All Maximal Non-Branching Paths in a Graph 531
BA4A Translate an RNA String into an Amino Acid String 1150
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1091
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 935
BA4D Compute the Number of Peptides of Given Total Mass 790
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 786
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 648
BA4G Implement LeaderboardCyclopeptideSequencing 633
BA4H Generate the Convolution of a Spectrum 622
BA4I Implement ConvolutionCyclopeptideSequencing 448
BA4J Generate the Theoretical Spectrum of a Linear Peptide 591
BA4K Compute the Score of a Linear Peptide 531
BA4L Trim a Peptide Leaderboard 494
BA4M Solve the Turnpike Problem 309
BA5A Find the Minimum Number of Coins Needed to Make Change 1272
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1136
BA5C Find a Longest Common Subsequence of Two Strings 1220
BA5D Find the Longest Path in a DAG 866
BA5E Find a Highest-Scoring Alignment of Two Strings 1168
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1015
BA5G Compute the Edit Distance Between Two Strings 1027
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 757
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 623
BA5J Align Two Strings Using Affine Gap Penalties 984
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 512
BA5L Align Two Strings Using Linear Space 443
BA5M Find a Highest-Scoring Multiple Sequence Alignment 513
BA5N Find a Topological Ordering of a DAG 504
BA6A Implement GreedySorting to Sort a Permutation by Reversals 605
BA6B Compute the Number of Breakpoints in a Permutation 645
BA6C Compute the 2-Break Distance Between a Pair of Genomes 448
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 281
BA6E Find All Shared k-mers of a Pair of Strings 358
BA6F Implement ChromosomeToCycle 330
BA6G Implement CycleToChromosome 323
BA6H Implement ColoredEdges 295
BA6I Implement GraphToGenome 260
BA6J Implement 2-BreakOnGenomeGraph 256
BA6K Implement 2-BreakOnGenome 223
BA7A Compute Distances Between Leaves 389
BA7B Compute Limb Lengths in a Tree 395
BA7C Implement AdditivePhylogeny 411
BA7D Implement UPGMA 330
BA7E Implement the Neighbor Joining Algorithm 293
BA7F Implement SmallParsimony 179
BA7G Adapt SmallParsimony to Unrooted Trees 136
BA8A Implement FarthestFirstTraversal 267
BA8B Compute the Squared Error Distortion 266
BA8C Implement the Lloyd Algorithm for k-Means Clustering 306
BA8D Implement the Soft k-Means Clustering Algorithm 227
BA8E Implement Hierarchical Clustering 230
BA9A Construct a Trie from a Collection of Patterns 526
BA9B Implement TrieMatching 529
BA9C Construct the Suffix Tree of a String 385
BA9D Find the Longest Repeat in a String 459
BA9E Find the Longest Substring Shared by Two Strings 334
BA9F Find the Shortest Non-Shared Substring of Two Strings 285
BA9G Construct the Suffix Array of a String 431
BA9H Pattern Matching with the Suffix Array 416
BA9I Construct the Burrows-Wheeler Transform of a String 573
BA9J Reconstruct a String from its Burrows-Wheeler Transform 521
BA9K Generate the Last-to-First Mapping of a String 342
BA9L Implement BWMatching 325
BA9M Implement BetterBWMatching 330
BA9N Find All Occurrences of a Collection of Patterns in a String 307
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 262
BA9P Implement TreeColoring 147
BA9Q Construct the Partial Suffix Array of a String 216
BA9R Construct a Suffix Tree from a Suffix Array 160