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: bnandithakrishnan vs. “Installing Python”, just now
Problems: 284 (total), users: 131576
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1041
BA10B Compute the Probability of an Outcome Given a Hidden Path 846
BA10C Implement the Viterbi Algorithm 782
BA10D Compute the Probability of a String Emitted by an HMM 448
BA10E Construct a Profile HMM 241
BA10F Construct a Profile HMM with Pseudocounts 234
BA10G Perform a Multiple Sequence Alignment with a Profile HMM 137
BA10H Estimate the Parameters of an HMM 207
BA10I Implement Viterbi Learning 166
BA10J Solve the Soft Decoding Problem 193
BA10K Implement Baum-Welch Learning 173
BA11A Construct the Graph of a Spectrum 214
BA11B Implement DecodingIdealSpectrum 163
BA11C Convert a Peptide into a Peptide Vector 229
BA11D Convert a Peptide Vector into a Peptide 216
BA11E Sequence a Peptide 139
BA11F Find a Highest-Scoring Peptide in a Proteome against a Spectrum 137
BA11G Implement PSMSearch 124
BA11H Compute the Size of a Spectral Dictionary 116
BA11I Compute the Probability of a Spectral Dictionary 117
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 83
BA1A Compute the Number of Times a Pattern Appears in a Text 3576
BA1B Find the Most Frequent Words in a String 3682
BA1C Find the Reverse Complement of a String 3449
BA1D Find All Occurrences of a Pattern in a String 3302
BA1E Find Patterns Forming Clumps in a String 2960
BA1F Find a Position in a Genome Minimizing the Skew 2876
BA1G Compute the Hamming Distance Between Two Strings 3022
BA1H Find All Approximate Occurrences of a Pattern in a String 2358
BA1I Find the Most Frequent Words with Mismatches in a String 1890
BA1J Find Frequent Words with Mismatches and Reverse Complements 1734
BA1K Generate the Frequency Array of a String 1518
BA1L Implement PatternToNumber 1755
BA1M Implement NumberToPattern 1689
BA1N Generate the d-Neighborhood of a String 1580
BA2A Implement MotifEnumeration 1630
BA2B Find a Median String 1716
BA2C Find a Profile-most Probable k-mer in a String 1537
BA2D Implement GreedyMotifSearch 1344
BA2E Implement GreedyMotifSearch with Pseudocounts 1242
BA2F Implement RandomizedMotifSearch 1338
BA2G Implement GibbsSampler 995
BA2H Implement DistanceBetweenPatternAndStrings 1284
BA3A Generate the k-mer Composition of a String 1796
BA3B Reconstruct a String from its Genome Path 1614
BA3C Construct the Overlap Graph of a Collection of k-mers 1597
BA3D Construct the De Bruijn Graph of a String 1517
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1462
BA3F Find an Eulerian Cycle in a Graph 1228
BA3G Find an Eulerian Path in a Graph 1203
BA3H Reconstruct a String from its k-mer Composition 1222
BA3I Find a k-Universal Circular String 842
BA3J Reconstruct a String from its Paired Composition 871
BA3K Generate Contigs from a Collection of Reads 681
BA3L Construct a String Spelled by a Gapped Genome Path 667
BA3M Generate All Maximal Non-Branching Paths in a Graph 521
BA4A Translate an RNA String into an Amino Acid String 1130
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1080
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 922
BA4D Compute the Number of Peptides of Given Total Mass 782
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 777
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 639
BA4G Implement LeaderboardCyclopeptideSequencing 624
BA4H Generate the Convolution of a Spectrum 613
BA4I Implement ConvolutionCyclopeptideSequencing 440
BA4J Generate the Theoretical Spectrum of a Linear Peptide 582
BA4K Compute the Score of a Linear Peptide 523
BA4L Trim a Peptide Leaderboard 484
BA4M Solve the Turnpike Problem 301
BA5A Find the Minimum Number of Coins Needed to Make Change 1261
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1124
BA5C Find a Longest Common Subsequence of Two Strings 1208
BA5D Find the Longest Path in a DAG 848
BA5E Find a Highest-Scoring Alignment of Two Strings 1150
BA5F Find a Highest-Scoring Local Alignment of Two Strings 1005
BA5G Compute the Edit Distance Between Two Strings 1009
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 746
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 614
BA5J Align Two Strings Using Affine Gap Penalties 974
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 503
BA5L Align Two Strings Using Linear Space 436
BA5M Find a Highest-Scoring Multiple Sequence Alignment 502
BA5N Find a Topological Ordering of a DAG 495
BA6A Implement GreedySorting to Sort a Permutation by Reversals 597
BA6B Compute the Number of Breakpoints in a Permutation 634
BA6C Compute the 2-Break Distance Between a Pair of Genomes 438
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 275
BA6E Find All Shared k-mers of a Pair of Strings 349
BA6F Implement ChromosomeToCycle 323
BA6G Implement CycleToChromosome 317
BA6H Implement ColoredEdges 289
BA6I Implement GraphToGenome 254
BA6J Implement 2-BreakOnGenomeGraph 249
BA6K Implement 2-BreakOnGenome 216
BA7A Compute Distances Between Leaves 372
BA7B Compute Limb Lengths in a Tree 389
BA7C Implement AdditivePhylogeny 396
BA7D Implement UPGMA 313
BA7E Implement the Neighbor Joining Algorithm 284
BA7F Implement SmallParsimony 175
BA7G Adapt SmallParsimony to Unrooted Trees 130
BA8A Implement FarthestFirstTraversal 259
BA8B Compute the Squared Error Distortion 259
BA8C Implement the Lloyd Algorithm for k-Means Clustering 295
BA8D Implement the Soft k-Means Clustering Algorithm 218
BA8E Implement Hierarchical Clustering 219
BA9A Construct a Trie from a Collection of Patterns 518
BA9B Implement TrieMatching 521
BA9C Construct the Suffix Tree of a String 379
BA9D Find the Longest Repeat in a String 453
BA9E Find the Longest Substring Shared by Two Strings 328
BA9F Find the Shortest Non-Shared Substring of Two Strings 280
BA9G Construct the Suffix Array of a String 426
BA9H Pattern Matching with the Suffix Array 410
BA9I Construct the Burrows-Wheeler Transform of a String 568
BA9J Reconstruct a String from its Burrows-Wheeler Transform 488
BA9K Generate the Last-to-First Mapping of a String 338
BA9L Implement BWMatching 321
BA9M Implement BetterBWMatching 299
BA9N Find All Occurrences of a Collection of Patterns in a String 303
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 257
BA9P Implement TreeColoring 143
BA9Q Construct the Partial Suffix Array of a String 211
BA9R Construct a Suffix Tree from a Suffix Array 156