Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
DNA sequences are strings made of combinations of four letters: A, C, G, and T. A substring refers to a string that is a continuous segment of a larger string; in the context of DNA, this would be a fragment of our DNA sequence. Write a program that asks the user for two input strings: a complete DNA sequence a DNA fragment whose occurrence is to be found in our complete DNA sequence. The program must display the number of matches as the output. Make sure to validate that your sequence is a DNA sequence -- i.e., that it contains no letters aside from A, C, G, and T.

DNA sequences are strings made of combinations of four letters: A, C, G, and T. A substring refers to a string that is a continuous segment of a larger string; in the context of DNA, this would be a fragment of our DNA sequence. Write a program that asks the user for two input strings: a complete DNA sequence a DNA fragment whose occurrence is to be found in our complete DNA sequence. The program must display the number of matches as the output. Make sure to validate that your sequence is a DNA sequence -- i.e., that it contains no letters aside from A, C, G, and T.

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

DNA sequences are strings made of combinations of four letters: A, C, G, and T. A substring refers to a string that is a continuous segment of a larger string; in the context of DNA, this would be a fragment of our DNA sequence.

Write a program that asks the user for two input strings:

  1. a complete DNA sequence
  2. a DNA fragment whose occurrence is to be found in our complete DNA sequence.

The program must display the number of matches as the output. Make sure to validate that your sequence is a DNA sequence -- i.e., that it contains no letters aside from A, C, G, and T.

DNA sequences are strings made of combinations of four letters: A, C, G, and T. A substring refers to a string that is a continuous segment of a larger string; in the context of DNA, this would be a fragment of our DNA sequence. Write a program that asks the user for two input strings: 1. a complete DNA sequence 2. a DNA fragment whose occurrence is to be found in our complete DNA sequence. The program must display the number of matches as the output. Make sure to validate that your sequence is a DNA sequence -- i.e., that it contains no letters aside from A, C, G, and T. Sample run 1: Enter the DNA sequence: ACGTGCGT Enter the DNA fragment to be searched: GT Number of occurrences: 2 Sample run 2: Enter the search string: ACGTGCGT Enter the substring to be searched: AC Number of occurrences: 1 Sample run 3: Enter the search string: ACGTGUCGT This is not a valid DNA sequence.
Transcribed Image Text:DNA sequences are strings made of combinations of four letters: A, C, G, and T. A substring refers to a string that is a continuous segment of a larger string; in the context of DNA, this would be a fragment of our DNA sequence. Write a program that asks the user for two input strings: 1. a complete DNA sequence 2. a DNA fragment whose occurrence is to be found in our complete DNA sequence. The program must display the number of matches as the output. Make sure to validate that your sequence is a DNA sequence -- i.e., that it contains no letters aside from A, C, G, and T. Sample run 1: Enter the DNA sequence: ACGTGCGT Enter the DNA fragment to be searched: GT Number of occurrences: 2 Sample run 2: Enter the search string: ACGTGCGT Enter the substring to be searched: AC Number of occurrences: 1 Sample run 3: Enter the search string: ACGTGUCGT This is not a valid DNA sequence.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 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