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: srishtisurabhi vs. “Complementing a Strand of DNA”, 6 minutes ago
Problems: 284 (total), users: 121090
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 935
BA10B Compute the Probability of an Outcome Given a Hidden Path 772
BA10C Implement the Viterbi Algorithm 609
BA10D Compute the Probability of a String Emitted by an HMM 394
BA10E Construct a Profile HMM 220
BA10F Construct a Profile HMM with Pseudocounts 210
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 121
BA10H Estimate the Parameters of an HMM 187
BA10I Implement Viterbi Learning 149
BA10J Solve the Soft Decoding Problem 175
BA10K Implement Baum-Welch Learning 160
BA11A Construct the Graph of a Spectrum 197
BA11B Implement DecodingIdealSpectrum 146
BA11C Convert a Peptide into a Peptide Vector 209
BA11D Convert a Peptide Vector into a Peptide 198
BA11E Sequence a Peptide 121
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 116
BA11G Implement PSMSearch 109
BA11H Compute the Size of a Spectral Dictionary 101
BA11I Compute the Probability of a Spectral Dictionary 101
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 73
BA1A Compute the Number of Times a Pattern Appears in a Text 3284
BA1B Find the Most Frequent Words in a String 3345
BA1C Find the Reverse Complement of a String 3177
BA1D Find All Occurrences of a Pattern in a String 3046
BA1E Find Patterns Forming Clumps in a String 2676
BA1F Find a Position in a Genome Minimizing the Skew 2644
BA1G Compute the Hamming Distance Between Two Strings 2747
BA1H Find All Approximate Occurrences of a Pattern in a String 2131
BA1I Find the Most Frequent Words with Mismatches in a String 1697
BA1J Find Frequent Words with Mismatches and Reverse Complements 1552
BA1K Generate the Frequency Array of a String 1352
BA1L Implement PatternToNumber 1597
BA1M Implement NumberToPattern 1535
BA1N Generate the d-Neighborhood of a String 1416
BA2A Implement MotifEnumeration 1427
BA2B Find a Median String 1503
BA2C Find a Profile-most Probable k-mer in a String 1346
BA2D Implement GreedyMotifSearch 1211
BA2E Implement GreedyMotifSearch with Pseudocounts 1096
BA2F Implement RandomizedMotifSearch 1077
BA2G Implement GibbsSampler 853
BA2H Implement DistanceBetweenPatternAndStrings 1162
BA3A Generate the k-mer Composition of a String 1594
BA3B Reconstruct a String from its Genome Path 1472
BA3C Construct the Overlap Graph of a Collection of k-mers 1445
BA3D Construct the De Bruijn Graph of a String 1340
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1281
BA3F Find an Eulerian Cycle in a Graph 1051
BA3G Find an Eulerian Path in a Graph 925
BA3H Reconstruct a String from its k-mer Composition 1023
BA3I Find a k-Universal Circular String 730
BA3J Reconstruct a String from its Paired Composition 761
BA3K Generate Contigs from a Collection of Reads 568
BA3L Construct a String Spelled by a Gapped Genome Path 564
BA3M Generate All Maximal Non-Branching Paths in a Graph 427
BA4A Translate an RNA String into an Amino Acid String 1013
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 985
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 835
BA4D Compute the Number of Peptides of Given Total Mass 701
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 692
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 556
BA4G Implement LeaderboardCyclopeptideSequencing 545
BA4H Generate the Convolution of a Spectrum 532
BA4I Implement ConvolutionCyclopeptideSequencing 370
BA4J Generate the Theoretical Spectrum of a Linear Peptide 511
BA4K Compute the Score of a Linear Peptide 451
BA4L Trim a Peptide Leaderboard 412
BA4M Solve the Turnpike Problem 239
BA5A Find the Minimum Number of Coins Needed to Make Change 1132
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1000
BA5C Find a Longest Common Subsequence of Two Strings 1087
BA5D Find the Longest Path in a DAG 722
BA5E Find a Highest-Scoring Alignment of Two Strings 996
BA5F Find a Highest-Scoring Local Alignment of Two Strings 860
BA5G Compute the Edit Distance Between Two Strings 858
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 618
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 536
BA5J Align Two Strings Using Affine Gap Penalties 678
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 410
BA5L Align Two Strings Using Linear Space 355
BA5M Find a Highest-Scoring Multiple Sequence Alignment 412
BA5N Find a Topological Ordering of a DAG 407
BA6A Implement GreedySorting to Sort a Permutation by Reversals 567
BA6B Compute the Number of Breakpoints in a Permutation 603
BA6C Compute the 2-Break Distance Between a Pair of Genomes 407
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 254
BA6E Find All Shared k-mers of a Pair of Strings 324
BA6F Implement ChromosomeToCycle 298
BA6G Implement CycleToChromosome 292
BA6H Implement ColoredEdges 264
BA6I Implement GraphToGenome 229
BA6J Implement 2-BreakOnGenomeGraph 224
BA6K Implement 2-BreakOnGenome 192
BA7A Compute Distances Between Leaves 333
BA7B Compute Limb Lengths in a Tree 366
BA7C Implement AdditivePhylogeny 353
BA7D Implement UPGMA 234
BA7E Implement the Neighbor Joining Algorithm 223
BA7F Implement SmallParsimony 157
BA7G Adapt SmallParsimony to Unrooted Trees 114
BA8A Implement FarthestFirstTraversal 235
BA8B Compute the Squared Error Distortion 236
BA8C Implement the Lloyd Algorithm for k-Means Clustering 272
BA8D Implement the Soft k-Means Clustering Algorithm 194
BA8E Implement Hierarchical Clustering 201
BA9A Construct a Trie from a Collection of Patterns 439
BA9B Implement TrieMatching 437
BA9C Construct the Suffix Tree of a String 341
BA9D Find the Longest Repeat in a String 430
BA9E Find the Longest Substring Shared by Two Strings 314
BA9F Find the Shortest Non-Shared Substring of Two Strings 264
BA9G Construct the Suffix Array of a String 386
BA9H Pattern Matching with the Suffix Array 334
BA9I Construct the Burrows-Wheeler Transform of a String 460
BA9J Reconstruct a String from its Burrows-Wheeler Transform 388
BA9K Generate the Last-to-First Mapping of a String 323
BA9L Implement BWMatching 285
BA9M Implement BetterBWMatching 261
BA9N Find All Occurrences of a Collection of Patterns in a String 265
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 248
BA9P Implement TreeColoring 133
BA9Q Construct the Partial Suffix Array of a String 202
BA9R Construct a Suffix Tree from a Suffix Array 149