From Chapter 1: File Link
| Problem No | Problem Name | Problem Link |
|---|---|---|
| BA1A | Compute the Number of Times a Pattern Appears in a Text | problem Link |
| BA1B | Find the Most Frequent Words in a String | problem Link |
| BA1C | Find the Reverse Complement of a String | problem Link |
| BA1D | Find All Occurrences of a Pattern in a String | problem Link |
| BA1E | Find Patterns Forming Clumps in a String | problem Link |
| BA1F | Find a Position in a Genome Minimizing the Skew | problem Link |
| BA1G | Compute the Hamming Distance Between Two Strings | problem Link |
| BA1H | Find All Approximate Occurrences of a Pattern in a String | problem Link |
| BA1I | Find the Most Frequent Words with Mismatches in a String | problem Link |
| BA1J | Find Frequent Words with Mismatches and Reverse Complements | problem Link |
| BA1K | Generate the Frequency Array of a String | problem Link |
| BA1L | Implement PatternToNumber | problem Link |
| BA1M | Implement NumberToPattern | problem Link |
| BA1N | Generate the d-Neighborhood of a String | problem Link |
From Chapter 2: File Link
| Problem No | Problem Name | Problem Link |
|---|---|---|
| BA2A | Implement MotifEnumeration | problem Link |
| BA2B | Find a Median String | problem Link |
| BA2C | Find a Profile-most Probable k-mer in a String | problem Link |
| BA2D | Implement GreedyMotifSearch | problem Link |
| BA2E | Implement GreedyMotifSearch with Pseudocounts | problem Link |
| BA2F | Implement RandomizedMotifSearch | problem Link |
| BA2H | Implement DistanceBetweenPatternAndStrings | problem Link |
From Chapter 3: File Link
| Problem No | Problem Name | Problem Link |
|---|---|---|
| BA3A | Generate the k-mer Composition of a String | problem Link |
| BA3B | Reconstruct a String from its Genome Path | problem Link |
| BA3C | Construct the Overlap Graph of a Collection of k-mers | problem Link |
| BA3D | Construct the De Bruijn Graph of a String | problem Link |
| BA3E | Construct the De Bruijn Graph of a Collection of k-mers | problem Link |
| BA3F | Find an Eulerian Cycle in a Graph | problem Link |
| BA3G | Find an Eulerian Path in a Graph | problem Link |
| BA3H | Reconstruct a String from its k-mer Composition | problem Link |
| BA3I | Find a k-Universal Circular String | problem Link |
| BA3L | Construct a String Spelled by a Gapped Genome Path | problem Link |
From Chapter 4: File Link
| Problem No | Problem Name | Problem Link |
|---|---|---|
| BA4A | Translate an RNA String into an Amino Acid String | problem Link |
| BA4B | Find Substrings of a Genome Encoding a Given Amino Acid String | problem Link |
| BA4C | Generate the Theoretical Spectrum of a Cyclic Peptide | problem Link |
| BA4H | Generate the Convolution of a Spectrum | problem Link |
From Chapter 9: File Link
| Problem No | Problem Name | Problem Link |
|---|---|---|
| BA9G | Construct the Suffix Array of a String | problem Link |
| BA9I | Construct the Burrows-Wheeler Transform of a String | problem Link |
| BA9J | Reconstruct a String from its Burrows-Wheeler Transform | problem Link |
| BA9K | Generate the Last-to-First Mapping of a String | problem Link |