le naive search function with two loc sing a for loop and a string comparison function. Please note that the write few lines. search all occurrences (seq, pattern): res [] for i in range( len (seq)-len (pattern)+1) : **"Write your code here""" return res

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
In the lecture we have implemented the naïve search function with two loops. Please re-implen
it using a for loop and a string comparison function. Please note that the result is same. And
may write few lines.
def search all occurrences (seq, pattern):
res
for i in range( len ((seq)-len (pattern)+1):
Write your code here"""
return res
input ("Input pattern: ")
pat 3=
print (pat,
print (search all occurrences (seq, pat) )
test pat search ()
(. 100uənbas gndur,) anduy- bas
oceurs in the following positions:",
Problem 2: (2
Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences o
size k (wherek should be passed as an argument to the function). The result should be a dictionary with
sub-sequences as keys, and their frequency as values. You should ușe Boyer-Moore algorithm in this
task. Apply it to cov19.txt and shothe result.
Examples:
test 'AAACCCATCGGGGGGG"
print(findRepeatDNA(3,test))
print(findRepeatDNA(4.test) )
AA
Transcribed Image Text:In the lecture we have implemented the naïve search function with two loops. Please re-implen it using a for loop and a string comparison function. Please note that the result is same. And may write few lines. def search all occurrences (seq, pattern): res for i in range( len ((seq)-len (pattern)+1): Write your code here""" return res input ("Input pattern: ") pat 3= print (pat, print (search all occurrences (seq, pat) ) test pat search () (. 100uənbas gndur,) anduy- bas oceurs in the following positions:", Problem 2: (2 Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences o size k (wherek should be passed as an argument to the function). The result should be a dictionary with sub-sequences as keys, and their frequency as values. You should ușe Boyer-Moore algorithm in this task. Apply it to cov19.txt and shothe result. Examples: test 'AAACCCATCGGGGGGG" print(findRepeatDNA(3,test)) print(findRepeatDNA(4.test) ) AA
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY