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: hanaolga vs. “Counting DNA Nucleotides”, 9 minutes ago
Problems: 284 (total), users: 134830
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1057
BA10B Compute the Probability of an Outcome Given a Hidden Path 860
BA10C Implement the Viterbi Algorithm 793
BA10D Compute the Probability of a String Emitted by an HMM 459
BA10E Construct a Profile HMM 248
BA10F Construct a Profile HMM with Pseudocounts 241
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 143
BA10H Estimate the Parameters of an HMM 214
BA10I Implement Viterbi Learning 172
BA10J Solve the Soft Decoding Problem 199
BA10K Implement Baum-Welch Learning 176
BA11A Construct the Graph of a Spectrum 220
BA11B Implement DecodingIdealSpectrum 169
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 3613
BA1B Find the Most Frequent Words in a String 3724
BA1C Find the Reverse Complement of a String 3484
BA1D Find All Occurrences of a Pattern in a String 3334
BA1E Find Patterns Forming Clumps in a String 2981
BA1F Find a Position in a Genome Minimizing the Skew 2895
BA1G Compute the Hamming Distance Between Two Strings 3043
BA1H Find All Approximate Occurrences of a Pattern in a String 2381
BA1I Find the Most Frequent Words with Mismatches in a String 1913
BA1J Find Frequent Words with Mismatches and Reverse Complements 1755
BA1K Generate the Frequency Array of a String 1536
BA1L Implement PatternToNumber 1771
BA1M Implement NumberToPattern 1704
BA1N Generate the d-Neighborhood of a String 1600
BA2A Implement MotifEnumeration 1643
BA2B Find a Median String 1736
BA2C Find a Profile-most Probable k-mer in a String 1554
BA2D Implement GreedyMotifSearch 1362
BA2E Implement GreedyMotifSearch with Pseudocounts 1261
BA2F Implement RandomizedMotifSearch 1355
BA2G Implement GibbsSampler 1011
BA2H Implement DistanceBetweenPatternAndStrings 1294
BA3A Generate the k-mer Composition of a String 1820
BA3B Reconstruct a String from its Genome Path 1630
BA3C Construct the Overlap Graph of a Collection of k-mers 1612
BA3D Construct the De Bruijn Graph of a String 1533
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1479
BA3F Find an Eulerian Cycle in a Graph 1240
BA3G Find an Eulerian Path in a Graph 1215
BA3H Reconstruct a String from its k-mer Composition 1234
BA3I Find a k-Universal Circular String 853
BA3J Reconstruct a String from its Paired Composition 884
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 1151
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1092
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 1273
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1137
BA5C Find a Longest Common Subsequence of Two Strings 1221
BA5D Find the Longest Path in a DAG 867
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 1028
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 758
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 624
BA5J Align Two Strings Using Affine Gap Penalties 985
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 514
BA5L Align Two Strings Using Linear Space 445
BA5M Find a Highest-Scoring Multiple Sequence Alignment 515
BA5N Find a Topological Ordering of a DAG 505
BA6A Implement GreedySorting to Sort a Permutation by Reversals 606
BA6B Compute the Number of Breakpoints in a Permutation 646
BA6C Compute the 2-Break Distance Between a Pair of Genomes 449
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 282
BA6E Find All Shared k-mers of a Pair of Strings 359
BA6F Implement ChromosomeToCycle 331
BA6G Implement CycleToChromosome 324
BA6H Implement ColoredEdges 296
BA6I Implement GraphToGenome 261
BA6J Implement 2-BreakOnGenomeGraph 257
BA6K Implement 2-BreakOnGenome 224
BA7A Compute Distances Between Leaves 390
BA7B Compute Limb Lengths in a Tree 396
BA7C Implement AdditivePhylogeny 412
BA7D Implement UPGMA 331
BA7E Implement the Neighbor Joining Algorithm 294
BA7F Implement SmallParsimony 180
BA7G Adapt SmallParsimony to Unrooted Trees 137
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 527
BA9B Implement TrieMatching 530
BA9C Construct the Suffix Tree of a String 386
BA9D Find the Longest Repeat in a String 460
BA9E Find the Longest Substring Shared by Two Strings 335
BA9F Find the Shortest Non-Shared Substring of Two Strings 287
BA9G Construct the Suffix Array of a String 433
BA9H Pattern Matching with the Suffix Array 418
BA9I Construct the Burrows-Wheeler Transform of a String 574
BA9J Reconstruct a String from its Burrows-Wheeler Transform 522
BA9K Generate the Last-to-First Mapping of a String 343
BA9L Implement BWMatching 326
BA9M Implement BetterBWMatching 331
BA9N Find All Occurrences of a Collection of Patterns in a String 308
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 217
BA9R Construct a Suffix Tree from a Suffix Array 160