4. a. In molecular biology, DNAS and proteins can be represented as a sequence of alphabets. DNA sequences consist of A, T, G, C representing nucleobases adenine, thymine, guanine and cytosine. Proteins consist of 20 different letters indicating 20 different amino acids. Suppose you are going to be recruited as a research fellow in a Bio-informatics lab where the recruiters need to compare your DNA characteristics for some reasons with their most successful researcher's DNA. If they observe that highest nucleobase subsequence matching score is more than 5, primarily you will be considered as a valid candidate for their lab. Let's say the part of DNA Sequence of you and the researcher are AATTGCGG, and GACTTACGA respectively. Now your task is to find a suitable algorithm to help the recruiters to measure your eligibility, and do the necessary task to convey them the list of highest matched nucleobases. b. Which algorithm design technique you have followed to solve the described problem in (a)? Give some reasons. Also calculate the worst case complexity of your algorithm.

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

ans only b

4. a.
In molecular biology, DNAS and proteins can be represented as a sequence of alphabets. DNA
sequences consist of A, T, G, C representing nucleobases adenine, thymine, guanine and
cytosine. Proteins consist of 20 different letters indicating 20 different amino acids. Suppose you
are going to be recruited as a research fellow in a Bio-informatics lab where the recruiters need
to compare your DNA characteristics for some reasons with their most successful researcher's
DNA. If they observe that highest nucleobase subsequence matching score is more than 5,
primarily you will be considered as a valid candidate for their lab.
Let's say the part of DNA Sequence of you and the researcher are AATTGCGG, and
GACTTACGA respectively. Now your task is to find a suitable algorithm to help the recruiters
to measure your eligibility, and do the necessary task to convey them the list of highest matched
nucleobases.
b. Which algorithm design technique you have followed to solve the described problem in (a)?
Give some reasons. Also calculate the worst case complexity of your algorithm.
Transcribed Image Text:4. a. In molecular biology, DNAS and proteins can be represented as a sequence of alphabets. DNA sequences consist of A, T, G, C representing nucleobases adenine, thymine, guanine and cytosine. Proteins consist of 20 different letters indicating 20 different amino acids. Suppose you are going to be recruited as a research fellow in a Bio-informatics lab where the recruiters need to compare your DNA characteristics for some reasons with their most successful researcher's DNA. If they observe that highest nucleobase subsequence matching score is more than 5, primarily you will be considered as a valid candidate for their lab. Let's say the part of DNA Sequence of you and the researcher are AATTGCGG, and GACTTACGA respectively. Now your task is to find a suitable algorithm to help the recruiters to measure your eligibility, and do the necessary task to convey them the list of highest matched nucleobases. b. Which algorithm design technique you have followed to solve the described problem in (a)? Give some reasons. Also calculate the worst case complexity of your algorithm.
Expert Solution
steps

Step by step

Solved in 2 steps

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