tottaly new approach
version 1 of the algorithm, not sure if it works
added deduoe code
change fillPatterns from public to private
added main, input...
input in main solved
changed conuter to boolean
changed philosophy , now I look by dnas first if they cointain any of the kmers found (neighbourhood
partialy works
remove unneccesary fort
changed kmer relation
solution WORKING redone the code: first find starting pattern, then find neighbours, thne for each neighbour find his neighbours and check if they appear in all dnas