Download the exam by clicking HERE then save the file and sa…
Download the exam by clicking HERE then save the file and save it OFTEN to make sure you don’t lose your work! As a reminder, this is a closed-book, closed-note exam. All programs except for Word should be closed and your attention on your own screen and nowhere else. As I noted in class, any use of AI will be considered academic misconduct. I want YOUR thoughts and responses in YOUR words, not someone/something else’s. When you are finished, please take a minute or two to put a page break after each of your answers so that each question starts on a new page.
Read DetailsHere is a set of homologous sequences from three different p…
Here is a set of homologous sequences from three different primates for a gene responsible for the higher intelligence observed in primates. We are interested in understanding where transcription factors bind upstream of the gene so that we can attempt to modulate the expression of the gene in individuals with decreased cognition in a highly experimental treatment (i.e., this would never work in reality). We discussed several different approaches for finding motifs in sequences. The sequences are reprinted for each question that requires you to use the sequences. GTTCAG AATCAG TATTCG Use a GreedyMotif search to find motifs for these sequences. Assume you are looking for 4-mers and work your algorithms so there’s never a 4-mer with zero probability in your matrix. If there is a random component, make sure you clearly tell me what the “random” choice is and make sure that it is evident to me that you understand what random means in the context of the greedy motif search (i.e., if there is a random component, explain it to me in words and demonstrate its appropriate use). Make sure you report the score for each set of motifs. If you don’t provide sufficient detail for me to see that you understand what to do, giving you credit will be challenging. I prefer you insert boxes, etc. and type your answer so that it’s clearly legible. However, you may also choose to take a picture of your scratch paper at the very end of the exam and upload it to Canvas.
Read DetailsGiven the following set of paired kmers, reconstruct a genom…
Given the following set of paired kmers, reconstruct a genome using a de Bruijn graph. Show all your work, including your de Bruijn graph and the path you traveled in the graph. All nodes should be clearly labeled. Assume an insert size (the textbook called this d) of two and a kmer length of three. Assembling a genome from these reads is Even if correct, the assembled genome will not earn any points without the graph. You may complete this on your scratch paper and take a picture at the very end of your exam to upload here. (30 points) AAT ATT ATT TTC ATT TTC ATT TTG CAA GAT CAT CTT GAT ATT TCA GCT TCA TGA TGA CAT TTC TGC TTG TCA TTG TCA
Read DetailsAnalyze the code snippets below regarding the creation of a…
Analyze the code snippets below regarding the creation of a word cloud using Python (libraries: wordcloud, matplotlib.pyplot). Code Snippets: plt.imshow(word_cloud) plt.show() text = “””I like that George Mason offers an inclusive campus… [truncated text] …from in person to online.””” plt.axis(“off”) word_cloud.generate(text) word_cloud = WordCloud(random_state=433, background_color=”darkgreen”) Constraint: You must ensure the axis is turned off after the word cloud image is prepared for display, but before the final command to show the plot. Which of the following represents the correct execution sequence to generate the plot? WordCloud Output:
Read Details