DNA |
Counting DNA Nucleotides [ solution ] |
RNA |
Transcribing DNA into RNA [ solution ] |
REVC |
Complementing a Strand of DNA [ solution ] |
HAMM |
Counting Point Mutations [ solution ] |
PROT |
Translating RNA into Protein [ solution ] |
SUBS |
Finding a Motif in DNA [ solution ] |
PERM |
Enumerating Gene Orders [ solution ] |
PRTM |
Calculating Protein Mass [ solution ] |
FIB |
Rabbits and Recurrence Relations [ solution ] |
GC |
Computing GC Content [ solution ] |
IPRB |
Mendel's First Law [ solution ] |
LCSM |
Finding a Shared Motif [ solution ] |
MPRT |
Finding a Protein Motif [ solution ] |
MRNA |
Inferring mRNA from Protein [ solution ] |
ORF |
Open Reading Frames [ solution ] |
REVP |
Locating Restriction Sites [ solution ] |
SPLC |
RNA Splicing [ solution ] |
LEXF |
Enumerating k-mers Lexicographically [ solution ] |
SIGN |
Enumerating Oriented Gene Orderings [ solution ] |
CONS |
Consensus and Profile [ solution ] |
FIBD |
Mortal Fibonacci Rabbits [ solution ] |
GRPH |
Overlap Graphs [ solution ] |
IEV |
Calculating Expected Offspring [ solution ] |
LIA |
Independent Alleles [ solution ] |
LGIS |
Longest Increasing Subsequence [ solution ] |
LONG |
Genome Assembly as Shortest Superstring [ solution ] |
PMCH |
Perfect Matchings and RNA Secondary Structures [ solution ] |
PPER |
Partial Permutations [ solution ] |
PROB |
Introduction to Random Strings [ solution ] |
SSEQ |
Finding a Spliced Motif [ solution ] |
TRAN |
Transitions and Transversions [ solution ] |
TREE |
Completing a Tree [ solution ] |
CAT |
Catalan Numbers and RNA Secondary Structures [ solution ] |
CORR |
Error Correction in Reads [ solution ] |
INOD |
Counting Phylogenetic Ancestors [ solution ] |
KMER |
k-Mer Composition [ solution ] |
KMP |
Speeding Up Motif Finding [ solution ] |
LCSQ |
Finding a Shared Spliced Motif [ solution ] |
LEXV |
Ordering Strings of Varying Length Lexicographically [ solution ] |
MMCH |
Maximum Matchings and RNA Secondary Structures [ solution ] |
PDST |
Creating a Distance Matrix [ solution ] |
REAR |
Reversal Distance [ solution ] |
RSTR |
Matching Random Motifs [ solution ] |
SSET |
Counting Subsets [ solution ] |
ASPC |
Introduction to Alternative Splicing [ solution ] |
EDIT |
Edit Distance [ solution ] |
EVAL |
Expected Number of Restriction Sites [ solution ] |
MOTZ |
Motzkin Numbers and RNA Secondary Structures [ solution ] |
NWCK |
Distances in Trees [ solution ] |
SCSP |
Interleaving Two Motifs [ solution ] |
SETO |
Introduction to Set Operations [ solution ] |
SORT |
Sorting by Reversals [ solution ] |
SPEC |
Inferring Protein from Spectrum [ solution ] |
TRIE |
Introduction to Pattern Matching [ solution ] |
CONV |
Comparing Spectra with the Spectral Convolution [ solution ] |
CTBL |
Creating a Character Table [ solution ] |
DBRU |
Constructing a De Bruijn Graph [ solution ] |
EDTA |
Edit Distance Alignment [ solution ] |
FULL |
Inferring Peptide from Full Spectrum [ solution ] |
INDC |
Independent Segregation of Chromosomes [ solution ] |
ITWV |
Finding Disjoint Motifs in a Gene [ solution ] |
LREP |
Finding the Longest Multiple Repeat [ solution ] |
NKEW |
Newick Format with Edge Weights [ solution ] |
RNAS |
Wobble Bonding and RNA Secondary Structures [ solution ] |
AFRQ |
Counting Disease Carriers [ solution ] |
CSTR |
Creating a Character Table from Genetic Strings [ solution ] |
CTEA |
Counting Optimal Alignments [ solution ] |
CUNR |
Counting Unrooted Binary Trees [ solution ] |
GLOB |
Global Alignment with Scoring Matrix [ solution ] |
PCOV |
Genome Assembly with Perfect Coverage [ solution ] |
PRSM |
Matching a Spectrum to a Protein [ solution ] |
QRT |
Quartets [ solution ] |
SGRA |
Using the Spectrum Graph to Infer Peptides [ solution ] |
SUFF |
Encoding Suffix Trees [ solution ] |
CHBP |
Character-Based Phylogeny [ solution ] |
CNTQ |
Counting Quartets [ solution ] |
EUBT |
Enumerating Unrooted Binary Trees [ solution ] |
GASM |
Genome Assembly Using Reads [ solution ] |
GCON |
Global Alignment with Constant Gap Penalty [ solution ] |
LING |
Linguistic Complexity of a Genome [ solution ] |
LOCA |
Local Alignment with Scoring Matrix [ solution ] |
MEND |
Inferring Genotype from a Pedigree [ solution ] |
MGAP |
Maximizing the Gap Symbols of an Optimal Alignment [ solution ] |
MREP |
Identifying Maximal Repeats [ solution ] |
MULT |
Multiple Alignment [ solution ] |
PDPL |
Creating a Restriction Map [ solution ] |
ROOT |
Counting Rooted Binary Trees [ solution ] |
SEXL |
Sex-Linked Inheritance [ solution ] |
SPTD |
Phylogeny Comparison with Split Distance [ solution ] |
WFMD |
The Wright-Fisher Model of Genetic Drift [ solution ] |
ALPH |
Alignment-Based Phylogeny [ solution ] |
ASMQ |
Assessing Assembly Quality with N50 and N75 [ solution ] |
CSET |
Fixing an Inconsistent Character Set [ solution ] |
EBIN |
Wright-Fisher's Expected Behavior [ solution ] |
FOUN |
The Founder Effect and Genetic Drift [ solution ] |
GAFF |
Global Alignment with Scoring Matrix and Affine Gap Penalty [ solution ] |
GREP |
Genome Assembly with Perfect Coverage and Repeats [ solution ] |
OAP |
Overlap Alignment [ solution ] |
QRTD |
Quartet Distance [ solution ] |
SIMS |
Finding a Motif with Modifications [ solution ] |
SMGB |
Semiglobal Alignment [ solution ] |
KSIM |
Finding All Similar Motifs [ solution ] |
LAFF |
Local Alignment with Affine Gap Penalty [ solution ] |
OSYM |
Isolating Symbols in Alignments [ solution ] |
RSUB |
Identifying Reversing [ solution ] |