Rosalind Solutions

This repository contains my solutions for the ROSALIND problems

Bioinformatics Textbook Track:

Chapter 1: Where in the genome does DNA replication begin?

• BA1A: Compute the Number of Times a Pattern Appears in a Text [info] [solution]
• BA1B: Find the Most Frequent Words in a String [info] [solution]
• BA1C: Find the Reverse Complement of a String [info] [solution]
• BA1D: Find All Occurrences of a Pattern in a String [info] [solution]
• BA1E: Find Patterns Forming Clumps in a String [info] [solution]
• BA1F: Find a Position in a Genome Minimizing the Skew [info] [solution]
• BA1G: Compute the Hamming Distance Between Two Strings [info] [solution]
• BA1H: Find All Approximate Occurrences of a Pattern in a String [info] [solution]
• BA1I: Find the Most Frequent Words with Mismatches in a String [info] [solution]
• BA1J: Find Frequent Words with Mismatches and Reverse Complements [info] [solution]
• BA1K: Generate the Frequency Array of a String [info] [solution]
• BA1L: Implement PatternToNumber [info] [solution]
• BA1M: Implement NumberToPattern [info] [solution]
• BA1N: Generate the d-Neighborhood of a String [info] [solution]

Chapter 2: Which DNA patterns play the role of molecular clocks?

• BA2A: Implement MotifEnumeration [info] [solution]
• BA2B: Find a Median String [info] [solution]
• BA2C: Find a Profile-most Probable k-mer in a String [info] [solution]
• BA2D: Implement GreedyMotifSearch [info] [solution]
• BA2E: Implement GreedyMotifSearch with Pseudocounts [info] [solution]
• BA2F: Implement RandomizedMotifSearch [info] [solution]
• BA2H: Implement Implement DistanceBetweenPatternAndStrings [info] [solution]