Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Please help me solve this! Part 3 - Find best matching genome for a given sequence We have a random DNA sequence, and we want
Please help me solve this!
Part 3 - Find best matching genome for a given sequence We have a random DNA sequence, and we want to find the closest species to it. Is the DNA sequence more similar to human, mouse, or unknown? When could this kind of comparison be useful? Suppose that the emergency room of some hospital sees a sudden and drastic increase in patients presenting with a particular set of symptoms. Doctors determine the cause to be bacterial, but without knowing the specific species involved they are unable to treat patients effectively. One way of identifying the cause is to obtain a DNA sample and compare it against known bacterial genomes. With a set of similarity scores, doctors can then make more informed decisions regarding treatment, prevention, and tracking of the disease The goal of this part of the assignment is to write functions that can be useful to determine the identity of different species of bacteria, animals, etcBy simply using the similarity score routine you implemented you can compare an unknown sequence to different genomes and figure out the identity of the unknown sample float findBestMatch(string genome, string seq) The findBestMatch function should take two string arguments and return a floating point value of the highest similarity score found for the given sequence at any position within the genome. In other words, this function should traverse the entire genome and find the highest similarity score by using similarityScore() for the comparisons between seq and each sequential substring of genome hint: this function is very similar in structure to the countMatches function> int findBestGenome(string genome1, string genome2, string genome3, string seq) . The findBestGenome function should take four string arguments(unknown . Return an integer indicating which genome string, out of the 3 given, had the sequence, mouse_genome, human_genome and unknown_genome) highest similarity score with the given sequence For each genome, the function will find the highest similarity score of the sequence (at any position) within that genome (call function findBestMatch described above) . The return value from this function will indicate which genome had the best match, 1, 2, or 3. In the case that two or more of the sequences have the same best similarity score, return 0 COG will grade Part 3 based on both the value returned from findBestGenome and findBestMatch Note: DNA sequences for human, mouse and unknown genomes will be uploaded as a file on Moodle with this assignment for testing purposesStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started