DNA is sequence of bases A, G, T, C. Let DNA [a.b] 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 %3D 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 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
DNA is sequence of bases A, G, T, C. Let DNA [a.b] 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 %3D 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 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
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
![DNA is sequence of bases A, G, T, C. Let DNA [a..b] 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
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:
CTCGC
TGCGG
5
MUTATE 12 A
COUNT 224
MUTATE 21G
CROSS 2 115
COUNT 4 36
Output:
0201
0202](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0bd6a4ce-0d9f-42d4-b1dc-19330394d963%2F2947cf2e-d748-4630-b67b-cdaf6b250fa2%2F7m3oo4o_processed.png&w=3840&q=75)
Transcribed Image Text:DNA is sequence of bases A, G, T, C. Let DNA [a..b] 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
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:
CTCGC
TGCGG
5
MUTATE 12 A
COUNT 224
MUTATE 21G
CROSS 2 115
COUNT 4 36
Output:
0201
0202
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY