In the lecture we have implemented the naïve search function with two loops. Please re-implement it using a for loop and a string comparison function. Please note that the result is same. And you 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 def test pat_search (): seq = input ("Input sequence: ") pat = input ("Input pattern: ") print (pat, " occurs in the following positions:", ) print ( search_all_occurrences (seq, pat) ) test_pat_search () Problem 2: (25 s) Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences of size k (where k 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 use Boyer-Moore algorithm in this task. Apply it to cov19.txt and show the result. Examples: test = 'AAACCCATCGGGGGGG' print(findRepeatDNA(3,test) ) {'AAA': 1, 'cCC': 1, 'GGG': 5, 'TTT': 0} print(findRepeatDNA(4,test) ) {'AAAA': 0, 'CCCC': 0, 'GGGG': 4, 'TTTT': 0}
In the lecture we have implemented the naïve search function with two loops. Please re-implement it using a for loop and a string comparison function. Please note that the result is same. And you 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 def test pat_search (): seq = input ("Input sequence: ") pat = input ("Input pattern: ") print (pat, " occurs in the following positions:", ) print ( search_all_occurrences (seq, pat) ) test_pat_search () Problem 2: (25 s) Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences of size k (where k 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 use Boyer-Moore algorithm in this task. Apply it to cov19.txt and show the result. Examples: test = 'AAACCCATCGGGGGGG' print(findRepeatDNA(3,test) ) {'AAA': 1, 'cCC': 1, 'GGG': 5, 'TTT': 0} print(findRepeatDNA(4,test) ) {'AAAA': 0, 'CCCC': 0, 'GGGG': 4, 'TTTT': 0}
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...
Related questions
Question
100%
python
![In the lecture we have implemented the naïve search function with two loops. Please re-implement
it using a for loop and a string comparison function. Please note that the result is same. And you
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
def test_pat_search ():
seq = input ("Input sequence: ")
pat = input ("Input pattern: ")
print (pat, " occurs in the following positions:", )
print ( search_all_occurrences (seq, pat) )
test_pat_search ()
Problem 2: (25
ts)
Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences of
size k (where k 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 use Boyer-Moore algorithm in this
task. Apply it to cov19.txt and show the result.
Examples:
test = 'AAACCCATCGGGGGGG'
print(findRepeatDNA(3,test) )
{'AAA': 1, 'CCC': 1, ' GGG': 5, 'TTT': 0}
print(findRepeatDNA(4,test) )
{'AAAA': 0, 'CCCC': 0, 'GGGG': 4, 'TTTT': 0}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9a5549b9-96a9-486e-87ea-8db62d5d9072%2F1df84727-116a-4299-9a9f-c8c9603792ab%2Fzles1gj_processed.jpeg&w=3840&q=75)
Transcribed Image Text:In the lecture we have implemented the naïve search function with two loops. Please re-implement
it using a for loop and a string comparison function. Please note that the result is same. And you
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
def test_pat_search ():
seq = input ("Input sequence: ")
pat = input ("Input pattern: ")
print (pat, " occurs in the following positions:", )
print ( search_all_occurrences (seq, pat) )
test_pat_search ()
Problem 2: (25
ts)
Write a Python function that, given a DNA sequence, allows to detect if there are repeated sequences of
size k (where k 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 use Boyer-Moore algorithm in this
task. Apply it to cov19.txt and show the result.
Examples:
test = 'AAACCCATCGGGGGGG'
print(findRepeatDNA(3,test) )
{'AAA': 1, 'CCC': 1, ' GGG': 5, 'TTT': 0}
print(findRepeatDNA(4,test) )
{'AAAA': 0, 'CCCC': 0, 'GGGG': 4, 'TTTT': 0}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY