Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Write a program that determines the hamming distance of two DNA strands. Your program should do the following: 1. prompt the user for 2 DNA strands 2. Making use of problem 4, check if the strands are valid. If the inputted strands are of different lengths, this is considered invalid input. If one or both of the strands are invalid, the program ends. 3. Iterate over the two DNA strands and sum the number of differences. 4. Output the hamming distance   Example:

Write a program that determines the hamming distance of two DNA strands. Your program should do the following: 1. prompt the user for 2 DNA strands 2. Making use of problem 4, check if the strands are valid. If the inputted strands are of different lengths, this is considered invalid input. If one or both of the strands are invalid, the program ends. 3. Iterate over the two DNA strands and sum the number of differences. 4. Output the hamming distance   Example:

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
Write a program that determines the hamming distance of two DNA strands. Your program should do the following:
1. prompt the user for 2 DNA strands
2. Making use of problem 4, check if the strands are valid. If the inputted strands are of different lengths, this is considered invalid input. If one or both of the strands are invalid, the program ends.
3. Iterate over the two DNA strands and sum the number of differences.
4. Output the hamming distance
 
Example:
Enter a DNA strand: AATG
Enter a second DNA strand: AATC
The hamming distance of AATG and AATC is 1
Enter a DNA strand: AATG
Enter a second DNA strand: T
Invalid input
Enter a DNA strand: ABC
Enter a second DNA strand: AATG
Invalid input
Enter a DNA strand: AATG
Enter a second DNA strand: TTAC
The hamming distance of AATG and TTAC is 4
 
 
Note: the hamming distance is the number of differences / differing characters in two strings.
Examples:
● ‘AATG’ and ‘AATC’ have a hamming distance of 1 because only the last character of the two strands differs.
● ‘AATG’ and ‘ATAG’ have a hamming distance of 2.
● ‘AATG’ and ‘TTAC’ have a hamming distance of 4.
○ Note, here the hamming distance is the length, and the two strands are complements.
 
Challenge: try and minimize the number of loops used.
 
Expert Solution
steps

Step by step

Solved in 5 steps with 4 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