College level Python

Question

1. A pattern in a DNA sequence is defined using A, T, G, and, C repeatedly. Scientists often need to find the most recurring pattern of a specific length in the DNA sequence. I need to make a Python program that takes a DNA sequence and the pattern length as inputs. The program should then print the most frequent pattern(s) of the requested length. I need to use a Python dictionary to store the patterns and their count.

Answer 1

dnaStr = input("Input the DNA String :>")

dnaStrLen = len(dnaStr)

patternLength=0

while (int(patternLength)<2):

patternLength = input("Input the pattern length :>")

patterns = { }

i=0

while int(i)+int(patternLength) < int(dnaStrLen):

strSlice = dnaStr[i:i+int(patternLength)]

print("strSlice is " +str(strSlice))

keyPatterns = patterns.keys()

if strSlice in keyPatterns:

count = patterns[strSlice]

print(" count is " + str(count))

count = int(count)+1

patterns.update({strSlice:count})

else:

patterns.update({strSlice:"1"})

i = int(i)+1

print(patterns)

valuePatterns = patterns.values()

print(max(valuePatterns))

dictSortedPatterns = sorted(patterns.items(), key=lambda x: x[1],reverse=True)

print(dictSortedPatterns)