Problem 1 |
Counting DNA Nucleotides |
Solution |
Solution |
Solution |
Solution |
Problem 2 |
Transcribing DNA into RNA |
Solution |
Solution |
Solution |
Solution |
Problem 3 |
Complementing a Strand of DNA |
Solution |
Solution |
Solution |
Solution |
Problem 4 |
Rabbits and Recurrence Relations |
Solution |
Solution |
Solution |
|
Problem 5 |
Computing GC Content |
Solution |
Solution |
Solution |
|
Problem 6 |
Counting Point Mutations |
Solution |
Solution |
|
|
Problem 7 |
Mendel's First Law |
Solution |
Solution |
|
|
Problem 8 |
Translating RNA into Protein |
Solution |
Solution |
|
|
Problem 9 |
Finding a Motif in DNA |
Solution |
Solution |
|
|
Problem 10 |
Consensus and Profile |
Solution |
|
|
|
Problem 11 |
Mortal Fibonacci Rabbits |
Solution |
|
|
|
Problem 12 |
Overlap Graphs |
Solution |
Solution |
|
|
Problem 13 |
Calculating Expected Offspring |
Solution |
|
|
|
Problem 14 |
Finding a Shared Motif |
Solution |
Solution |
|
|
Problem 15 |
Independent Alleles |
Solution |
|
|
|
Problem 16 |
Finding a Protein Motif |
Solution |
|
|
|
Problem 17 |
Inferring mRNA from Protein |
Solution |
|
|
|
Problem 18 |
Open Reading Frames |
Solution |
|
|
|
Problem 19 |
Enumerating Gene Orders |
Solution |
|
|
|
Problem 20 |
Calculating Protein Mass |
Solution |
Solution |
|
|
Problem 21 |
Locating Restriction Sites |
Solution |
|
|
|
Problem 22 |
RNA Splicing |
Solution |
|
|
|
Problem 23 |
Enumerating k-mers Lexicographically |
Solution |
|
|
|
Problem 24 |
Longest Increasing Subsequence |
Solution |
|
|
|
Problem 25 |
Genome Assembly as Shortest Superstring |
Solution |
|
|
|
Problem 26 |
Perfect Matchings and RNA Secondary Structures |
Solution |
|
|
|
Problem 27 |
Partial Permutations |
Solution |
|
|
|
Problem 28 |
Introduction to Random Strings |
Solution |
|
|
|
Problem 29 |
Enumerating Oriented Gene Orderings |
Solution |
|
|
|
Problem 30 |
Finding a Spliced Motif |
Solution |
|
|
|
Problem 31 |
Transitions and Transversions |
Solution |
|
|
|
Problem 32 |
Completing a Tree |
Solution |
|
|
|
Problem 33 |
Catalan Numbers and RNA Secondary Structures |
Solution |
|
|
|
Problem 34 |
Error Correction in Reads |
Solution |
|
|
|
Problem 35 |
Counting Phylogenetic Ancestors |
Solution |
|
|
|
Problem 36 |
k-Mer Composition |
Solution |
|
|
|
Problem 37 |
Speeding Up Motif Finding |
Solution |
|
|
|
Problem 38 |
Finding a Shared Spliced Motif |
Solution |
|
|
|
Problem 39 |
Ordering Strings of Varying Length Lexicographically |
Solution |
|
|
|
Problem 40 |
Maximum Matchings and RNA Secondary Structures |
Solution |
|
|
|
Problem 41 |
Creating a Distance Matrix |
Solution |
|
|
|
Problem 42 |
Reversal Distance |
|
|
|
|
Problem 43 |
Matching Random Motifs |
Solution |
|
|
|
Problem 44 |
Counting Subsets |
Solution |
|
|
|
Problem 45 |
Introduction to Alternative Splicing |
Solution |
|
|
|
Problem 46 |
Edit Distance |
Solution |
|
|
|
Problem 47 |
Expected Number of Restriction Sites |
Solution |
|
|
|
Problem 48 |
Motzkin Numbers and RNA Secondary Structures |
Solution |
|
|
|
Problem 49 |
Distances in Trees |
|
|
|
|
Problem 50 |
Interleaving Two Motifs |
|
|
|
|
Problem 51 |
Introduction to Set Operations |
Solution |
|
|
|
Problem 52 |
Sorting by Reversals |
|
|
|
|
Problem 53 |
Inferring Protein from Spectrum |
Solution |
|
|
|
Problem 54 |
Introduction to Pattern Matching |
|
|
|
|
Problem 55 |
Comparing Spectra with the Spectral Convolution |
|
|
|
|
Problem 56 |
Creating a Character Table |
|
|
|
|
Problem 57 |
Constructing a De Bruijn Graph |
|
|
|
|
Problem 58 |
Edit Distance Alignment |
|
|
|
|
Problem 59 |
Inferring Peptide from Full Spectrum |
|
|
|
|
Problem 60 |
Independent Segregation of Chromosomes |
Solution |
|
|
|
Problem 65 |
Counting Disease Carriers |
Solution |
|
|
|
Problem 85 |
Sex-Linked Inheritance |
Solution |
|
|
|
Problem 87 |
The Wright-Fisher Model of Genetic Drift |
Solution |
|
|
|
Problem 91 |
Wright-Fisher's Expected Behavior |
Solution |
|
|
|