This is the third in a series of three blog posts describing our solution to a bioinformatics problem from Rosalind.info, Problem BA1(i) (Find most frequent words with mismatches in a string). To solve this problem and generate variations of a DNA string as required, we implemented a recursive backtracking method in the Go programming language.
- Part 1: Counting Variations
- Part 2: Generating Variations
- Part 3: Go Implementation of Recursive Backtracking (you are here)