Rosalind
Solutions to the bioinformatics problems presented on Rosalind http://rosalind.info
| ID | Title | Notes |
|---|---|---|
| DNA | Counting DNA Nucleotides | |
| RNA | Transcribing DNA into RNA | |
| REVC | Complementing a Strand of DNA | |
| FIB | Rabbits and Recurrence Relations | |
| GC | Computing GC Content | |
| HAMM | Counting Point Mutations | |
| PROT | Translating RNA into Protein | |
| SUBS | Finding a Motif in DNA | Overlapping string search |
| CONS | Consensus and Profile | |
| GRPH | Overlap Graphs | Fun graph structures |
| ORF | Open Reading Frames | |
| PERM | Enumerating Gene Orders | Heap's algorithm for permutations |
| PRTM | Calculating Protein Mass | |
| IPRB | Mendel's First Law | |
| MPRT | Finding a Protein Motif | Implemented a backtracking DFA |
| REVP | Locating Restriction Sites | OCaml |
| SPLC | RNA Splicing | |
| PROB | Introduction to Random Strings | |
| KMP | Speeding Up Motif Finding | |
| FIBD | Mortal Fibonacci Rabbits | |
| LCSM | Finding a Shared Motif | |
| LEXF | Enumerating k-mers Lexicographically | |
| MRNA | Inferring mRNA from Protein | |
| LONG | Genome Assembly as Shortest Superstring | |
| PMCH | Perfect Matchings and RNA Secondary Structures | |
| SIGN | Enumerating Oriented Gene Orderings | |
| IEV | Calculating Expected Offspring | |
| LIA | Independent Alleles | |
| LGIS | Longest Increasing Subsequence | |
| PPER | Partial Permutations | |
| SSEQ | Finding a Spliced Motif | |
| TRAN | Transitions and Transversions | |
| TREE | Completing a Tree |