Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
DNA is sequence of bases A, G, T, C. Let DNA [ab] be the subsequence of DNA starting from index a finishing in b inclusive, and DNA[a.] be the subsequence of DNA starting from index a to the end. We could perform the following ops on DNAS: cross operation - they take DNA1 and DNA2 and numbers kl and k2. Then two new DNAS are created: DNA3 = DNA1[1,,k1]+DNA2[k2+1.] and DNA4 = DNA2[1.k2]+DNA1[k1+1.].mutate operation - they take a DNA, number k and one of the bases. Then they replace the base in position k in DNA with that base. also, they need to know certain characteristics of those DNAS. So, they can perform count operation - they take DNA and numbers k1 and k2 (k1 <= k2). This operation should return the number of A, G, T, C bases in DNA[k1,,k2].The initial DNAS are numbered from 1 to n, where n is the amount of those DNAS. The new DNAS the first line of input file contains number n - the number of initial DNAS. Each of the following n lines contains

DNA is sequence of bases A, G, T, C. Let DNA [ab] be the subsequence of DNA starting from index a finishing in b inclusive, and DNA[a.] be the subsequence of DNA starting from index a to the end. We could perform the following ops on DNAS: cross operation - they take DNA1 and DNA2 and numbers kl and k2. Then two new DNAS are created: DNA3 = DNA1[1,,k1]+DNA2[k2+1.] and DNA4 = DNA2[1.k2]+DNA1[k1+1.].mutate operation - they take a DNA, number k and one of the bases. Then they replace the base in position k in DNA with that base. also, they need to know certain characteristics of those DNAS. So, they can perform count operation - they take DNA and numbers k1 and k2 (k1 <= k2). This operation should return the number of A, G, T, C bases in DNA[k1,,k2].The initial DNAS are numbered from 1 to n, where n is the amount of those DNAS. The new DNAS the first line of input file contains number n - the number of initial DNAS. Each of the following n lines contains

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

Require the solution asap only do if you know the answers any error will get you downvoted for sure.

DNA is sequence of bases A, G, T, C. Let DNA [ab] be the subsequence of DNA starting from index a finishing in b inclusive, and DNA[a..] be the subsequence of DNA starting from index a to the end. We could perform the following ops on DNAS: cross operation - they take DNA1 and DNA2 and numbers kl and k2. Then two new DNAS are created: DNA3 = DNA1[1.,k1]+DNA2[k2+1..] and DNA4 = DNA2[1..k2]+DNA1[k1+1..].mutate operation – they take a DNA, number k and one of the bases. Then they replace the base in position k in DNA with that base. also, they need to know certain characteristics of those DNAS. So, they can perform count operation - they take DNA and numbers k1 and k2 (k1 <= k2). This operation should return the number of A, G, T, C bases in DNA[k1,k2].The initial DNAS are numbered from 1 ton, where n is the amount of those DNAS. The new DNAS the first line of input file contains number n- the number of initial DNAS. Each of the following n lines contains the description of each DNA. The next line contains number q- the number of operations to perform. The next q lines contain the description of each operation in the following form: CROSS id1 id2 k1 k2 MUTATE id k m COUNT id k1 k2 For each count operation print four integers: the number of each of the bases in the given subsequence of the given DNA. Use Python Only Input: 2 СТCGC TGCGG 5 MUTATE 1 2 A COUNT 224 MUTATE 2 1G CROSS 2115 COUNT 4 36 Output: 0201 0202
Transcribed Image Text:DNA is sequence of bases A, G, T, C. Let DNA [ab] be the subsequence of DNA starting from index a finishing in b inclusive, and DNA[a..] be the subsequence of DNA starting from index a to the end. We could perform the following ops on DNAS: cross operation - they take DNA1 and DNA2 and numbers kl and k2. Then two new DNAS are created: DNA3 = DNA1[1.,k1]+DNA2[k2+1..] and DNA4 = DNA2[1..k2]+DNA1[k1+1..].mutate operation – they take a DNA, number k and one of the bases. Then they replace the base in position k in DNA with that base. also, they need to know certain characteristics of those DNAS. So, they can perform count operation - they take DNA and numbers k1 and k2 (k1 <= k2). This operation should return the number of A, G, T, C bases in DNA[k1,k2].The initial DNAS are numbered from 1 ton, where n is the amount of those DNAS. The new DNAS the first line of input file contains number n- the number of initial DNAS. Each of the following n lines contains the description of each DNA. The next line contains number q- the number of operations to perform. The next q lines contain the description of each operation in the following form: CROSS id1 id2 k1 k2 MUTATE id k m COUNT id k1 k2 For each count operation print four integers: the number of each of the bases in the given subsequence of the given DNA. Use Python Only Input: 2 СТCGC TGCGG 5 MUTATE 1 2 A COUNT 224 MUTATE 2 1G CROSS 2115 COUNT 4 36 Output: 0201 0202
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS