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: Hekuisong vs. “Find the Most Frequent Words with Mismatches in a String”, just now
Problems: 284 (total), users: 126586
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 997
BA10B Compute the Probability of an Outcome Given a Hidden Path 818
BA10C Implement the Viterbi Algorithm 761
BA10D Compute the Probability of a String Emitted by an HMM 429
BA10E Construct a Profile HMM 234
BA10F Construct a Profile HMM with Pseudocounts 225
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 130
BA10H Estimate the Parameters of an HMM 199
BA10I Implement Viterbi Learning 160
BA10J Solve the Soft Decoding Problem 183
BA10K Implement Baum-Welch Learning 168
BA11A Construct the Graph of a Spectrum 205
BA11B Implement DecodingIdealSpectrum 154
BA11C Convert a Peptide into a Peptide Vector 219
BA11D Convert a Peptide Vector into a Peptide 206
BA11E Sequence a Peptide 129
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 128
BA11G Implement PSMSearch 117
BA11H Compute the Size of a Spectral Dictionary 110
BA11I Compute the Probability of a Spectral Dictionary 110
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 78
BA1A Compute the Number of Times a Pattern Appears in a Text 3450
BA1B Find the Most Frequent Words in a String 3522
BA1C Find the Reverse Complement of a String 3334
BA1D Find All Occurrences of a Pattern in a String 3193
BA1E Find Patterns Forming Clumps in a String 2811
BA1F Find a Position in a Genome Minimizing the Skew 2760
BA1G Compute the Hamming Distance Between Two Strings 2871
BA1H Find All Approximate Occurrences of a Pattern in a String 2239
BA1I Find the Most Frequent Words with Mismatches in a String 1796
BA1J Find Frequent Words with Mismatches and Reverse Complements 1643
BA1K Generate the Frequency Array of a String 1436
BA1L Implement PatternToNumber 1677
BA1M Implement NumberToPattern 1614
BA1N Generate the d-Neighborhood of a String 1507
BA2A Implement MotifEnumeration 1505
BA2B Find a Median String 1578
BA2C Find a Profile-most Probable k-mer in a String 1414
BA2D Implement GreedyMotifSearch 1279
BA2E Implement GreedyMotifSearch with Pseudocounts 1161
BA2F Implement RandomizedMotifSearch 1254
BA2G Implement GibbsSampler 915
BA2H Implement DistanceBetweenPatternAndStrings 1217
BA3A Generate the k-mer Composition of a String 1684
BA3B Reconstruct a String from its Genome Path 1539
BA3C Construct the Overlap Graph of a Collection of k-mers 1511
BA3D Construct the De Bruijn Graph of a String 1406
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1346
BA3F Find an Eulerian Cycle in a Graph 1112
BA3G Find an Eulerian Path in a Graph 1095
BA3H Reconstruct a String from its k-mer Composition 1074
BA3I Find a k-Universal Circular String 780
BA3J Reconstruct a String from its Paired Composition 809
BA3K Generate Contigs from a Collection of Reads 610
BA3L Construct a String Spelled by a Gapped Genome Path 605
BA3M Generate All Maximal Non-Branching Paths in a Graph 462
BA4A Translate an RNA String into an Amino Acid String 1065
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1012
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 862
BA4D Compute the Number of Peptides of Given Total Mass 723
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 711
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 578
BA4G Implement LeaderboardCyclopeptideSequencing 561
BA4H Generate the Convolution of a Spectrum 550
BA4I Implement ConvolutionCyclopeptideSequencing 381
BA4J Generate the Theoretical Spectrum of a Linear Peptide 528
BA4K Compute the Score of a Linear Peptide 468
BA4L Trim a Peptide Leaderboard 428
BA4M Solve the Turnpike Problem 249
BA5A Find the Minimum Number of Coins Needed to Make Change 1163
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1026
BA5C Find a Longest Common Subsequence of Two Strings 1114
BA5D Find the Longest Path in a DAG 758
BA5E Find a Highest-Scoring Alignment of Two Strings 1033
BA5F Find a Highest-Scoring Local Alignment of Two Strings 888
BA5G Compute the Edit Distance Between Two Strings 893
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 636
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 552
BA5J Align Two Strings Using Affine Gap Penalties 806
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 424
BA5L Align Two Strings Using Linear Space 366
BA5M Find a Highest-Scoring Multiple Sequence Alignment 426
BA5N Find a Topological Ordering of a DAG 416
BA6A Implement GreedySorting to Sort a Permutation by Reversals 580
BA6B Compute the Number of Breakpoints in a Permutation 617
BA6C Compute the 2-Break Distance Between a Pair of Genomes 421
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 260
BA6E Find All Shared k-mers of a Pair of Strings 336
BA6F Implement ChromosomeToCycle 310
BA6G Implement CycleToChromosome 304
BA6H Implement ColoredEdges 276
BA6I Implement GraphToGenome 241
BA6J Implement 2-BreakOnGenomeGraph 238
BA6K Implement 2-BreakOnGenome 204
BA7A Compute Distances Between Leaves 361
BA7B Compute Limb Lengths in a Tree 379
BA7C Implement AdditivePhylogeny 382
BA7D Implement UPGMA 263
BA7E Implement the Neighbor Joining Algorithm 235
BA7F Implement SmallParsimony 165
BA7G Adapt SmallParsimony to Unrooted Trees 122
BA8A Implement FarthestFirstTraversal 253
BA8B Compute the Squared Error Distortion 252
BA8C Implement the Lloyd Algorithm for k-Means Clustering 288
BA8D Implement the Soft k-Means Clustering Algorithm 208
BA8E Implement Hierarchical Clustering 210
BA9A Construct a Trie from a Collection of Patterns 470
BA9B Implement TrieMatching 450
BA9C Construct the Suffix Tree of a String 348
BA9D Find the Longest Repeat in a String 442
BA9E Find the Longest Substring Shared by Two Strings 323
BA9F Find the Shortest Non-Shared Substring of Two Strings 273
BA9G Construct the Suffix Array of a String 418
BA9H Pattern Matching with the Suffix Array 341
BA9I Construct the Burrows-Wheeler Transform of a String 497
BA9J Reconstruct a String from its Burrows-Wheeler Transform 424
BA9K Generate the Last-to-First Mapping of a String 331
BA9L Implement BWMatching 314
BA9M Implement BetterBWMatching 269
BA9N Find All Occurrences of a Collection of Patterns in a String 271
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 254
BA9P Implement TreeColoring 140
BA9Q Construct the Partial Suffix Array of a String 208
BA9R Construct a Suffix Tree from a Suffix Array 153