BioInformatics/FrequentWordsProblem.ccp at master · dariacher/BioInformatics · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int patternCount(const string& pattern, const string& dna) {
    int count = 0;
    for (int i = 0; i < dna.size() - pattern.size(); i++) {
        if (dna.substr(i, pattern.size()) == pattern) {
            count++;
        }
    }

    return count;
}

int main() {

    int k;
    string dna;

    cin >> dna;
    cin >> k;

    vector<string> maxMers;
    vector<string> seen;
    int maxCount = -1;

    for (int i = 0; i < dna.size() - k; i++) {
        string kmer = dna.substr(i, k);
        if (find(seen.begin(), seen.end(), kmer) == seen.end()) {
            seen.push_back(kmer);
            int tmpCount = patternCount(kmer, dna);

            if (tmpCount > maxCount) {
                maxCount = tmpCount;
                maxMers.clear();
                maxMers.push_back(kmer);
            } else if (tmpCount == maxCount) {
                maxMers.push_back(kmer);
            }
        }
    }

    for (string kmer : maxMers) {
        cout << kmer << " ";
    }

    return 0;
}