Back
ExercisesComplete set

Exercises

Complete course materials for Bioinformatica e Genomica Funzionale in the Biomedical Engineering degree programme at Politecnico di Milano. The document covers: 1 2 %%%%%%%% LAB0 3 4 %%%%%%%% LAB1 5 6 %%%%%%%% LAB2 - filogenetica 7 8 %% ESERCIZIO 1 9 10 % Compute the probability of the tree depicted in figure as the sum of the probability of individual trees corresponding to possible reconstructions (mutually exclusive events). Assume

Bioinformatica e Genomica FunzionaleComplete set

Document information

What's included in this study material

Complete course materials for Bioinformatica e Genomica Funzionale in the Biomedical Engineering degree programme at Politecnico di Milano. The document covers: 1 2 %%%%%%%% LAB0 3 4 %%%%%%%% LAB1 5 6 %%%%%%%% LAB2 - filogenetica 7 8 %% ESERCIZIO 1 9 10 % Compute the probability of the tree depicted in figure as the sum of the probability of individual trees corresponding to possible reconstructions (mutually exclusive events). Assume

Import quality: text was extracted directly from the original document.

Extracted content from the document

Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.

Page 1

1 2 %%%%%%%% LAB0 3 4 %%%%%%%% LAB1 5 6 %%%%%%%% LAB2 - filogenetica 7 8 %% ESERCIZIO 1 9 10 % Compute the probability of the tree depicted in figure as the sum of the probability of individual trees corresponding to possible reconstructions (mutually exclusive events). Assume the following background frequencies and substitution model (contenuti nel file 'ex1.mat'): 11 12 % fb = [0.3 0.2 0.2 0.3] 13 14 % A C G T 15 % A | 0.4 0.2 0.2 0.2 | 16 % M = C | 0.2 0.4 0.2 0.2 | matrice con le probabilità di 17 % G | 0.2 0.2 0.4 0.2 | sostituzione delle diverse basi. 18 % T | 0.2 0.2 0.2 0.4 | 19 20 % dobbiamo far variare le basi nei nodi intermedi (chiamati i,j,k) e calcolare la probabilità di tutte le possibili combinazioni di basi. Poi sommiamo la probabilità delle singole combinazioni e otteniamo la probabilità complessiva per ottenere questo singolo albero. 21 22 load('ex1.mat') 23 24 P=0; 25 26 fori=1:4 % stiamo considerando tutte le possibili combinazioni di basi che portano al nostro albero finale CCAT 27 forj=1:4 28 fork=1:4 29 p=fb(i)*M(i,j)*M(j,2)*M(j,2)*M(i,k)*M(k,1)*M(k,4);%probabilità di una singola combinazione 30 % i nodo centrale 31 % j nodo sinistra che collega C e C 32 % k nodo destra che collega A e T 33 % M(j,2) indica ramo che collega j alla colonna 2 di M, ovvero base C nota 34 P=P+p; % sommiamo poichè sono eventi mutualmente esclusivi. 35 end 36 end 37 end 38 39 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 40 41 %% ESERCIZIO 2 - buiding a phylogenetic tree for the hominidae species 42 43 % The mitochondrial D-loop is one of the fastest mutating sequence regions in animal DNA, and therefore, is often used to compare closely related organism. 44 % 1) Given the pre-aligned sequences contained in primates.mat, compute pairwise…

Preview

First page of the document.

First page: Exercises