Genetics Question 4 Part B [20 marks] You will use a deBruijn graph to assemble the 10bp circular genome from which the...
Question 4 Part B [20 marks] deBruijn graph (7-mer) reads have been derived: You will use a to assemble the 10bp circular genome from which these short Reads GCAGGTA ТААССGC GTAACCG CCGCAGG AGGTAAC Break the reads into the 10 k-mers for k = 3 that you can obtain from these reads and write them out next to the reads in your book. [5 marks] ii. Draw a deBruijn graph using the k-mers as the edges to connect k - 1...
Bioinformatics Assemble the error-free reads from a circular genome on the following dataset. You do not need to consider the reverse complement of the reads. As the reads do not have the same length, convert the reads to 4-mers using the method proposed by Idury and Waterman. Build the de Bruijn graph B3 for the set of 4-mers. Find the genome using the graph. Dataset: CGTTCT CTAG GACGT TAGAC TCTA
Question 4 Part A [10 marks] A human genome has been re-sequenced using a sequencing technology that produces 100 bp reads of high quality data. The DNA was sheared to make a paired-end library with a size range of 1500 bp +- 500 bp and sequenced to generate paired-end reads. The analysis pipeline takes short-read sequence data and aligns it to a repeat-masked version of the reference human genome sequence assembly using BLASTN. This table summarizes the results from three...
Question 4. a.)Given the graph below from part 4.b. you are using the priority queue prims algorithm. Let the priority queue currently contains nodes A, B. What is the value of node you u=extract_min(Q). b.) Run 1 iteration of Prims while loop, showing the priority queue. 5 A E 1 10 7 2 B с D 3 4 c.) What if you read on the news prioriy queue was improved such that both update_key, and extract min became O(log?(n)) how...