Ltur 7 Phylognti Anlysis Aitionl Rfrn Molulr Evolution: A Phylognti Approh Rori D. M. Pg n Ewr C. Holms 1
Uss of Phylognti Anlysis Evolutionry trs Multipl squn lignmnt Evolutionry Prolms i) Th fossil ror suggsts tht morn mn ivrg from ps out 5- million yrs go. Morn Homo spins mrg twn 1,-, yrs go ii) DNA n squn lignmnt y Po support this. iii) Work s on mitohonril DNA y Wilson t l suggst th morn mn mrg only, yrs go with th ivrgn into iffrnt rs 5, yrs go 1. mitohonril DNA irulr. mtrnl inhritn 3. 1x fstr muttion rt thn nulr DNA
Algorithms Typs of Dt Distns Nuloti sits Tr-uiling Mtho Clustring Algorithm Optimlity Critrion UPGMA Nighor Joining Minimum Evolution Mximum Prsimony Mximum Liklihoo From Pg n Holms Molulr Evolution: A Phylognti Approh Prliminris Txon (tx plurl) or oprtion txon unit is ntity whos istn from othr ntitis n msurs (i spis, mino i squn, lngug, t.) Comprisons r m on msurmnts or ssumptions onrning rts of volutionry hng. This is omplit y k muttions, prlll muttions, n vritions in muttion rt. W will only onsir sustitutions. 3
Amino Ai Squns i) For xmpl, th mino i sustitution rt pr sit pr yr is 5.3 x 1-9 for guin pig ut only.33 x 1-9 for othr orgnisms. ii) Th volutionry tim is th vrg tim to prou on sustitution pr 1 mino is T u 1 = 1λ Amino Ai Squns Exmpl Thr r iffrns in squn of 1 mino is whn ompring lf n p histon H4. Sin plnts n nimls ivrg 1 illion yrs go, T u =.5 illion yrs 1 λ = 1T u 1 λ = 1T u 1-11 iii) proility of sustitution svrl wy to lult it. Th st wy is using th PAM mtris. 4
Nuloti Squns i) Diffrnt from mino i squns u to runny in th gnti o (i svrl oons n o for prtiulr mino i. ii) Most sustitutions in th 3 r position r synonomous (UC* is th RNA oing for srin th orrsponing DNA woul AG*). Sin volution shoul pn on funtion n this is onfrr y th mino i squn, it hs n suggst tht th molulr lok shoul s on th sustitution rt in th thir position of th oon. In ft, in th firinopptis, this is s high s th mino i sustitution rt. Nuloti Squns iii) In th finition of PAM mtris, on ssums isrt Mrkov Chin, with th PAM mtrix ing th trnsition mtrix for th Mrkov Chin. 5
Mrkov Chins Assum tht w hv pross tht hs isrt osrvl stts x 1, x,. Whn w monitor this ovr tim w gt squn of th stts oupi q 1, q,. whr q i = ny of x 1, x,. This squn is Mrkov Chin. Not tht whil thr n n infinit numr of stts, th Mrkov hin hs ountl numr of lmnts. Mrkov Chins Anothr proprty of Mrkov pross is tht history os not mttr. This mns tht th stt ssum t tim t+1 pns on th stt ssum on t (not on ny othr prvious stt). This is ll th Mrkov proprty. Lt X = {X n, n = 1,, } isrt tim rnom pross with stt sp S whos lmnts r s 1, s, X is Mrkov hin if for ny n, th proility tht X n+1 tks on ny vlu s k S is onitionl on th vlu of X n ut os not pn on th vlus of X n-1, X n-,. Th on-tim-stp trnsition proilitis p jk (n) = Pr{X n = s k X n-1 = s j } j,k=1,, n = 1,, Sin X is rnom vril ll th initil onition, p j () = Pr{X = s j } j=1,,
Mrkov Chins Trnsition mtrix put th p jk into mtrix P. A squn of mino is n thought of s Mrkov hin. Sttionry Mrkov pross th proilitis p jk (n) o not pn on n, tht is thy r onstnt. Anothr wy of sying this is n initil istriution π is si to sttionry if πp(t)=π. Irruil vry stt n rh from vry othr stt Applition of Mrkov prosss to volutionry mols i) Th PAM mtrix hs its sustitution proilitis trmin from losly rlt mino i squns, it ssums tht th sustitutions hv ourr through on pplition of th trnsition mtrix (i.. no multipl sustitutions n givn sit) n ssums tht volutionry istn rsults from rpt pplition of th sm PAM mtrix. ii) A ttr volutionry mol is n. (txt p 14-144) This rquirs th us of ontinuous Mrkov pross rthr thn isrt Mrkov hin. This still hs th Mrkov proprty. 7
Applition of Mrkov prosss to volutionry mols A tim homognous Mrkov pross for th stohsti funtion X(t) onsists of st of stts Q={1,,,n}, st of initil stt istriutions π=(π 1,,π n ), n trnsition proility funtions P(t)= ) p 1,,1 (t) p 1,n (t) ).... p n,1 (t) p n,n (t) Applition of Mrkov prosss to volutionry mols W n pply this to nuloti squns. Lt Q={1,,3,4} orrspon to {A,C,G,T}. P(t)= ) ) p 1,,1 (t) p 1,4 (t) ).... p n,4 (t) p 4,4 (t) P[A A,t] P[C A,t] P[G A,t] P[T A,t] ) P[A C,t] P[C C,t] P[G C,t] P[T C,t] P[A G,t] P[C G,t] P[G G,t] P[T G,t] P[A T,t] P[C T,t] P[G T,t] P[T T,t] 8
Juks-Cntor Mol A α G α α α α C α Trnsitions = Trnsvrsions T Rts of Nuli Ai Chng Th Juks Cntor mol ssums tht u 1 =u =u 3 =u 4 =, yiling th rt mtrix. Λ = ) -3α α α α α -3α α α α α -3α α α α α -3α) Thn p 1 =p =p 3 =p 4 = Us in Mimum Liklihoo Clultion 9
HKY Mol Purins A α G β β β β Pyrimiins C α T Trnsitions > Trnsvrsions α > β Dfinitions -tx ntitis whos istn from othr ntitis n msur -A irt grph G(V, E) onsists of st V of nos or vrtis n st E(V) of irt gs. Thn (i,j) E mns tht thr is irt g from i to j. -A grph is unirt if th g rltion is symmtri, tht is, (i,j) E iff (j,i) E. -A irt grph is onnt if thr is irt pth twn ny two nos. 1
Dfinitions -A irt grph is yli if it os not ontin yl. (i.. (i,j), (j,k), n (k,i) ll long to E. -A tr is unirt, onnt, yli grph. -A root tr hs strting no ll root. -Th prnt no is immitly for no on th pth from th root. -Th hil no is no tht is follows no. Dfinitions -An nstor is ny no tht m for no on th pth from root. -A lf or xtrnl no is no tht h no hilrn. -Non-lf nos r ll intrnl nos. -Th pth of tr is on lss thn th mximl numr of nos on pth from th root to lf. 11
Dfinitions -An orr tr is tr whr th hilrn of intrnl nos r numr. -A inry tr is tr whr h no hs t most two hilrn. Othrwis it is multifurting. Trs Qustion: Drw ll inry trs on 1,, n 3 tx. A phylognti tr on n tx is tr with lvs ll y 1,,n. 1
How o you tll if two trs r th sm? If you n onvrt on tr into nothr without rking ny rnhs thy r topologilly quivlnt. Phylognti Trs Phylognti trs or volutionry trs r inry trs tht sri th rltions twn spis. Trs onsist of nos or vrtis n tx or lvs. 13
Phylognti Trs To unrstn th t, w must unrstn som of th mthos hin phylognti trs or volutionry trs i) Clustring mthos ii) Mximum liklihoo mthos iii) Qurtt puzzling Wht o w o with phylognti trs? msuring volutionry hng on tr If th lvs of tr h signify squn, th sum of th wights of th gs givs th volutionry istn twn th two squns. molulr phylogntis Convrt informtion in squns into n volutionry tr for thos squns. 14
Clustr mthos vs. srh mthos Thr r two si mthos for onstruting trs. Clustr mthos us n lgorithm (st of stps) to gnrt tr. Ths mthos r vry sy to implmnt n hn n omputtionlly ffiint. Thy lso typilly prou singl tr. A ig isvntg to this mtho is tht it pns upon th orr in whih w squns to th tr. Hn, thr oul iffrnt tr tht xplins th t just s wll. Srh mthos us som sort of optimlity ritri to hoos mong th st of ll possil trs. Th optimlity ritri givs h tr sor tht is s on th omprison of th tr to t. Th vntg of srh mthos is tht thy us n xpliit funtion rlting th trs to th t (for xmpl, mol of how th squns volv). Th isvntg is tht thy r omputtionlly vry xpnsiv (NP omplt prolm). How o w ompr iffrnt tr mthos? Effiiny How fst is th mtho? powr How muh t os th mtho rquir? onsistny Will th tr onvrg on th right nswr giv nough t? roustnss Will minor violtions of th mtho s ssumptions rsult in poor stimts of phylogny? flsifiility Will th mtho tll us whn its ssumptions r violt? 15
How o ssign wights for th gs of our trs? Distn mthos first onvrt lign squns into pirwis istn mtrix thn input tht mtrix into tr uiling mtho. Th mjor ojtions to istn mthos r tht summrizing st of squns y istn t loss informtion n rnh lngths stimt y som istn mthos might not volutionrily trminl. Disrt mthos onsir h nuloti sit (of som funtion of h sit) irtly. Distn Mthos Two istn mthos r nighor joining n minimum volution. Minimum volution fins th tr tht minimizs th sum of th rnh lngths whr th lngths r lult from th pirwis istns twn th squns. Linr progrmming or lst squrs mthos n us to o this. Nighor joining is lustring mtho tht is omputtionlly fst n givs uniqu rsult. This n us somthing lik th four-point onition n lustrs th losst lmnts. 1
Disrt Mthos Th two mjor isrt mthos r mximum prsimony n mximum liklihoo. Both ths r srh mthos. i) With mximum prsimony w try to ronstrut th volution t prtiulr sit with th fwst possil volutionry hngs. Th vntgs of prsimony r tht it mks rltivly fw ssumptions out th volutionry pross, it hs n stui xtnsivly mthmtilly, n som vry powrful softwr implmnttions r vill. Th mjor isvntg to using prsimony is tht unr som mols of volution, it is inonsistnt, tht is if mor t is th wrong rsult might our. Disrt Mthos ii) Th mximum liklihoo pproh looks for th tr tht mks th t th most prol volutionry outom. This pproh rquirs xpliit mol of volution whih is oth strngth n wknss us th rsults pn on th mol us. This mtho n lso vry omputtionlly xpnsiv. 17
Typs of mtris For th four point onition or itiv mtri, givn th lvs i, j, k, n l (i,j) + (k,l) (i,k) + (j,l) = (i,l) + (j,k) For n ultrmtri mtri th ultrmtri or 3-point onition hols Tht is givn th lvs i, j, n k (i,j) (i,k) = (j,k) Ultrmtri trs Clustring mthos ttmpt to rpt lustr th t y grouping th losst lmnts togthr. Thy r us for phylogny n gn xprssion mirorry nlysis. Th pir group mtho (PGM) is thniqu whr th pirs r rptly mlgmt. Th unwight pir group mtho with rithmti mn (UPGMA) is us to lustr molulr t whr squn lignmnt istn twn squns hs n trmin in istn mtrix. 18
UPGMA Input n n x n istn mtrix D 1. Initiliz st C to onsist of n singlton lustrs. Initiliz ist(,) on C y fining for ll {i} n {j} in C ist({i},{j}) = D(i,j) 3. Rpt th following n-1 tims ) trmin pir, of lustrs in C suh tht ist (,) in miniml; fin min = ist(,) ) fin nw lustr = U ; fin C = C {,} U {} ) fin no with ll n ughtrs n, whr th hs istn min/ to its lvs ) fin for ll f in C with f iffrnt from ist(,f) = ist(f,) = [ist(,f) + ist(,f)]/ UPGMA Exmpl 3 3 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Ultrmtri Topology Distn Tl (i,j) (i,k) = (j,k) from Clot n Bkofn Computtionl Molulr Biology 19
Givn th istn tl 1 1 1 1 1 1 1 1 UPGMA Exmpl 1 1 1 1 1. W hv fiv singlton lustrs {}, {}, {}, {}, n {} from th st C = {,,,,}. Gt th istns from th istn tl (lft) 3. ) Fin th losst two lustrs, nmly, lustrs {} n {} with min = ) f = {,} n C= {,,,f} ) f is th root for n ) Dfin nw istn tl Rpt 3 Th ol istn tl UPGMA Exmpl Th nw istn tl f 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 f 1 1 1 1
f 1 1 UPGMA xmpl Tr formtion g f 3 3 + 3 1 1 h 3 g r h f 3 3 1 1 WPGMA Input n n x n istn mtrix D 1. Initiliz st C to onsist of n singlton lustrs. Initiliz ist(,) on C y fining for ll {i} n {j} in C ist({i},{j}) = D(i,j) 3. Rpt th following n-1 tims ) trmin pir, of lustrs in C suh tht ist (,) in miniml; fin min = ist(,) ) fin nw lustr = U ; fin C = C {,} U {} ) fin no with ll n ughtrs n, whr th hs istn min/ to its lvs ) fin for ll f in C with f iffrnt from ist(,f) = ist(f,) = [ ist(,f) + ist(,f)]/[ + ] 1
1 1 Frris Trnsform - Exmpl 1 8 8 1 Aitiv, non-ultrmtri topology 1 9 14 11 9 13 1 18 13 1 11 14 1 1 19 Distn Tl 11 18 11 19 (i,j) + (k,l) (i,k) + (j,l) = (i,l) + (j,k) from Clot n Bkofn Computtionl Molulr Biology Frris Trnsform - Exmpl 9.19.38.75.5 9 14 11 9 13 1 18 13 1 11 14 1 1 19 11 18 11 19 UPGMA inorrtly Distn Tl ronstrut topology from Clot n Bkofn Computtionl Molulr Biology
Frris Trnsform Somtims th t will stisfy n itiv mtri n not ultrmtri. This will yil tr with th inorrt topology if UPGMA or WPGMA is us. Th Frris Trnsform Distn Mtho onvrts th t for n itiv, non-ultrmtri mtri so tht it stisfis th ultrmtri. Thn UPGMA or WPGMA n us to yil tr with th orrt topology Frris Trnsform If w hv phylognti tr with root r n lvs (tx) 1,,n n i,j is th istn twn two nos, thn w hv th trnsform istn i, j r = whr 1 = n i, j n i= 1 i, r i, r j, r + r You must ssum root r. This n th lf tht is frthst from ll th othrs. Unfortuntly, pning on th root slt th mtho might not giv th right topology. 3
1 1 Frris Trnsform - Exmpl 1 8 8 1 Aitiv, non-ultrmtri topology Wht is th istn to th root? 1 9 14 11 9 13 1 18 13 1 11 14 1 1 19 Distn Tl 11 18 11 19 r 9 4 1 9 Frris Trnsform - Exmpl Originl Distn Tl with ssum root Trnsform Distn Tl 9 14 11 9 13 1 18 13 1 11 14 1 1 19 11 18 11 19 r 9 4 1 9. 7. 7. 7.. 7. 7. 7. 7. 7. 5.. 7. 7. 5.. 7. 7... i, j i, r j, r i, j = + r whr r = 7. 4
Frris Trnsform - Exmpl.5.5.5 3.1 3.1.. 3.1 Frris trnsform tr topology. 7. 7. 7.. 7. 7. 7. 7. 7. 5. 7. 5. 7... Distn Tl 7. 7... (i,j) + (k,l) (i,k) + (j,l) = (i,l) + (j,k) Frris Trnsform Pik s root Originl Distn Tl with ssum root Trnsform Distn Tl 9 14 11 9 13 1 18 13 1 11 14 1 1 19 11 18 11 19. 3. 13... 3. 13.. 3. 3. 13. 3. 13. 13. 13. 13... 3. 13. i, j i, r j, r i, j = + r whr r = 13. 5
Frris Trnsform Corrt Topology!.5 1..1.1 5. 1.1 1... 3. 13... 3. 13.. 3. 3. 13. 3. 13. 13. 13. 13... 3. 13. Frris trnsform tr topology Distn Tl (i,j) + (k,l) (i,k) + (j,l) = (i,l) + (j,k) Algorithms Typs of Dt Distns Nuloti sits Tr-uiling Mtho Clustring Algorithm Optimlity Critrion UPGMA Nighor Joining Minimum Evolution Mximum Prsimony Mximum Liklihoo From Pg n Holms Molulr Evolution: A Phylognti Approh
Phylogny: Distn Mthos Prsimony Mximum Liklihoo Look t hngs in h olumn of lignmnt Mtri to stimt Popultion Drift Computtionlly mor xpnsiv Nighor Joining Comins omputtionl sp with uniqunss of rsult Clustring mtho hn hs no optimlity ritri. Oftn us in onjuntion with Minimum Evolution to stimt th minimum volution tr 7
Nighor Joining n Minimum Evolution Comput th Nighor Joining Tr n s if ny lol rrrngmnt prous shortr tr. Not gurnt to giv th minimum volution tr. Nighor Joining Algorithm Rlt to lustr nlysis ut rmovs th ssumption of ultrmtri t Dos not ssum t oms los to fitting n itiv tr (n to us n pproprit mol of volution). Kps trk of nos on tr Consirs only losst pirs n not ll possil pirs in h stp of str omposition. 8
Nighor Joining FROM: http://www.ip.ul../~oppr/p rivt/nighor.html Author: Fr Oppros Suppos w hv th following tr: Sin B n D hv umult muttions t highr rt thn A. Th Thr-point ritrion is violt n th UPGMA mtho nnot us sin this woul group togthr A n C rthr thn A n B. In suh s th nighor-joining mtho is on of th rommn mthos. Nighor Joining Th rw t of th tr r rprsnt y th following istn mtrix: A B C D E B5 C 4 7 D 7 1 7 E 9 5 F8 11898 W hv in totl OTUs (N=). 9
Nighor Joining Stp 1: W lult th nt ivrgn r (i) for h OTU from ll othr OTUs r(a) = 5+4+7++8=3 r(b) = 4 r(c) = 3 r(d) = 38 r(e) = 34 r(f) = 44 Nighor Joining Stp : Now w lult nw istn mtrix using for h pir of OTUs th formul: M(I,j)=(i,j) - [r(i) + r(j)]/(n-) or in th s of th pir A,B: M(AB)=(AB) -[(r(a) + r(b)]/(n-) = -13 A B C D E B-13 C -11.5-11.5 D -1-1 -1.5 E -1-1 -1.5-13 F -1.5-1.5-11 -11.5-11.5 3
Nighor Joining Now w strt with str tr: A F B \ / \ / \ / / \ / \ / \ E C D Nighor Joining Stp 3: Now w hoos s nighors thos two OTUs for whih M ij is th smllst. Ths r A n B n D n E. Lt's tk A n B s nighors n w form nw no ll U. Now w lult th rnh lngth from th intrnl no U to th xtrnl OTUs A n B. S(AU) =(AB) / + [r(a)-r(b)] / (N-) = 1 S(BU) =(AB) -S(AU) = 4 31
Nighor Joining Stp 4: Now w fin nw istns from U to h othr trminl no: (CU) = (AC) + (BC) - (AB) / = 3 (DU) = (AD) + (BD) - (AB) / = (EU) = (AE) + (BE) - (AB) / = 5 (FU) = (AF) + (BF) - (AB) / = 7 n w rt nw mtrix: Nighor Joining UCDE C3 D7 E55 F7898 Th rsulting tr will th following: C D \ A \ / 1 / \ / \ 4 E \ F \ B N= N-1 = 5 Th ntir prour is rpt strting t stp 1 3
Qurtt Puzzling Qurtt puzzling is lss omputtionlly xpnsiv mtho thn mximum liklihoo to trmin th phylognti tr. Prour: n 1. Comput th 4 mximum liklihoo trs for ll possil qurtts. (Qurtt Puzzling stp) Comin th qurtt trs into n- txon tr tht tris to onform to ll th nighor rltions of ll th qurtt trs. 3. Rpt stps 1. n. mny tims n us th mjority onsnsus tr. Givn th originl tr topology for 5 tx Qurtt Puzzling Two possil qurtts 33
Qurtt Puzzling All 5 4 Possil qurtts N(,;,) N(,;,) N(,;,) N(,;,) N(,;,) Qurtt Puzzling Qurtt puzzling stp prour: 1. Tk on of th qurtt with th nighor rltion N(,;,). A pnlty of 1 to vry g suh tht th ition of th nw tx will yil th inorrt topology. 3. Rpt for ll th nighor rltions 4. Th rnh with th lowst wight is th rnh whr th tx show 34
35 Qurtt Puzzling Qurtt with nighor rltion N(,;,) Aing tx twn n Yils wrong topology! Qurtt Puzzling N(,;,) N(,;,) N(,;,) N(,;,) 1 1 3 3 3 1 1
Qurtt Puzzling Chos on qurtt tr. Pik th tx to Us ll nighor rltions (othr thn th on iing th qurtt tr us) to fin wights on rnhs A th tx to th rnh with th lowst pnlty. Minimum Evolution Givn n unroot mtri tr for n squns, thr r (n-3) rnhs h with rnh lngth i. Th sum of ths rnh lngths is th lngth L of th tr. Th minimum volution tr is th tr whih minimizs L 3
Minimum Evolution similr to prsimony But lngth oms from pirwis istns twn th squns (not from fit of nuloti sits) Us linr progrmming or lst squrs to fin optiml solution. Minimum Evolution 37
Phylogny: Chrtr Stt Mthos Prsimony Mxmum Liklihoo Look t hngs in h olumn of lignmnt Mtri to stimt Popultion Drift Computtionlly mor xpnsiv PHYLOGENY: Chrtr Stts Tx 1 Tx Tx 3 Tx 4 Tx 5 ATT-GCCATT ATG-GC-ATT ATC-TATCTT ATCAAATCTT ACT-G--ACC Informtiv hrtrs (olumns) Look t ll possil trs For h olumn, lult ost Minimum sor = st tr 38
Mximum Prsimony Tx 1 Tx Tx 3 Tx 4 Tx 5 ATT-GCCATT ATG-GC-ATT ATC-TATCTT ATCAAATCTT ACT-G--ACC Informtiv hrtrs Minimum numr of hngs Multipl sustitutions = homoplsy Mximum Prsimony Smllst numr of volutionry hngs First us on protin t (Ek & Dyhoff, 19) Appli to Nuloti t (Fith, 1977) Brut for srh of tr sp 39
Cost of Prsimony Tr 1 3 4 5 T G C C T 1 Tx 1 Tx Tx 3 Tx 4 Tx 5 G 1 C C ATT- GCCATT ATG-GC - ATT ATC- TAT CTT ATCAAAT CTT ACT- G - - ACC 1 T Chrtr y hrtr Column 3 Prsimony sor = ++3 Cost of Prsimony Tr 1 3 4 5 T-G G-G C-T CAA T-G 1 G-G 1 Tx 1 Tx Tx 3 Tx 4 Tx 5 C-G C-G ATT- GCCATT ATG-GC - ATT T-G ATC- TAT CTT ATCAAAT CTT ACT- G - - ACC Chrtr y hrtr Prsimony sor = ++3++ = 5 4
Tr Sp 4 3 1 5 Tx Orr 5 4 3 1 5 4 1 3 Topology Srh Tr Sp Exhustiv Srh (Brut For) Brnh n Boun (Effiint?) Huristi Mthos (Hill Climing) Gnti Algorithms (GAML) 41
Mximum Liklihoo Gol: Construt phylognti tr from DNA squns whos liklihoo is mximum. (Flsnstin 1981) Prour Strt with givn topology n us th mximum liklihoo mtho to optimiz rnh lngths Mk lol moifitions to th topology n r-optimiz th rnh lngths Nw tx r on y on, optimizing rnh lngths n topologis h tim Assums n volutionry pross tht is rvrsil Mrkov pross Vry omputtionlly xpnsiv to us Liklihoo of Tr W wnt to fin L(tr) = Pr[t tr] Givn th t 1 =CT, =CG n 3 =AT Consir th tr CT 1 4 3 CG AT W n lult th liklihoo of this tr if w fill in th intrnl nos 4
Liklihoo of Tr Sin this is Mrkov pross, w n onsir h sit sprtly from th othr whih rus th omplxity of th lultion. Exmpl 3 1 CA AC A C 1 1 4 AT = C A A T 3 4 3 4 CT CG C C T G tr 1 tr tr3 Pr[t tr 1] = Pr[t tr ] + Pr[t tr 3] Liklihoo of sit spifi tr W n lult from th trnsition mtrix n th istns on h rnh th proility of h hng. Th prout of ths multipli y th proility of th originl s givs th liklihoo of sit spifi tr. Sin thr r two unknown nos th oul sum of ll possil vlus for h (ACTG) givs th liklihoo for th originl tr. 43
Mximum Liklihoo Sttistil mol for hngs in nulotis Liklihoo tht tht hng ourr Muh mor omputtionl intnsiv thn prsimony Hypothsis Tsting Trnsitions/Trnsvrsions HKY (Kimur prmtr mol) Juks Cntor (1 prmtr) Mximum Liklihoo Tx 1 Tx Tx 3 Tx 4 Tx 5 ATT-GCCATT ATG-GC-ATT ATC-TATCTT ATCAAATCTT ACT-G--ACC Sttistil mol for hngs in nulotis Trnsitions/Trnsvrsions HKY (Kimur prmtr mol) Juks Cntor (1 prmtr) Liklihoo tht tht hng ourr Muh mor omputtionl intnsiv thn prsimony 44
Liklihoo of Tr L(tr) = Pr [t tr] Multiply liklihoo for h hrtr position Rursiv finition of Liklihoo Svs omputtionl tim Liklihoo of Tr L(tr) = Pr [t tr] Multiply liklihoo for h hrtr position Rursiv finition of Liklihoo 45
Liklihoo of Tr 5 5 1 3 4 1 3 4 4