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: catherinedobler@yandex.ru vs. “Generate the Frequency Array of a String”, just now
Problems: 284 (total), users: 109240
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 818
BA10B Compute the Probability of an Outcome Given a Hidden Path 674
BA10C Implement the Viterbi Algorithm 538
BA10D Compute the Probability of a String Emitted by an HMM 344
BA10E Construct a Profile HMM 193
BA10F Construct a Profile HMM with Pseudocounts 183
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 103
BA10H Estimate the Parameters of an HMM 162
BA10I Implement Viterbi Learning 127
BA10J Solve the Soft Decoding Problem 139
BA10K Implement Baum-Welch Learning 141
BA11A Construct the Graph of a Spectrum 181
BA11B Implement DecodingIdealSpectrum 133
BA11C Convert a Peptide into a Peptide Vector 190
BA11D Convert a Peptide Vector into a Peptide 182
BA11E Sequence a Peptide 107
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 106
BA11G Implement PSMSearch 99
BA11H Compute the Size of a Spectral Dictionary 91
BA11I Compute the Probability of a Spectral Dictionary 89
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 66
BA1A Compute the Number of Times a Pattern Appears in a Text 2903
BA1B Find the Most Frequent Words in a String 2994
BA1C Find the Reverse Complement of a String 2858
BA1D Find All Occurrences of a Pattern in a String 2742
BA1E Find Patterns Forming Clumps in a String 2369
BA1F Find a Position in a Genome Minimizing the Skew 2339
BA1G Compute the Hamming Distance Between Two Strings 2424
BA1H Find All Approximate Occurrences of a Pattern in a String 1869
BA1I Find the Most Frequent Words with Mismatches in a String 1459
BA1J Find Frequent Words with Mismatches and Reverse Complements 1333
BA1K Generate the Frequency Array of a String 1191
BA1L Implement PatternToNumber 1418
BA1M Implement NumberToPattern 1363
BA1N Generate the d-Neighborhood of a String 1231
BA2A Implement MotifEnumeration 1233
BA2B Find a Median String 1298
BA2C Find a Profile-most Probable k-mer in a String 1147
BA2D Implement GreedyMotifSearch 1020
BA2E Implement GreedyMotifSearch with Pseudocounts 899
BA2F Implement RandomizedMotifSearch 891
BA2G Implement GibbsSampler 676
BA2H Implement DistanceBetweenPatternAndStrings 987
BA3A Generate the k-mer Composition of a String 1341
BA3B Reconstruct a String from its Genome Path 1255
BA3C Construct the Overlap Graph of a Collection of k-mers 1152
BA3D Construct the De Bruijn Graph of a String 1128
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1049
BA3F Find an Eulerian Cycle in a Graph 811
BA3G Find an Eulerian Path in a Graph 751
BA3H Reconstruct a String from its k-mer Composition 839
BA3I Find a k-Universal Circular String 592
BA3J Reconstruct a String from its Paired Composition 599
BA3K Generate Contigs from a Collection of Reads 447
BA3L Construct a String Spelled by a Gapped Genome Path 443
BA3M Generate All Maximal Non-Branching Paths in a Graph 334
BA4A Translate an RNA String into an Amino Acid String 903
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 826
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 744
BA4D Compute the Number of Peptides of Given Total Mass 599
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 586
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 476
BA4G Implement LeaderboardCyclopeptideSequencing 454
BA4H Generate the Convolution of a Spectrum 452
BA4I Implement ConvolutionCyclopeptideSequencing 293
BA4J Generate the Theoretical Spectrum of a Linear Peptide 428
BA4K Compute the Score of a Linear Peptide 374
BA4L Trim a Peptide Leaderboard 336
BA4M Solve the Turnpike Problem 183
BA5A Find the Minimum Number of Coins Needed to Make Change 970
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 813
BA5C Find a Longest Common Subsequence of Two Strings 908
BA5D Find the Longest Path in a DAG 586
BA5E Find a Highest-Scoring Alignment of Two Strings 819
BA5F Find a Highest-Scoring Local Alignment of Two Strings 686
BA5G Compute the Edit Distance Between Two Strings 720
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 481
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 425
BA5J Align Two Strings Using Affine Gap Penalties 578
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 320
BA5L Align Two Strings Using Linear Space 279
BA5M Find a Highest-Scoring Multiple Sequence Alignment 324
BA5N Find a Topological Ordering of a DAG 296
BA6A Implement GreedySorting to Sort a Permutation by Reversals 517
BA6B Compute the Number of Breakpoints in a Permutation 554
BA6C Compute the 2-Break Distance Between a Pair of Genomes 376
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 236
BA6E Find All Shared k-mers of a Pair of Strings 307
BA6F Implement ChromosomeToCycle 278
BA6G Implement CycleToChromosome 272
BA6H Implement ColoredEdges 246
BA6I Implement GraphToGenome 211
BA6J Implement 2-BreakOnGenomeGraph 208
BA6K Implement 2-BreakOnGenome 173
BA7A Compute Distances Between Leaves 291
BA7B Compute Limb Lengths in a Tree 339
BA7C Implement AdditivePhylogeny 320
BA7D Implement UPGMA 218
BA7E Implement the Neighbor Joining Algorithm 204
BA7F Implement SmallParsimony 147
BA7G Adapt SmallParsimony to Unrooted Trees 105
BA8A Implement FarthestFirstTraversal 205
BA8B Compute the Squared Error Distortion 208
BA8C Implement the Lloyd Algorithm for k-Means Clustering 237
BA8D Implement the Soft k-Means Clustering Algorithm 161
BA8E Implement Hierarchical Clustering 166
BA9A Construct a Trie from a Collection of Patterns 369
BA9B Implement TrieMatching 374
BA9C Construct the Suffix Tree of a String 277
BA9D Find the Longest Repeat in a String 388
BA9E Find the Longest Substring Shared by Two Strings 277
BA9F Find the Shortest Non-Shared Substring of Two Strings 233
BA9G Construct the Suffix Array of a String 343
BA9H Pattern Matching with the Suffix Array 287
BA9I Construct the Burrows-Wheeler Transform of a String 389
BA9J Reconstruct a String from its Burrows-Wheeler Transform 333
BA9K Generate the Last-to-First Mapping of a String 276
BA9L Implement BWMatching 248
BA9M Implement BetterBWMatching 214
BA9N Find All Occurrences of a Collection of Patterns in a String 227
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 219
BA9P Implement TreeColoring 102
BA9Q Construct the Partial Suffix Array of a String 174
BA9R Construct a Suffix Tree from a Suffix Array 127