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: Rasul vs. “Compute the Probability of a Hidden Path”, 2 minutes ago
Problems: 284 (total), users: 126741
ID Title Solved By Correct Ratio
BA10A Compute the Probability of a Hidden Path 1002
BA10B Compute the Probability of an Outcome Given a Hidden Path 820
BA10C Implement the Viterbi Algorithm 762
BA10D Compute the Probability of a String Emitted by an HMM 431
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 206
BA11B Implement DecodingIdealSpectrum 155
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 111
BA11J Find a Highest-Scoring Modified Peptide against a Spectrum 78
BA1A Compute the Number of Times a Pattern Appears in a Text 3468
BA1B Find the Most Frequent Words in a String 3543
BA1C Find the Reverse Complement of a String 3354
BA1D Find All Occurrences of a Pattern in a String 3214
BA1E Find Patterns Forming Clumps in a String 2834
BA1F Find a Position in a Genome Minimizing the Skew 2785
BA1G Compute the Hamming Distance Between Two Strings 2897
BA1H Find All Approximate Occurrences of a Pattern in a String 2271
BA1I Find the Most Frequent Words with Mismatches in a String 1821
BA1J Find Frequent Words with Mismatches and Reverse Complements 1666
BA1K Generate the Frequency Array of a String 1461
BA1L Implement PatternToNumber 1699
BA1M Implement NumberToPattern 1637
BA1N Generate the d-Neighborhood of a String 1527
BA2A Implement MotifEnumeration 1524
BA2B Find a Median String 1601
BA2C Find a Profile-most Probable k-mer in a String 1437
BA2D Implement GreedyMotifSearch 1298
BA2E Implement GreedyMotifSearch with Pseudocounts 1185
BA2F Implement RandomizedMotifSearch 1280
BA2G Implement GibbsSampler 939
BA2H Implement DistanceBetweenPatternAndStrings 1241
BA3A Generate the k-mer Composition of a String 1711
BA3B Reconstruct a String from its Genome Path 1565
BA3C Construct the Overlap Graph of a Collection of k-mers 1535
BA3D Construct the De Bruijn Graph of a String 1430
BA3E Construct the De Bruijn Graph of a Collection of k-mers 1371
BA3F Find an Eulerian Cycle in a Graph 1137
BA3G Find an Eulerian Path in a Graph 1118
BA3H Reconstruct a String from its k-mer Composition 1097
BA3I Find a k-Universal Circular String 799
BA3J Reconstruct a String from its Paired Composition 829
BA3K Generate Contigs from a Collection of Reads 633
BA3L Construct a String Spelled by a Gapped Genome Path 626
BA3M Generate All Maximal Non-Branching Paths in a Graph 481
BA4A Translate an RNA String into an Amino Acid String 1080
BA4B Find Substrings of a Genome Encoding a Given Amino Acid String 1024
BA4C Generate the Theoretical Spectrum of a Cyclic Peptide 872
BA4D Compute the Number of Peptides of Given Total Mass 733
BA4E Find a Cyclic Peptide with Theoretical Spectrum Matching an Ideal Spectrum 722
BA4F Compute the Score of a Cyclic Peptide Against a Spectrum 587
BA4G Implement LeaderboardCyclopeptideSequencing 567
BA4H Generate the Convolution of a Spectrum 557
BA4I Implement ConvolutionCyclopeptideSequencing 388
BA4J Generate the Theoretical Spectrum of a Linear Peptide 534
BA4K Compute the Score of a Linear Peptide 474
BA4L Trim a Peptide Leaderboard 433
BA4M Solve the Turnpike Problem 255
BA5A Find the Minimum Number of Coins Needed to Make Change 1171
BA5B Find the Length of a Longest Path in a Manhattan-like Grid 1030
BA5C Find a Longest Common Subsequence of Two Strings 1116
BA5D Find the Longest Path in a DAG 760
BA5E Find a Highest-Scoring Alignment of Two Strings 1035
BA5F Find a Highest-Scoring Local Alignment of Two Strings 890
BA5G Compute the Edit Distance Between Two Strings 895
BA5H Find a Highest-Scoring Fitting Alignment of Two Strings 638
BA5I Find a Highest-Scoring Overlap Alignment of Two Strings 554
BA5J Align Two Strings Using Affine Gap Penalties 808
BA5K Find a Middle Edge in an Alignment Graph in Linear Space 426
BA5L Align Two Strings Using Linear Space 369
BA5M Find a Highest-Scoring Multiple Sequence Alignment 429
BA5N Find a Topological Ordering of a DAG 417
BA6A Implement GreedySorting to Sort a Permutation by Reversals 582
BA6B Compute the Number of Breakpoints in a Permutation 619
BA6C Compute the 2-Break Distance Between a Pair of Genomes 423
BA6D Find a Shortest Transformation of One Genome into Another by 2-Breaks 261
BA6E Find All Shared k-mers of a Pair of Strings 337
BA6F Implement ChromosomeToCycle 312
BA6G Implement CycleToChromosome 305
BA6H Implement ColoredEdges 278
BA6I Implement GraphToGenome 242
BA6J Implement 2-BreakOnGenomeGraph 239
BA6K Implement 2-BreakOnGenome 204
BA7A Compute Distances Between Leaves 362
BA7B Compute Limb Lengths in a Tree 380
BA7C Implement AdditivePhylogeny 386
BA7D Implement UPGMA 267
BA7E Implement the Neighbor Joining Algorithm 237
BA7F Implement SmallParsimony 166
BA7G Adapt SmallParsimony to Unrooted Trees 124
BA8A Implement FarthestFirstTraversal 254
BA8B Compute the Squared Error Distortion 253
BA8C Implement the Lloyd Algorithm for k-Means Clustering 289
BA8D Implement the Soft k-Means Clustering Algorithm 209
BA8E Implement Hierarchical Clustering 211
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 419
BA9H Pattern Matching with the Suffix Array 341
BA9I Construct the Burrows-Wheeler Transform of a String 499
BA9J Reconstruct a String from its Burrows-Wheeler Transform 427
BA9K Generate the Last-to-First Mapping of a String 332
BA9L Implement BWMatching 315
BA9M Implement BetterBWMatching 270
BA9N Find All Occurrences of a Collection of Patterns in a String 272
BA9O Find All Approximate Occurrences of a Collection of Patterns in a String 255
BA9P Implement TreeColoring 141
BA9Q Construct the Partial Suffix Array of a String 209
BA9R Construct a Suffix Tree from a Suffix Array 154