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: emmaleehang vs. “Enumerating Gene Orders”, 9 minutes ago
Problems: 284 (total), users: 123134
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 964
BA10B Compute the Probability of an Outcome Given a Hidden Path 797
BA10C Implement the Viterbi Algorithm 631
BA10D Compute the Probability of a String Emitted by an HMM 415
BA10E Construct a Profile HMM 229
BA10F Construct a Profile HMM with Pseudocounts 218
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 126
BA10H Estimate the Parameters of an HMM 193
BA10I Implement Viterbi Learning 155
BA10J Solve the Soft Decoding Problem 179
BA10K Implement Baum-Welch Learning 163
BA11A Construct the Graph of a Spectrum 200
BA11B Implement DecodingIdealSpectrum 148
BA11C Convert a Peptide into a Peptide Vector 213
BA11D Convert a Peptide Vector into a Peptide 201
BA11E Sequence a Peptide 124
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 123
BA11G Implement PSMSearch 113
BA11H Compute the Size of a Spectral Dictionary 105
BA11I Compute the Probability of a Spectral Dictionary 105
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 75
BA1A Compute the Number of Times a Pattern Appears in a Text 3324
BA1B Find the Most Frequent Words in a String 3389
BA1C Find the Reverse Complement of a String 3216
BA1D Find All Occurrences of a Pattern in a String 3082
BA1E Find Patterns Forming Clumps in a String 2707
BA1F Find a Position in a Genome Minimizing the Skew 2671
BA1G Compute the Hamming Distance Between Two Strings 2782
BA1H Find All Approximate Occurrences of a Pattern in a String 2160
BA1I Find the Most Frequent Words with Mismatches in a String 1728
BA1J Find Frequent Words with Mismatches and Reverse Complements 1580
BA1K Generate the Frequency Array of a String 1377
BA1L Implement PatternToNumber 1614
BA1M Implement NumberToPattern 1552
BA1N Generate the d-Neighborhood of a String 1433
BA2A Implement MotifEnumeration 1446
BA2B Find a Median String 1520
BA2C Find a Profile-most Probable k-mer in a String 1362
BA2D Implement GreedyMotifSearch 1223
BA2E Implement GreedyMotifSearch with Pseudocounts 1110
BA2F Implement RandomizedMotifSearch 1091
BA2G Implement GibbsSampler 865
BA2H Implement DistanceBetweenPatternAndStrings 1175
BA3A Generate the k-mer Composition of a String 1613
BA3B Reconstruct a String from its Genome Path 1488
BA3C Construct the Overlap Graph of a Collection of k-mers 1461
BA3D Construct the De Bruijn Graph of a String 1356
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1295
BA3F Find an Eulerian Cycle in a Graph 1065
BA3G Find an Eulerian Path in a Graph 937
BA3H Reconstruct a String from its k-mer Composition 1035
BA3I Find a k-Universal Circular String 739
BA3J Reconstruct a String from its Paired Composition 770
BA3K Generate Contigs from a Collection of Reads 575
BA3L Construct a String Spelled by a Gapped Genome Path 569
BA3M Generate All Maximal Non-Branching Paths in a Graph 433
BA4A Translate an RNA String into an Amino Acid String 1025
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 995
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 845
BA4D Compute the Number of Peptides of Given Total Mass 710
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 698
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 564
BA4G Implement LeaderboardCyclopeptideSequencing 550
BA4H Generate the Convolution of a Spectrum 537
BA4I Implement ConvolutionCyclopeptideSequencing 374
BA4J Generate the Theoretical Spectrum of a Linear Peptide 516
BA4K Compute the Score of a Linear Peptide 456
BA4L Trim a Peptide Leaderboard 417
BA4M Solve the Turnpike Problem 242
BA5A Find the Minimum Number of Coins Needed to Make Change 1146
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1011
BA5C Find a Longest Common Subsequence of Two Strings 1100
BA5D Find the Longest Path in a DAG 730
BA5E Find a Highest-Scoring Alignment of Two Strings 1007
BA5F Find a Highest-Scoring Local Alignment of Two Strings 872
BA5G Compute the Edit Distance Between Two Strings 867
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 629
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 545
BA5J Align Two Strings Using Affine Gap Penalties 685
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 417
BA5L Align Two Strings Using Linear Space 360
BA5M Find a Highest-Scoring Multiple Sequence Alignment 419
BA5N Find a Topological Ordering of a DAG 410
BA6A Implement GreedySorting to Sort a Permutation by Reversals 574
BA6B Compute the Number of Breakpoints in a Permutation 611
BA6C Compute the 2-Break Distance Between a Pair of Genomes 415
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 258
BA6E Find All Shared k-mers of a Pair of Strings 329
BA6F Implement ChromosomeToCycle 305
BA6G Implement CycleToChromosome 299
BA6H Implement ColoredEdges 271
BA6I Implement GraphToGenome 236
BA6J Implement 2-BreakOnGenomeGraph 232
BA6K Implement 2-BreakOnGenome 199
BA7A Compute Distances Between Leaves 338
BA7B Compute Limb Lengths in a Tree 370
BA7C Implement AdditivePhylogeny 358
BA7D Implement UPGMA 239
BA7E Implement the Neighbor Joining Algorithm 228
BA7F Implement SmallParsimony 161
BA7G Adapt SmallParsimony to Unrooted Trees 117
BA8A Implement FarthestFirstTraversal 245
BA8B Compute the Squared Error Distortion 246
BA8C Implement the Lloyd Algorithm for k-Means Clustering 282
BA8D Implement the Soft k-Means Clustering Algorithm 203
BA8E Implement Hierarchical Clustering 205
BA9A Construct a Trie from a Collection of Patterns 464
BA9B Implement TrieMatching 443
BA9C Construct the Suffix Tree of a String 344
BA9D Find the Longest Repeat in a String 437
BA9E Find the Longest Substring Shared by Two Strings 318
BA9F Find the Shortest Non-Shared Substring of Two Strings 267
BA9G Construct the Suffix Array of a String 412
BA9H Pattern Matching with the Suffix Array 336
BA9I Construct the Burrows-Wheeler Transform of a String 489
BA9J Reconstruct a String from its Burrows-Wheeler Transform 415
BA9K Generate the Last-to-First Mapping of a String 326
BA9L Implement BWMatching 310
BA9M Implement BetterBWMatching 264
BA9N Find All Occurrences of a Collection of Patterns in a String 267
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 249
BA9P Implement TreeColoring 135
BA9Q Construct the Partial Suffix Array of a String 204
BA9R Construct a Suffix Tree from a Suffix Array 150