Genome Rearrangements:
|
|
- Theresa Gibson
- 5 years ago
- Views:
Transcription
1 Genome Rerrngements: from Biologicl Prolem to Comintoril Algorithms (nd ck) Pvel Pevzner Deprtment of Computer Science, University of Cliforni t Sn Diego
2 Genome Rerrngements Mouse X chromosome Unknown ncestor ~ 80 M yers go Humn X chromosome ü Wht is the evolutionry scenrio for trnsforming one genome into the other? ü Wht is the orgniztion of the ncestrl genome? ü Are there ny rerrngement hotspots in mmmlin genomes?
3 Genome Rerrngements: Evolutionry Scenrios Unknown ncestor ~ 80 M yers go ü Wht is the evolutionry scenrio for trnsforming one genome into the other? ü Wht is the orgniztion of the ncestrl genome? ü Are there ny rerrngement hotspots in mmmlin genomes? Reversl flips segment of chromosome
4 Genome Rerrngements: Ancestrl Reconstruction ü Wht is the evolutionry scenrio for trnsforming one genome into the other? ü Wht is the orgniztion of the ncestrl genome? ü Are there ny rerrngement hotspots in mmmlin genomes? Bourque, Tesler, PP, Genome Res.
5 Genome Rerrngements: Evolutionry Erthqukes ü Wht is the evolutionry scenrio for trnsforming one genome into the other? ü Wht is the orgniztion of the ncestrl genome? ü Are there ny rerrngement hotspots in mmmlin genomes?
6 Rerrngement Hotspots in Tumor Genomes ü Rerrngements my disrupt genes nd lter gene regultion. ü Exmple: rerrngement in leukemi yields Phildelphi chromosome: Chr 9 Chr 22 promoter ABL gene promoter BCR gene promoter BCR gene promoter c-1 oncogene ü Thousnds of rerrngements hotspots known for different tumors.
7 Rerrngement Hotspots in Tumor Genomes MCF7 rest cncer cell line ü Wht is the evolutionry scenrio for trnsforming one genome into the other? ü Wht is the orgniztion of the ncestrl genome? ü Where re the rerrngement hotspots in mmmlin genomes?
8 Controversy: Evolution vs. Intelligent Design
9 Three Evolutionry Controversies Primte - Rodent - Crnivore Split Rerrngement Hotspots Whole Genome Duplictions
10 Primte Rodent Crnivore Split rodent-crnivore split primte-crnivore split Primte - Rodent - Crnivore Split primte-rodent split
11 Primte Rodent Crnivore Split (who is closer to us: mouse or dog?) rodent-crnivore split primte-crnivore split Primte - Rodent - Crnivore Split primte-rodent split
12 Primte Rodent vs. Primte Crnivore Split Hutley et l., MBE, My 07: We hve demonstrted with very high confidence tht the rodents diverged efore crnivores nd primtes Lunter, PLOS CB, April 07: It ppers unjustified to continue to consider the phylogeny of primtes, rodents, nd cnines s contentious primte-rodent split primte-crnivore split Arnson et l, PNAS 02 Cnrozzi, PLOS CB 06 Murphy et l,, Science 01 Kumr&Hedges, Nture, 98
13 Reconstruction of Ancestrl Genomes: Humn / Mouse / Rt
14 Cn Rerrngement Anlysis Resolve the Primte Rodent Crnivore Controversy?
15 Susumu Ohno: Two Hypothesis Ohno, 1970, 1973 Rerrngement Hotspots Whole Genome Duplictions ü Rndom Brekge Hypothesis: Genomic rchitectures re shped y rerrngements tht occur rndomly (no frgile regions). ü Whole Genome Dupliction (WGD) Hypothesis: Big leps in evolution would hve een impossile without whole genome duplictions.
16 Rndom Brekge Model (RBM) Rerrngement Hotspots ü The rndom rekge hypothesis ws emrced y iologists nd hs ecome de fcto theory of chromosome evolution. ü Ndeu & Tylor, Proc. Nt'l Acd. Sciences 1984 ü ü ü First convincing rguments in fvor of the Rndom Brekge Model (RBM) RBM implies tht there is no rerrngement hotspots RBM ws re-iterted in hundreds of ppers
17 Rndom Brekge Model (RBM) Rerrngement Hotspots ü The rndom rekge hypothesis ws emrced y iologists nd hs ecome de fcto theory of chromosome evolution. ü Ndeu & Tylor, Proc. Nt'l Acd. Sci ü ü ü First convincing rguments in fvor of the Rndom Brekge Model (RBM) RBM implies tht there is no rerrngement hotspots RBM ws re-iterted in hundreds of ppers ü PP & Tesler, Proc. Nt'l Acd. Sci ü ü ü Rejected RBM nd proposed the Frgile Brekge Model (FBM) Postulted existence of rerrngement hotspots nd vst rekpoint re-use FBM implies tht the humn genome is mosic of solid nd frgile regions.
18 Are the Rerrngement Hotspots Rel? üthe Frgile Brekge Model did not live long: in 2003 Dvid Snkoff presented convincing rguments ginst FBM: we hve shown tht rekpoint re-use of the sme mgnitude s found in Pevzner nd Tesler, 2003 my very well e rtifcts in context where NO re-use ctully occurred.
19 Are the Rerrngement Hotspots Rel? üthe Frgile Brekge Model did not live long: in 2003 Dvid Snkoff presented rguments ginst FBM (Snkoff & Trinh, J. Comp. Biol, 2005) we hve shown tht rekpoint re-use of the sme mgnitude s found in Pevzner nd Tesler, 2003 my very well e rtifcts in context where NO re-use ctully occurred. Before you criticize people, you should wlk mile in their shoes. Tht wy, when you criticize them, you re mile wy. And you hve their shoes. J.K. Lmert
20 Reuttl of the Reuttl of the Reuttl n Peng et l., 2006 (PLOS Computtionl Biology) found n error in Snkoff-Trinh reuttl: If Snkoff & Trinh fixed their ST-Synteny lgorithm, they would confirm rther thn reject Pevzner-Tesler s Frgile Brekge Model n Snkoff, 2006 (PLOS Computtionl Biology): Not only did we foist hstily conceived nd incorrectly executed simultion on n overworked RECOMB conference progrm committee, ut worse nostr mxim culp we oliged tem of high-powered reserchers to clen up fter us!
21 Controversy continues n Rndom Brekge Model controversy: While Snkoff cknowledged the flw in his rguments ginst RBM, he ppers reluctnt to cknowledge the reuttl of RBM, this time rguing tht more complex rerrngement events (e.g., trnspositions) my crete n ppernce of rekpoint re-use. ü Most recent studies support the Frgile Brekge Model: vn der Wind, 2004, Biley, 2004, Zho et l., 2004, Murphy et l., 2005, Hinsch & Hnnenhlli, 2006, Ruiz-Herrer et l., 2006, Yue & Hf, 2006, Mehn et l., 2007, etc Kikut et l., Genome Res. 2007:... the Ndeu nd Tylor hypothesis is not possile for the explntion of synteny in rt.
22 Reuttl of the Reuttl of the Reuttl: Controversy Resolved... Or Ws It? ü Nerly ll recent studies support the Frgile Brekge Model: vn der Wind, 2004, Biley, 2004, Zho et l., 2004, Murphy et l., 2005, Hinsch & Hnnenhlli, 2006, Ruiz-Herrer et l., 2006, Yue & Hf, 2006, Mehn et l., 2007, etc Kikut et l., Genome Res. 2007:... the Ndeu nd Tylor hypothesis is not possile for the explntion of synteny
23 Rndom vs. Frgile Brekge Dete Continues: Complex Rerrngements ü PP & Tesler, PNAS 2003, rgued tht every evolutionry scenrio for trnsforming Mouse into Humn genome with reversls, trnsloctions, fusions, nd fissions must result in lrge numer of rekpoint re-uses, contrdiction to the RBM. ü Snkoff, PLoS Comp. Biol. 2006: We cnnot infer whether mutully rndomized synteny lock orderings derived from two divergent genomes were creted... through processes other thn reversls nd trnsloctions.
24 Whole Genome Dupliction (WGD) Whole Genome Duplictions
25 Genome Rerrngements After WGD
26 Genome Rerrngements After WGD
27 Genome Rerrngements After WGD
28 Whole Genome Dupliction Hypothesis Ws Confirmed After Yers of Controversy üthe Whole Genome Dupliction hypothesis first met with skepticism ut ws finlly confirmed y Kellis et l., Nture 2004: Our nlysis resolves the longstnding controversy on the ncestry of the yest genome. n There ws whole-genome dupliction. Wolfe, Nture, 1997 n There ws no whole-genome dupliction. Dujon, FEBS, 2000 n Duplictions occurred independently Lngkjer, JMB, 2000 n Continuous duplictions Dujon, Yest 2003 n Multiple duplictions Friedmn, Gen. Res, 2003 n Spontneous duplictions Koszul, EMBO, 2004
29 Whole Genome Dupliction Hypothesis Ws Eventully Confirmed...But Some Scientists Are Not Convinced ü Kellis, Birren & Lnder, Nture 2004: Our nlysis resolves the longstnding controversy on the ncestry of the yest genome. ü Mrtin et l., Biology Direct 2007: We elieve tht the proposl of Whole Genome Dupliction in the yest linege is unwrrnted. ü To ddress Mrtin et l., 2007 rguments ginst WGD, it would e useful to reconstruct the preduplicted genomes. n There ws whole-genome dupliction. Wolfe, Nture, 1997 n There ws no whole-genome dupliction. Dujon, FEBS, 2000 n Duplictions occurred independently Lngkjer, JMB, 2000 n Continuous duplictions Dujon, Yest 2003 n Multiple duplictions Friedmn, Gen. Res, 2003 n Spontneous duplictions Koszul, EMBO, 2004 n Our nlysis resolved the controversy Kellis, Nture, 2004 n WGD in the yest linege is unwrrnted Mrtin, Biology Direct, 2007 n...
30 Genome Hlving Prolem Reconstruction of the pre-duplicted ncestor: Genome Hlving Prolem
31 From Biologicl Controversies to Algorithmic Prolems Primte - Rodent - Crnivore Split Ancestrl Genome Reconstruction Rerrngement Hotspots Brekpoint Re-use Anlysis Whole Genome Duplictions Genome Hlving Prolem
32 Algorithmic Bckground: Genome Rerrngements nd Brekpoint Grphs
33 Unichromosoml Genomes: Reversl Distnce Sorting y reversls: find the shortest series of reversls trnsforming one uni-chromosoml genome into nother. The numer of reversls in such shortest series is the reversl distnce etween genomes. Hnnenhlli nd PP. (FOCS 1995) gve polynomil lgorithm for computing the reversl distnce.. Step 0: Step 1: Step 2: Step 3: Step 4: Sorting y prefix reversls (pncke flipping prolem), Gtes nd Ppdimitriou, Discrete Appl. Mth. 1976
34 Sorting y reversls Most prsimonious scenrios Step 0: Step 1: Step 2: Step 3: Step 4: The reversl distnce is the minimum numer of reversls required to trnsform one gene order into nother. Here, the distnce is 4.
35 Multichromosoml Genomes: Genomic Distnce ü Genomic Distnce etween two genomes is the minimum numer of reversls, trnsloctions, fusions, nd fissions required to trnsform one genome into nother. ü Hnnenhlli nd PP (STOC 1995) gve polynomil lgorithm for computing the genomic distnce. ü These lgorithms were followed y mny improvements: Kpln et l. 1999, Bder et l. 2001, Tesler 2002, Ozery-Flto & Shmir 2003, Tnnier & Sgot 2004, Bergeron , etc.
36 HP Theory Is Rther Complicted: Is There Simpler Alterntive? ü HP theory is key tool in most genome rerrngement studies. However, it is rther complicted mking it difficult to pply it in complex setups such s the RBM vs. FBM or WGD controversies. ü To study the outlined evolutionry controversies, we use n lterntive (simpler) pproch clled k-rek nlysis
37 Simplifying HP Theory: from Liner to Circulr Chromosomes d c A chromosome is represented s cycle with directed red nd undirected lck edges: c d red edges encode locks (genes) lck edges connect djcent locks
38 Reversls on Circulr Chromosomes c reversl c d d c d d c A reversl replces two lck edges with two other lck edges
39 Fissions c fission c d d c d c d ü A fission splits single cycle (chromosome) into two. ü A fissions replces two lck edges with two other lck edges.
40 Trnsloctions / Fusions c fusion c d d c d c d ü A trnsloction/fusion merges two cycles (chromosomes) into single one. ü They lso replce two lck edges with two other lck edges.
41 2-Breks c 2-rek c d d ü A 2-Brek replces ny 2 lck edges with nother 2 lck edges forming mtching on the sme 4 vertices. ü Reversls, trnsloctions, fusions, nd fissions represent ll possile types of 2-reks (introduced s DCJ opertions y Yncopoulos et l., 2005)
42 2-Brek Distnce ü The 2-rek distnce d 2 (P,Q) is the minimum numer of 2-reks required to trnsform P into Q. ü In contrst to the genomic distnce, the 2-rek distnce is esy to compute.
43 Two Genomes s Blck-Red nd Green-Red Cycles P c c d d c Q c d d
44 Q-style representtion of P P d c c c Q d d
45 Q-style representtion of P P d c c c Q d d
46 Brekpoint Grph: Superposition of Genome Grphs Brekpoint Grph P d c c (Bfn & PP, FOCS 1994) c G(P,Q) Q d d
47 Brekpoint Grph: GLUING Red Edges with the Sme Lels Brekpoint Grph P d c c (Bfn & PP, FOCS 1994) c G(P,Q) Q d d
48 Blck-Green Alternting Cycles ü Blck nd green edges form perfect mtchings in the rekpoint grph. Therefore, these edges form collection of lck-green lternting cycles ü Let cycles(p,q) e the numer of lck-green cycles. c d cycles(p,q)=2
49 Rerrngements Chnge Brekpoint Grphs nd cycle(p,q) Trnsforming genome P into genome Q y 2-reks corresponds to trnsforming the rekpoint grph G(P,Q) into the identity rekpoint grph G(Q,Q). c G(P,Q) d cycles(p,q) = 2 c c G(Q,Q) G(P',Q) trivil cycles d d cycles(p',q) = 3 cycles(q,q) = 4 =#locks
50 Sorting y 2-Breks 2-reks P=P 0 P 1... P d = Q G(P,Q) G(P 1,Q)... G(Q,Q) cycles(p,q) cycles... #locks cycles # of lck-green cycles incresed y #locks - cycles(p,q) How much ech 2-rek cn contriute to the increse in the numer of cycles?
51 Ech 2-Brek Increses #Cycles y t Most 1 A 2-rek: ü dds 2 new lck edges nd thus cretes t most 2 new cycles (contining two new lck edges) ü removes 2 lck edges nd thus destroys t lest 1 old cycle (contining two old edges): chnge in the numer of cycles: Δcycles 2-1=1.
52 2-Brek Distnce ü Any 2-rek increses the numer of cycles y t most one (Δcycles 1) ü Any non-trivil cycle cn e split into two cycles with 2- rek (Δcycles = 1) ü Every sorting y 2-reks must increse the numer of cycles y #locks - cycles(p,q) ü The 2-rek distnce etween genomes P ndq: d 2 (P,Q) = #locks - cycles(p,q) (cp. Yncopoulos et l., 2005, Bergeron et l., 2006)
53 Complex Rerrngements: Trnspositions ü Sorting y Trnspositions Prolem: find the shortest sequence of trnspositions trnsforming one genome into nother. ü First 1.5-pproximtion lgorithm ws given y Bfn nd P.P. SODA The est known result: pproximtion lgorithm of Elis nd Hrtmn, ü The complexity sttus remins unknown.
54 Trnspositions c trnsposition c d c d c d d Trnspositions cut off segment of one chromosome nd insert it t some position in the sme or nother chromosome
55 Trnspositions Are 3-Breks c 3-rek c d d ü 3-Brek replces ny triple of lck edges with nother triple forming mtching on the sme 6 vertices. ü Trnspositions re 3-Breks.
56 Sorting y 3-Breks 3-reks P=P 0 P 1... P d = Q G(P,Q) G(P 1,Q)... G(Q,Q) cycles(p,q) cycles... #locks cycles # of lck-green cycles incresed y #locks - cycles(p,q) How much ech 3-rek cn contriute to this increse?
57 Ech 3-Brek Increses #Cycles y t Most 2 A 3-Brek: ü dds 3 new lck edges nd thus cretes t most 3 new cycles (contining three new lck edges) ü removes 3 lck edges nd thus destroys t lest 1 old cycle (contining three old edges): chnge in the numer of cycles: Δcycle 3-1=2.
58 3-Brek Distnce ü Any 3-rek increses the numer of cycles y t most TWO (Δcycles 2) ü Any non-trivil cycle cn e split into three cycles with 3-rek (Δcycles = 2) ü Every sorting y 3-reks must increse the numer of cycles y #locks - cycles(p,q) ü The 3-rek distnce etween genomes P nd Q: d 3 (P,Q) = (#locks - cycles(p,q))/2
59 3-Brek Distnce ü Any 3-rek increses the numer of cycles y t most TWO (Δcycles 2) ü Any non-trivil cycle cn e split into three cycles with 3-rek (Δcycles = 2) WRONG STATEMENT ü Every sorting y 3-reks must increse the numer of cycles y #locks - cycles(p,q) ü The 3-rek distnce etween genomes P nd Q: d 3 (P,Q) = (#locks - cycles(p,q))/2
60 3-Brek Distnce: Focus on Odd Cycles ü A 3-rek cn increse the numer of odd cycles (i.e., cycles with odd numer of lck edges) y t most 2 (Δcycles odd 2) ü A non-trivil odd cycle cn e split into three odd cycles with 3-rek (Δcycles odd = 2) ü An even cycle cn e split into two odd cycles with 3- rek (Δcycles odd =2) ü The 3-Brek Distnce etween genomes P ndq is: d 3 (P,Q) = ( #locks cycles odd (P,Q) ) / 2
61 Multi-Brek Rerrngements ü k-brek rerrngement opertion mkes k reks in genome nd glues the resulting pieces in new order. ü Rerrngements re rre evolutionry events nd iologists elieve tht k-rek rerrngements re unlikely for k>3 nd reltively rre for k=3 (t lest in the mmmlin evolution). ü Also, in rdition iology, chromosome errtions for k>2 (indictive of chromosome dmge rther thn evolutionry vile vritions) re more common, e.g., complex rerrngements in irrdited humn lymphocytes (Schs et l., 2004; Levy et l., 2004).
62 Polynomil Algorithm for Multi-Brek Rerrngements ü The formuls for k-rek distnce ecome complex s k grows (without n ovious pttern): The formul for d 20 (P,Q) contins over 1,500 terms! Alekseyev & PP (SODA 07, Theoreticl Computer Science 08) Exct formuls for the k-rek distnce s well s liner-time lgorithm for computing it.
63 Where Do We Go From Here? Ancestrl Genome Reconstruction Brekpoint Re-use Anlysis Skip Genome Hlving Prolem
64 Brekpoint Re-use Anlysis Algorithmic Prolem Serching for Rerrngement Hotspots (Frgile Regions) in Humn Genome
65 Rndom vs. Frgile Brekge Dete: Complex Rerrngements ü PP & Tesler, PNAS 2003, rgued tht every evolutionry scenrio for trnsforming Mouse into Humn genome with reversls nd trnsloctions must result in lrge numer of rekpoint re-uses, contrdiction to the RBM. ü Snkoff, PLoS CB 2006: We cnnot infer whether mutully rndomized synteny lock orderings derived from two divergent genomes were creted... through processes other thn reversls nd trnsloctions. (red: trnspositions or 3-reks)
66 Rndom Brekge Theory Re-Re-Re-Re-Re-Visited n Ohno, 1970, Ndeu & Tylor, 1984 introduced RBM n Pevzner & Tesler, 2003 (PNAS) rgued ginst RBM n Snkoff & Trinh, 2004 (RECOMB, JCB) rgued ginst Pevzner & Tesler, 2003 rguments ginst RBM n Peng et l., 2006 (PLOS CB) rgued ginst Snkoff & Trinh, 2004 rguments ginst Pevzner & Tesler, 2003 rguments ginst RBM n Snkoff, 2006 (PLOS CB) cknowledged n error in Snkoff&Trinh, 2004 ut cme up with new rgument ginst Pevzner nd Tesler, 2003 rguments ginst RBM n Alekseyev nd Pevzner, 2007 (PLOS CB) rgued ginst Snkoff, 2006 new rgument ginst Pevzner & Tesler, 2003 rguments ginst RBM
67 Rndom Brekge Theory Re-Re-Re-Re-Re-Visited n Ohno, 1970, Ndeu & Tylor, 1984 introduced RBM n Pevzner & Tesler, PNAS 2003 rgued ginst RBM n Snkoff & Trinh, JCB 2004 rgued ginst Pevzner & Tesler, 2003 rguments ginst RBM n Peng et l., PLOS CB 2006 rgued ginst Snkoff & Trinh, 2004 rguments ginst Pevzner & Tesler, 2003 rguments ginst RBM n Snkoff, PLOS CB 2006 cknowledged n error in Snkoff&Trinh, 2004 ut cme up with new rgument ginst Pevzner nd Tesler, 2003 rguments ginst RBM n Alekseyev nd Pevzner, PLOS CB 2007 rgued ginst Snkoff, 2006 new rgument ginst Pevzner & Tesler, 2003 rguments ginst RBM
68 Are There Rerrngement Hotspots in Humn Genome?
69 Are There Rerrngement Hotspots Theorem. Yes in Humn Genome?
70 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for the 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions)
71 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every 3-rek cretes up to 3 rekpoints
72 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every 3-rek cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we my see 139*3=417 rekpoints
73 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every rerrngement cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we my see 139*3=417 rekpoints But there re only 281 rekpoints etween Humn nd Mouse!
74 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every rerrngement cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we my see 139*3=417 rekpoints But there re only 281 rekpoints etween Humn nd Mouse Is 417 lrger thn 281?
75 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every rerrngement cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we my see 139*3=417 rekpoints But there re only 281 rekpoints etween Humn nd Mouse Is 417 lrger thn 281? Yes, 417 >> 281!
76 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every rerrngement cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we my see 139*3=417 rekpoints But there re only 281 rekpoints etween Humn nd Mouse Is 417 lrger thn 281? Yes, 417 >> 281!
77 Trnsforming Humn Genome into Mouse Genome y 3-Breks 3-reks Humn = P 0 P 1... P d = Mouse d = d 3 (Humn,Mouse) = 139 üour proof ssumed tht ech 3-rek mkes 3 rekges in genome, so the totl numer of rekges mde in this trnsformtion is 3 * 139 = 417. üoops! The trnsformtion my include 2-reks (s prticulr cse of 3-reks). If every 3-rek were 2-rek then the totl numer of rekges is only 2*139 = 278 < 281, in which cse there could e no rekpoint re-uses t ll.
78 d 2 (Humn,Mouse) = 246 d 3 (Humn,Mouse) = 139 minimum numer of rekges = = 385 Minimizing the Numer of Brekges Prolem. Given genomes P nd Q, find series of k-reks trnsforming P into Q nd mking the smllest numer of rekges. Theorem. Any series of k-reks trnsforming P into Q mkes t lest d k (P,Q)+d 2 (P,Q) rekges Theorem. There exists series of d 3 (P,Q) 3-reks trnsforming P into Q nd mking d 3 (P,Q)+d 2 (P,Q) rekges.
79 Are There Rerrngement Hotspots in Theorem. Yes Humn Genome? Proof: The formul for 3-rek distnce implies tht there were t lest d 3 (Humn,Mouse) = 139 rerrngements etween humn nd mouse (including trnspositions) Every rerrngement cretes up to 3 rekpoints If there were no rekpoint re-use then fter 139 rerrngements we SHOULD SEE AT LEAST 385 rekpoints (rther thn 417 s efore) But there re only 281 rekpoints etween Humn nd Mouse Yes, 385 >> 281!
80 Brekpoint Re-uses etween Humn nd Mouse Genomes ü Any trnsformtion of Mouse into Humn genome with 3- reks requires t lest 385 rekges, while there re 281 rekpoints. ü So, there re t lest =104 rekpoint re-uses (re-use rte 1.37) which is significntly higher thn sttisticlly expected in the RBM. ü Men = 1.23 ü Stndrd devition = 0.02 ü Mximum rekpoint reuse rte = 1.33 (oserved once in 100,000 simultions)
81 Are there rerrngement hotspots in humn genome? ü We showed tht even if 3-rek rerrngements were frequent, the rgument ginst the RBM still stnds (Alekseyev & PP, PLoS Comput. Biol. 2007) We don t elieve tht 3-reks re frequent ut even if they were, we proved tht there exist frgile regions in the humn genome. It is time to nswer more difficult question: Where re the rerrngement hotspots in the humn genome? (the detiled nlysis ppered in Alekseyev nd PP, Genome Biol., Dec.1, 2010)
82 Where Do We Go From Here? Ancestrl Genome Reconstruction Brekpoint Re-use Anlysis Skip Genome Hlving Prolem
83 Ancestrl Genome Reconstruction Algorithmic Prolem: Ancestrl Genome Reconstruction nd Multiple Brekpoint Grphs
84 Ancestrl Genomes Reconstruction ü Given set of genomes, reconstruct genomes of their common ncestors.
85 Algorithms for Ancestrl Genomes Reconstruction ü GRAPPA: Tng, Moret, Wrnow et l. (2001) ü MGR: Bourque nd PP (Genome Res. 2002) ü InferCARs: M et l. (Genome Res. 2006) ü EMRAE: Zho nd Bourque (Genome Res. 2007) ü MGRA: Alekseyev nd PP (Genome. Res.2009)
86 Ancestrl Genomes Reconstruction Prolem (with known tree) ü Input: set of k genomes nd phylogenetic tree T ü Output: genomes t the internl nodes of the tree T tht minimize the totl sum of the 2-rek distnces long the rnches of T ü NP-complete in the simplest cse of k=3. ü Wht mkes it hrd?
87 Ancestrl Genomes Reconstruction Prolem (with known tree) ü Input: set of k genomes nd phylogenetic tree T ü Output: genomes t the internl nodes of the tree T ü Ojective: minimize the totl sum of the 2-rek distnces long the rnches of T ü NP-complete in the simplest cse of k=3. ü Wht mkes it hrd? BREAKPOINTS RE-USE
88 Brekpoints Are Footprints of Rerrngements on the Ground of Genomes ü Input: set of k genomes nd phylogenetic tree T ü Output: genomes t the internl nodes of the phylogenetic tree T ü Ojective function: the sum of genomic distnces long the rnches of T (ssuming the most prsimonious rerrngement scenrio) ü NP-complete in the simplest cse of k=3. ü Wht mkes it hrd? BREAKPOINTS RE-USES (resulting in messy footprints )! Ancestrl Genome Reconstructions of MANY Genomes (i.e., for lrge k) my e esier to solve.
89 How to Construct the Brekpoint Grph for Multiple Genomes? P c R d d c c Q d
90 Constructing Multiple Brekpoint Grph: rerrnging P in the Q order P c R d d c c c Q d d
91 Constructing Multiple Brekpoint Grph: rerrnging R in the Q order P c R d d c c c Q d d
92 Multiple Brekpoint Grph: Still Gluing Red Edges with the Sme Lels P c R d d c c Q c Multiple Brekpoint Grph G(P,Q,R) d d
93 Multiple Brekpoint Grph of 6 Mmmlin Genomes Multiple Brekpoint Grph G(M,R,D,Q,H,C) of the Mouse, Rt, Dog, mcque, Humn, nd Chimpnzee genomes.
94 Two Genomes: Two Wys of Sorting y 2-Breks Trnsforming P into Q with lck 2-reks: P = P 0 P 1... P d-1 P d = Q G(P,Q) G(P 1,Q)... G(P d,q) = G(Q,Q) Trnsforming Q into P with green 2-reks: Q = Q 0 Q 1... Q d = P G(P,Q) G(P,Q 1 )... G(P,Q d ) = G(P,P) Let's mke lck-green chimeric trnsformtion
95 Trnsforming G(P,Q) into (n unknown!) G(X,X) rther thn into ( known) G(Q,Q) s efore ü Let X e ny genome on pth from P to Q: P = P 0 P 1... P m = X = Q m-d... Q 1 Q 0 = Q ü Sorting y 2-reks is equivlent to finding shortest trnsformtion of G(P,Q) into n identity rekpoint grph G(X,X) of priori unknown genome X: G(P 0,Q 0 ) G(P 1,Q 0 ) G(P 1,Q 1 ) G(P 1,Q 2 )... G(X,X) ü The lck nd green 2-reks my ritrrily lternte.
96 ü For exmple, the groups {M, R} (Mouse nd Rt) nd {Q,H,C} (mcque, Humn, Chimpnzee) correspond to rnches of T while the groups {M, C} nd {R, D} do not. From 2 Genomes To Multiple Genomes ü We find trnsformtion of the multiple rekpoint grph G(P 1,P 2,...,P k ) into ( priori unknown!) identity multiple rekpoint grph G(X,X,...,X): G(P 1,P 2,...,P k )... G(X,X,...,X) ü The evolutionry tree T defines groups of genomes (to which the sme 2-reks my e pplied simultneously).
97 When All Relile 2-Breks Are Identified nd Undone ü The multiple rekpoint grph is reduced drmticlly! ü The remining (non-trivil) components cn e processed mnully in the cse-y-cse fshion.
98 Reconstruction Of The Ancestrl Genomes ü The resulting identity rekpoint grph G(X,X,...,X) defines its underlying genome X. ü The reverse trnsformtion is pplied to the genome X to trnsform it into ech of the originl genomes P 1, P 2,..., P k. ü Since X is pssing through ll internl nodes of T, it defines the ncestrl genomes t these nodes.
99 Reconstructed X Chromosomes ü The Mouse, Rt, Dog, mcque, Humn, Chimpnzee genomes nd their reconstructed ncestors:
100 If the Evolutionry Tree Is Unknown ü For the set of 7 mmmlin genomes (Mouse, Rt, Dog, mcque, Humn, Chimpnzee, nd Opossum), the evolutionry tree T ws suject of enduring detes ü Depending on the primte rodent crnivore split, three topologies re possile (only two of them re vile).
101 If The Evolutionry Tree Is Not Known ü For the set of 7 mmmlin genomes: Mouse, Rt, Dog, mcque, Humn, Chimpnzee, nd Opossum, the evolutionry tree T is eing deted. ü Depending on the primte rodent crnivore split, three topologies re possile (only two of them re vile). ü However, these three topologies shre mny common rnches in T (confident rnches). We cn restrict the trnsformtion only to such rnches in order to simplify the rekpoint grph, not reking n evidence for either of the topologies.
102 Rerrngement Evidence For The Primte- Crnivore Split ü Ech of these three topologies hs n unique rnch tht supports either lue (primte-rodent), or green (rodent-crnivore), or red (primtecrnivore) hypothesis. M M M O H H H D O D O D ü Rerrngement nlysis supports the primte crnivore split.
103 ü Rerrngement nlysis supports the primte crnivore split. Rerrngement Evidence For The Primte-Crnivore Split ü Ech of these three topologies hs n unique rnch tht supports either lue (primte-rodent), or green (rodent-crnivore), or red (primtecrnivore) hypothesis. M M M O 11 H H H D O D O D
104 Rerrngement Evidence For The Primte- Crnivore Split ü Ech of these three topologies hs n unique rnch tht supports either lue (primte-rodent), or green (rodent-crnivore), or red (primtecrnivore) hypothesis. We nlyze the rerrngements supporting ech of these M rnches: M M O 11 H H H D O D O D ü Rerrngement nlysis supports the primte
105 Where Do We Go From Here? Ancestrl Genome Reconstruction Brekpoint Re-use Anlysis Skip Genome Hlving Prolem
106 Genome Hlving Prolem Algorithmic Prolem: Genome Hlving Prolem
107 WGD nd Genome Hlving Prolem ü Whole Genome Dupliction (WGD) of genome R results in perfect duplicted genome R+R where ech chromosome is douled. ü The genome R+R is sujected to rerrngements tht result in duplicted genome P. ü Genome Hlving Prolem: Given duplicted genome P, find perfect duplicted genome R+R minimizing the rerrngement distnce etween R+R nd P.
108 Genome Hlving Prolem: Previous Results ü Algorithm for reconstructing pre-duplicted genome ws proposed in series of ppers y El- Mrouk nd Snkoff (culminting in SIAM J Comp., 2004). ü The proof of the Genome Hlving Theorem is rther technicl (spns over 30 pges).
109 Genome Hlving Theorem ü Found n error in the originl Genome Hlving Theorem for unichromosoml genomes nd proved theorem tht dequtely dels with ll genomes. (Alekseyev & PP, SIAM J. Comp. 2007) ü Suggested new (short) proof of the Genome Hlving Theorem - our proof is 5 pges long. (Alekseyev & PP, IEEE Bioinformtics 2007) ü Proved the Genome Hlving Theorem for the hrder cse of trnsposition-like opertions (Alekseyev & PP, SODA 2007) ü Introduced the notion of the contrcted rekpoint grph tht mkes difficult prolems (like the Genome Hlving Prolem) more trnsprent.
110 2-Brek Distnce Between Duplicted Genomes 2-Brek Distnce etween Duplicted Genomes:
111 2-Brek Distnce Between Duplicted Genomes 2-Brek Distnce etween Duplicted Genomes:. Difficulty: The notion of the rekpoint grph is not defined for duplicted genomes (the first in P cn correspond to either the first or the second in Q).
112 2-Brek Distnce Between Duplicted Genomes 2-Brek Distnce etween Duplicted Genomes: Ide: Estlish correspondence etween the genes in P nd Q nd re-lel the corresponding locks (e.g., s 1, 2, 1, 2 )
113 2-Brek Distnce Between Duplicted Genomes 2-Brek Distnce etween Duplicted Genomes Tret the leled genomes s non-duplicted, construct the rekpoint grph nd compute the 2-rek distnce etween them.
114 Different Lelings Result in Different Brekpoint Grphs ü There re 2 different lelings of the copies of ech lock. ü One of these lelings (corresponding to rekpoint grph with mximum numer of cycles) is n optiml leling. ü Trying ll possile lelings tkes exponentil time: 2 #locks invoctions of the 2-rek distnce lgorithm. ü Leling Prolem. Construct n optiml leling tht results in the mximum numer of cycles in the rekpoint grph (hence, the smllest 2-rek distnce).
115 Constructing Brekpoint Grph of Duplicted Genomes P Q
116 Contrcted Genome Grphs: GLUING Red Edges P Q
117 Contrcted Brekpoint Grph: Gluing Red Edges Yet Agin P Contrcted Brekpoint Grph G (P,Q) Q
118 Contrcted Brekpoint Grph of Duplicted Genomes ü Edges of 3 colors: lck, green, nd red. ü Red edges form mtching. ü Blck edges form lck cycles. ü Green edges form green cycles.
119 Wht is the Reltionship Between the Brekpoint Grph nd the Contrcted Brekpoint Grph?
120 Every Brekpoint Grph Induces Cycle Decomposition of the Contrcted Brekpoint Grph Why do we cre?
121 Every Brekpoint Grph Induces Cycle Decomposition of the Contrcted Brekpoint Grph Why do we cre? Becuse optiml leling corresponds to mximum cycle decomposition.
122 Mximum Cycle Decomposition Prolem Open Prolem 1: Given contrcted rekpoint grph, find its mximum lck-green cycle decomposition.?
123 Leling Prolem Open Prolem 2: Find rekpoint grph tht induces given cycle decomposition of the contrcted rekpoint grph.?
124 Computing 2-Brek Distnce Between Duplicted Genomes: Two Prolems rekpoint grph inducing mx cycle decomposition mximum cycle decomposition contrcted rekpoint grph
125 Computing 2-Brek Distnce Between Duplicted Genomes: Two HARD Prolems rekpoint grph inducing mx cycle decomposition mximum cycle decomposition contrcted rekpoint grph These prolems re difficult nd we do not know how to solve them. However, we solved them in the cse of the Genome Hlving Prolem.
126 2-Brek Genome Hlving Prolem 2-Brek Genome Hlving Prolem: Given duplicted genome P, find perfect duplicted genome R+R minimizing the 2-rek distnce: d 2 (P,R+R) = #locks - cycles(p,r+r) Minimizing d 2 (P,R+R) is equivlent to finding perfect duplicted genome R+R nd leling of P nd R+R tht mximizes cycles(p,r+r).
127 Contrcted Brekpoint Grph of Perfect Duplicted Genome P G'(P,R+R) R+R
128 Contrcted Brekpoint Grph of Perfect Duplicted Genome hs Specil Structure ü Red edges form mtching. ü Blck edges form lck cycles. ü Green edges form cycles in generl cse ut now (for R+R) these cycles re formed y prllel (doule) green edges G'(P,R+R) forming mtching
129 Finding the Best Contrcted Brekpoint Grph for Given Genome P
130 Blue Prolem: Optiml Contrcted Brekpoint Grph P
131 Mgent Prolem: Mximum Cycle Decomposition P
132 Ornge Prolem: Leling P?
133 Solutions to?,?, nd? re too complex to e presented in this tlk (SIAM J. Comp.2007) P?
134 Genome Hlving Prolem: Wht is Left Behind (1) 2-Brek Genome Hlving Prolem for Multichromosoml Genomes (prtilly covered in this tlk) (2) 2-Brek Genome Hlving Prolem for Unichromosoml Genomes (more difficult) (3) A Flw in the El-Mrouk Snkoff Theorem for Unichromosoml Genomes (4) Clssifiction of Unichromosoml Genome (fixing the flw in the El-Mrouk Snkoff Theorem) (5) 3-Brek Genome Hlving Prolem
135 Acknowledgments Mx Alekseyev
136 Acknowledgments Mx Alekseyev Dvid Snkoff If you re not criticized, you my not e doing much. Donld Rumsfeld
137 Acknowledgments Mx Alekseyev Dvid Snkoff If you re not criticized, you my not e doing much. Donld Rumsfeld Glenn Tesler, Mth. Dept., UCSD Qin Peng
I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationCombinatorial Problems and Algorithms in Comparative Genomics. Max Alekseyev
Comintoril Prolems n Algorithms in Comprtive Genomis Mx Alekseyev Dept. Computer Siene, University of South Crolin, Columi, SC, U.S.A. Algorithmi Biology L, Aemi University, Sint Petersurg, Russi 2011
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationRecent advances in analysis of evolutionary transpositions
Reent vnes in nlysis of evolutionry trnspositions Mx Alekseyev Deprtment of Mthemtis / Computtionl Biology Institute George Wshington University 2015 Genome Rerrngements Mouse X hromosome unknown nestor
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationConnected-components. Summary of lecture 9. Algorithms and Data Structures Disjoint sets. Example: connected components in graphs
Prm University, Mth. Deprtment Summry of lecture 9 Algorithms nd Dt Structures Disjoint sets Summry of this lecture: (CLR.1-3) Dt Structures for Disjoint sets: Union opertion Find opertion Mrco Pellegrini
More informationHamiltonian Cycle in Complete Multipartite Graphs
Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationGenetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationFormal languages, automata, and theory of computation
Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationAlignment of Long Sequences. BMI/CS Spring 2016 Anthony Gitter
Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostt.wisc.edu Gols for Lecture Key concepts how lrge-scle lignment differs from the simple cse the
More informationSection 6: Area, Volume, and Average Value
Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationThe Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms
The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationRagout a reference-assisted assembly tool for bacterial genomes
Rgout reference-ssisted ssembly tool for bcteril genomes Mikhil Kolmogorov 1, Brin Rney 2, Benedict Pten 2 nd Son Phm 3 1 St. Petersburg University of the Russin Acdemy of Sciences, 2 University of Cliforni
More informationChapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis
Chpter 4: Techniques of Circuit Anlysis Terminology Node-Voltge Method Introduction Dependent Sources Specil Cses Mesh-Current Method Introduction Dependent Sources Specil Cses Comprison of Methods Source
More informationWe will see what is meant by standard form very shortly
THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More informationFast Frequent Free Tree Mining in Graph Databases
The Chinese University of Hong Kong Fst Frequent Free Tree Mining in Grph Dtses Peixing Zho Jeffrey Xu Yu The Chinese University of Hong Kong Decemer 18 th, 2006 ICDM Workshop MCD06 Synopsis Introduction
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationCSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science
CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny
More informationexpression simply by forming an OR of the ANDs of all input variables for which the output is
2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationUSA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
More informationLecture Note 9: Orthogonal Reduction
MATH : Computtionl Methods of Liner Algebr 1 The Row Echelon Form Lecture Note 9: Orthogonl Reduction Our trget is to solve the norml eution: Xinyi Zeng Deprtment of Mthemticl Sciences, UTEP A t Ax = A
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More information4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve
Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions
More informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.
Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationRead section 3.3, 3.4 Announcements:
Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f
More informationEquations and Inequalities
Equtions nd Inequlities Equtions nd Inequlities Curriculum Redy ACMNA: 4, 5, 6, 7, 40 www.mthletics.com Equtions EQUATIONS & Inequlities & INEQUALITIES Sometimes just writing vribles or pronumerls in
More information0.1 THE REAL NUMBER LINE AND ORDER
6000_000.qd //0 :6 AM Pge 0-0- CHAPTER 0 A Preclculus Review 0. THE REAL NUMBER LINE AND ORDER Represent, clssify, nd order rel numers. Use inequlities to represent sets of rel numers. Solve inequlities.
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More informationFault Modeling. EE5375 ADD II Prof. MacDonald
Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationStudent Activity 3: Single Factor ANOVA
MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether
More informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More informationLecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationConverting Regular Expressions to Discrete Finite Automata: A Tutorial
Converting Regulr Expressions to Discrete Finite Automt: A Tutoril Dvid Christinsen 2013-01-03 This is tutoril on how to convert regulr expressions to nondeterministic finite utomt (NFA) nd how to convert
More informationCIRCULAR COLOURING THE PLANE
CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices
More informationChapters Five Notes SN AA U1C5
Chpters Five Notes SN AA U1C5 Nme Period Section 5-: Fctoring Qudrtic Epressions When you took lger, you lerned tht the first thing involved in fctoring is to mke sure to fctor out ny numers or vriles
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationLecture 9: LTL and Büchi Automata
Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationDISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS
DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either
More informationHaplotype Frequencies and Linkage Disequilibrium. Biostatistics 666
Hlotye Frequencies nd Linkge isequilirium iosttistics 666 Lst Lecture Genotye Frequencies llele Frequencies Phenotyes nd Penetrnces Hrdy-Weinerg Equilirium Simle demonstrtion Exercise: NO2 nd owel isese
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationCS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7
CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop
More informationIndividual Contest. English Version. Time limit: 90 minutes. Instructions:
Elementry Mthemtics Interntionl Contest Instructions: Individul Contest Time limit: 90 minutes Do not turn to the first pge until you re told to do so. Write down your nme, your contestnt numer nd your
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More information