- ba1a : Compute the Number of Times a Pattern Appears in a Text
- ba1b : Find the Most Frequent Words in a String
- ba1c : Find the Reverse Complement of a String
- ba1d : Find All Occurrences of a Pattern in a String
- ba1e : Find Patterns Forming Clumps in a String
- ba1f : Find a Position in a Genome Minimizing the Skew
- ba1g : Compute the Hamming Distance Between Two Strings
- ba1h : Find All Approximate Occurrences of a Pattern in a String
- ba1i : Find the Most Frequent Words with Mismatches in a String
- ba1k : Generate the Frequency Array of a String
rajan-sust / rosalind_golang Goto Github PK
View Code? Open in Web Editor NEWFastest implementation (in terms of time complexity) of the ROSALIND problems. Language: Golang.