Copyright 2013 Regents of the University of Minnesota

Size: px
Start display at page:

Download "Copyright 2013 Regents of the University of Minnesota"

Transcription

1 Introdution to Glxy Tutoril Rsrh Informtis Support Systms Minnsot Supromputing Institut Univrsity of Minnsot Vrsion /15/2013 1

2 1 Introdution Sop of this tutoril Strting Glxy Assing Glxy Import Fstq fils for on smpl into urrnt history St fil ttriuts: dts/uild nd dttyp Evluting Fstq Fil Qulity Running fstqc Viwing FstQC Rsults Rviwing FstQC Clning Fstq Dtsts Introdution to Clning Simpl Rmovl of Low Qulity Tils FASTQ Qulity Trimmr Running FstQC on Trimmd Dt Chking th FstQC Rsults Simpl Rmovl of Adptr Squns Running Cutdpt Running FstQC Rsyning Fils Vrifying Clning Rsults Rviwing FstQC Workflows Extrt workflow from urrnt history Edit th workflow Running th Workflow Clning up Historis Dlting Intrmdit Fils Dlting Old Historis Shring Your Work Shring Workflows Shring Historis Appndix I: Itrtiv til/dptr rmovl

3 1 Introdution 1.1 Sop of this tutoril This is prtil, hnds-on tutoril with two primry ims: Giv prtiipnts xprin with th si funtionlity of Glxy o Strting Glxy o Glxy Lyout o Loding fils into urrnt history o Crting rusl workflows o Shring historis nd workflows with othrs Bsi prossing nd qulity ontrol on squning dtsts o Evluting rd qulity o Adptr rmovl o Low qulity rd rmovl o Rd trimming Rfrn mtrils Glxy srnsts: glxyst.org 3

4 2 Strting Glxy Glxy Intrf (St 2.1 on pg 5) Tools pn All of th softwr vill in Glxy is listd in th tools pn, groupd into tgoris. Clik on th first tool tgory Gt Dt to xpnd it nd show th individul tools in th tgory. Clik th Gt Dt tgory gin to ollps it. Historis pn Th history pn will show list of ll input nd output fils usd in th urrnt nlysis Cntr pn Th ntr pn displys informtion for spifi tools or fils sltd from th tools nd historis pns. Tutoril Dtst (St 2.2 on pg 7) This tutoril will go ovr si glxy fturs nd dsri som strtgis for lning up squning dtsts. Th smpl dtst usd in this tutoril ws rtd from n SRA sumission rprsnting shotgun r-squning of th humn gnom. Ths fstq fils wr rtifiilly dgrdd to provid singl xmpl ontining vrity of potntil qulity issus. Whil th FstQC rsults losly rsml prolms found in rl dtsts, not ll dtsts will s rovrl s th tutoril dtst. Dt Lirris (St 2.2 on pg 7) In Glxy dt fils r stord in Dt Lirris. Dt lirris n puli (vill to ll Glxy usrs) or privt (vill to th mmrs of your l). Squn dt gnrtd y th UMGC n lodd into Glxy y snding rqust to MSI, whr thy will vill in dt lirry. Additionl usrs n givn ss to dt lirry y snding rqust to MSI. If you hv lrg dtst lotd on n MSI fil systm it n lodd into Glxy dt lirry y snding rqust to MSI. Stndrd nming onvntion is to ll th forwrd (or lft) rd s R1 nd th rvrs (or right) rd s R2. Glxy Fil Attriuts (St 2.3 on pg 8) Glxy dos not rly on fil xtnsions to dtrmin fil typs. Instd, h fil in Glxy hs st of ttriuts tht dsri wht formt th fil is in nd wht rfrn gnom (if ny) it is ssoitd with. Fstq fils, for xmpl, om in svrl slightly diffrnt fil formts. Whn fstq fil is uplodd to Glxy it is idntifid s gnri fstq fil. Th Illumin fstq fils usd in this tutoril (s wll s thos urrntly gnrtd y th UMGC) r in th Sngr fstq formt. S n.wikipdi.org/wiki/fastq_formt for mor informtion. 4

5 2.1 Assing Glxy. Opn w rowsr nd nvigt to MSI Glxy wsit glxy.msi.umn.du. Log in with your MSI usrnm nd pssword. Th sid pnls n ollpsd vi rrows in th ottom ornrs to provid ttr viw of th ntr pnl d. Th totl quntity of dt you hv stord in glxy is displyd in th top right Glxy Intrf d Tools pn Cntr pn History pn 5

6 . You n mor sily find th tool you would lik to us y srhing for its nm nd kywords using th srh tools fild. Throughout th tutorils w will dirt you on how to find th tools mnully ut srhing is oftn th quikr option. 6

7 2.2 Import Fstq fils for on smpl into urrnt history Dt Lirris Tutoril Dtst. At th top of th srn slt Shrd Dt -> Dt Lirris. Slt RISS-tutoril-glxy101 from th list of dt lirris. Expnd th FstQ foldr nd hk th oxs nxt to th first two fils ( Tutoril_fil_R1.fstq nd Tutoril_fil_R2.fstq ) d. Nr th ottom of th pg lik th Go utton to import th sltd dtsts to th urrnt history d 7

8 2.3 St fil ttriuts: dts/uild nd dttyp Glxy Fil Attriuts. Viw th history pnl y liking on Anlyz Dt. In th history pn lik on th pnil ion nxt to th 2: Tutoril_fil_R2.fstq fil in ordr to st th fil ttriuts. This is humn dt so slt hg19_nonil in th Dts/Build ox. A list of ll vill dtss will ppr s you typ d. Clik sv. Clik th Dttyp t f. Entr fstqsngr in th Nw Typ ox. A list of vill dt typs will ppr s you typ. g. Clik sv h. Rpt this pross (stps -g) for 1: Tutoril_fil_R1.fstq d f g h. Rpt for Sond Fil 8

9 3 Evluting Fstq Fil Qulity Qulity Sors (St 3.3 on pg 11) Th qulity vlution disussd in this tutoril is grd towrds Illumin gnrtd rds. Othr squning mthods my produ rds with diffrnt pttrn of rrors or diffrnt formt of qulity fil. Othr squning mthods hv thir own sustions in th NGS: QC nd mnipultion stion Fstq fils inlud not only squn informtion, ut lso informtion out th stimtd hn of mislld s. This rror stimtion is rfrrd to s qulity sor. A qulity sor for spifi position is nodd s singl ASCII hrtr. Sin ASCII hrtrs hv stndrdizd numril ssoition (s th spifi hrtr shown n usd to omput n xptd rror rt. Th xt rror rt, P, is lultd s whr Q is th vlu of th ASCII hrtr Sin th first 32 ASCII hrtrs r wht r known s ontrol hrtrs nd don t produ visil hrtr on omputr srn th modrn vrsion of fstq trts th 33 rd ASCII hrtr s Q = 0 nd ounts up from thr. This is known s th Sngr phrd noding. Erlir Illumin mhins trtd th 64 th ASCII hrtr s Q = 0. As rsult r should tkn to dtrmin th fstq vrsion of oldr fils. A qulity sor of 10 indits n rror rt of 10%, 20 is 1%, 30 is 0.1% nd so on. FstQC Mtris (St 3.3 on pg 11) 1. Bsi Sttistis Givs th nm of th input fil, noding usd for th qulity sor (Sngr vs oldr nodings), totl squn ount, vrg squn lngth nd GC ontnt prntg. 2. Pr s squn qulity A prtiulrly importnt figur showing th vrg qulity sor t diffrnt positions ross ll rds. In gnrl, qulity is lowr t th strt nd nds of rds. Suddn dips in th middl of rd n signify fild yls in th squning run. 3. Pr squn qulity sors Histogrm hrting th vrg qulity ross rd. Bimodl distriutions my indit sust of rds tht r low qulity nd should rmovd. 4. Pr s squn ontnt Th frquny of prtiulr nulotids t diffrnt positions in th rds. Extrmly high nulotid is n sign of troul. Short strths with high is n usd y th prsn of linkrs, rods or dptrs. Thr is usully som minor is in th first 11-13p of RNA-sq xprimnt du to not-quit rndom hxmr squn priming. This is is ountd for in RNA-sq nlysis softwr. 5. Pr s GC ontnt Avrg GC ontnt y position in th rd 6. Pr squn GC ontnt Histogrm showing th frquny of rds with rtin GC%. Illumin squnrs tnd to undrrprsnt xtrmly high nd xtrmly low GC% squns. Lrg dvitions from th xptd distriution n sign tht th GC is is hving n fft on squning rsults. 7. Pr s N ontnt Rt of N (ny nulotid) lls y position in rd. 8. Squn Lngth Distriution Histogrm of squn lngths. 9. Squn Duplition Lvls Frquny of xt squn duplits in th dtst. High duplition rts n usd y PCR rtifts nd/or low lirry divrsity. 10. Ovrrprsntd squns Clls out spifi ovr-rprsntd squns. 11. Kmr Contnt Shows th rt of ovr-rprsntd k-mrs in th dtst. K-mrs ovr-rprsntd t th 5 nd/or 3 nds n n indition of dptr ontmintion. 9

10 3.1 Running fstqc. From th Tools pnl lik on th NGS: QC nd mnipultion group. Clik FstQC:Rd QC. Slt th fil to nlyz from th drop-down mnu, in this s Tutoril_fil_R2.fstq d. Rnm th output fil to somthing rognizl (W usd Prlning Right ). Clik Exut f. Rpt ths stps (-) on th Lft rd fil Tutoril_fil_R1.fstq d f. Rpt for Sond Fil 3.2 Viwing FstQC Rsults. Clik th y ion on 3: FstQCPrlningRight to viw th fstqc rsults 10

11 3.3 Rviwing FstQC In th following rviw of th FstQC rsults w will prsnt th rsults of oth th Lft nd Right rds sid y sid. W do this to ntut th diffrn twn th two dtsts nd to highlight th importn of hking th qulity of oth sts of rds. It is quit norml for on st of rds to onsidrly diffrnt in qulity from th othr. Usully th lft rds r of highr qulity du to th ft tht thy r sqund first. Th lft nd right rds r on th lft nd right rsptivly. Qulity Sors FstQC Mtris. Sroll to Pr s squn qulity. Low qulity 3 til to lrg numrs of rds. Likly fild yl (on position is fftd ut th visuliztion is vrging ovr 4 yls) d d. Sroll to Pr squn qulity sors.. Not th imodl distriution with popultion of low qulity rds. 11

12 f. Sroll to Squn Duplition Lvls g. Not th prsn of duplit rds, hr up to 5 opis. Som duplition is xptd nd this is rltivly low duplition. Thr my issus if th 10+ olumn is xtrmly high f g g h. Sroll down to Kmr Contnt i. Not th prsn of ovr nrihd k-mrs t th 3 nd. This is inditiv of 3 dptr ontmintion. Ths squns my lso idntifid s n Ovrrprsntd Squn h i i 12

13 4 Clning Fstq Dtsts 4.1 Introdution to Clning Low Qulity Tils/Cyls (St 5.1 on pg 14) For vrity of rsons, inluding dy of rgnts s thy sit on th squnr, th qulity of s lls tnds to drs s squning progrsss. As rsult th 5 nds will tnd to hv highr qulity thn th 3 nds nd forwrd rds will tnd to hv ttr qulity thn rvrs rds. Bus lowr qulity indits highr hn of mislld s, lrg numr of low qulity s pirs n impir th ury of mpping lgorithms. As rsult whn thr is onsidrl vidn of low qulity tils th tils r trimmd for furthr nlysis is prformd. A simpl nd fftiv mthod is to rmov fixd numr of s pirs from th nd of h rd. Howvr, rmoving th lst 20% of ll rds rsults in 20% rdution in gnom ovrg. Mor sophistitd mthods only rmov th tils tht show vidn of low qulity. Both mthods will disussd within this stion. A similr ut distint prolm is th issu of fild yls. On rr ourrns th squning mhins my simply fil to proprly inorport nulotids or fil to rd th fluorsn of th most rnt inorportion. This rsults in xtrmly low qulity sors t fixd position in ll rds in th ln. For gnrl lignmnt ths fild yls n ignord ut in spifi instns it my nssry to xlud tht position from th nlysis. Adptr Contmintion (St 6.1 on pg 17) Illumin DNA lirris onsist of th DNA of intrst (grn) with ligtd dptrs (rd + yllow) on th 5 nd 3 nds to provid priming sits for th Illumin squning rtions. Th Forwrd dptr (lft) provids rgion (distl) tht inds to th flow ll plt nd rgion (proximl) to whih th squning primr inds. Th Rvrs dptr (right) provids similr rgions with th ddition of rod squn (yllow) Adptr Adptr ontmintion ours whn th DNA frgmnt of intrst is too short nd th squning pross gins to squn th opposing primr rgion Hr you n s th distl rgion ound to th flow plt, th proximl rgion ound with primr nd n rrow showing th rsulting squn rd. In ordr to rmov dptr ontmintion th dptrs usd in th xprimnt nd to supplid. Dpnding on th xprimntl dsign dptr ontmintion n our on th 5 nd, 3 nd or oth. In th xmpl shown hr only th 3 nd is ontmintd. Th stndrd Illumin TruSq dptrs r: Forwrd 5 AATGATACGGCGACCACCGAGATCTACACTCTTTCCCTACACGACGCTCTTCCGATCT Rvrs 5' GATCGGAAGAGCACACGTCTGAACTCCAGTCACNNNNNNATCTCGTATGCCGTCTTCTGCTTG 13

14 5 Simpl Rmovl of Low Qulity Tils 5.1 FASTQ Qulity Trimmr Low Qulity Tils/Cyls. Opn th NGS: QC nd mnipultion stion of th toolr. Clik FASTQ Qulity Trimmr. Undr FASTQ Fil: Slt th Right rd fil 2: Tutoril_fil_R2.fstq d. St Trim nds to 3 only. St Window siz to 3 f. St Qulity Sor to 20 g. Clik Exut h. Rpt prvious stps (-g) for 1: Tutoril_fil_R1.fstq d f g h. Rpt for Sond Fil 14

15 5.2 Running FstQC on Trimmd Dt. From th Tools pnl lik on th NGS: QC nd mnipultion group. Clik FstQC:Rd QC. Slt th fil to nlyz from th drop-down mnu, in this s 5: FASTQ Qulity Trimmr on dt 2 d. Rnm th output fil to somthing rognizl (W usd PostTrim R ). Clik Exut f. Rpt ths stps (-) on th Lft rd fil 6: FASTQ Qulity Trimmr on dt 1 d f. Rpt for Sond Fil 15

16 5.3 Chking th FstQC Rsults. Clik th y ion on 7: PostTrimR to viw th fstqc rsults. Sroll down to Pr s squn qulity. Not tht th qulity of th tils hs improvd signifintly d. Sroll down to Kmr Contnt. Osrv tht th high numr of Kmrs t th 3 nd hv not n fftd. d 16

17 6 Simpl Rmovl of Adptr Squns 6.1 Running Cutdpt Adptr ontmintion. Opn th Fst mnipultion stion. Clik Cutdpt to lod th dptr trimmr tool. Undr Fstq fil to trim: Slt th Right rdst 5: FASTQ Qulity Trimmr on dt 2 d. Clik Add nw 3 Adptrs d. In th ox lld Choos 3 dptr ntr th dptr squn tht would ontmint th R2 (rvrs/right) rds. For this tutoril nd for stndrd Illumin runs this would th TruSq Univrsl Adptr Rvrs Complmnt 17

18 f. St Minimum ovrlp lngth to 5 f g. St Output filtring options: to St Filtrs h. St Minimum Lngth to 25 g h i. Clik Exut to run th tool i j. To quikly st up th utdpt run for th R1 (forwrd/lft) rds w will pply nw thniqu. Clik on th nm of on of th utdpt rsults to xpnd its ox. k. Clik on th lu irulr rrow to lod utdpt with ll of th stting of th prvious run. j k 18

19 l. Chng th Fstq fil to trim: dropdown to 6: FASTQ Qulity Trimmr on dt 1 m. Chng th Choos 3 dptr: dropdown to th pproprit dptr ontminnt. For this tutoril nd for stndrd Illumin runs this is th TruSq Indx Adptr l m n n. Clik Exut o. Opn th Cutdpt rport y liking on th y ion p. Not th lngth distriution of rmovd squn, this givs n indition of th fls trimming rt. p o 19

20 6.2 Running FstQC. From th Tools pnl lik on th NGS: QC nd mnipultion group. Clik FstQC:Rd QC. Slt th fil to nlyz from th drop-down mnu, in this s 10: Cutdpt on dt 5 d. Rnm th output fil to somthing rognizl (W usd PostCutdptR ). Clik Exut f. Rpt ths stps (-) on th Lft rd fil 12: Cutdpt on dt 6 d f. Rpt for Sond Fil 6.3 Rsyning Fils Trimming nd othr qulity ontrol msurs n rsult in rds, usully thos of zro lngth, ing rmovd from th dtst. Additionlly, som prossing stps my shuffl rds within th dt fils. Mny progrms xpt to find th sm rd nms in th sm ordr for oth th lft nd right rdsts. To nsur tht th rd nms r in syn you n run th r-syn tool.. From th Tools pnl lik on th MSI group. Clik rsyn: Pird-nd rsynhroniztion. Slt s Input 1, 12: Cutdpt on dt 6 d. Slt s Input 2, 10: Cutdpt on dt 5. Clik on xut d 20

21 7 Vrifying Clning Rsults 7.1 Rviwing FstQC. Clik on th y ion nxt to 13: PostCutdptR to viw th rsults of dptr trimming. For illustrtion purposs w r showing th R1 nd R2 rds rsults djnt to on nothr.. Sroll down to Pr s squn qulity. Not th improvmnt in th vrg til qulity Lft Rd Right Rd Prlning Postlning 21

22 d. Sroll down to Pr squn qulity sors. Vrify rmovl of low qulity pk d Lft Rd Right Rd Prlning Postlning 22

23 f. Sroll down to Squn Lngth Distriution g. Not th dgr of trimming tht hs ourrd. f Lft Rd Right Rd Prlning g g Postlning 23

24 h. Sroll down to Kmr Contnt i. Not th sn of ovrrprsntd til kmrs h Lft Rd Right Rd Prlning i i i i Postlning 24

25 8 Workflows Glxy Workflows (St. 8.1 on pg 25) Glxy workflows provid n sy mthod to utomt n nlysis piplin. W will dmonstrt how to gnrt workflow, modify prts of th workflow nd us it to nlyz sond st of smpls. Also, workflows nd historis n shrd with othr Glxy usrs. Workflow Prmtrs (St. 8.2 on pg 27) Th workflow w st up in this stion will run FstQC, qulity trimming nd dptr trimming on oth th lft (R1) nd right (R2) rd sts. By dfult ll prmtrs in workflow will th sm is thos usd in th history. For stting, suh s th dptr s squns, tht my diffrnt for vry nlysis, you n mk thm sttl t run-tim. 8.1 Extrt workflow from urrnt history Glxy Workflows. At th top of th history pn lik on th smll gr ion nd slt Extrt Workflow from th pop-up mnu. In th Workflow nm ox ntr QC nd Clnup. Clik Crt Workflow 25

26 8.2 Edit th workflow Workflow prmtrs. Clik on Workflow t th top of th Glxy window. Clik on th workflow tht ws just rtd nd slt Edit from th drop-down mnu. By drgging th oxs round you n mk th workflow sir to intrprt. d. Find on of th input dtsts nd find nd lik on th FstQC:Rd QC run tthd to it. Look on th Dtils pnl, not whthr this is th Lft or Right rd f. Clik on th tthd Input dtst f d 26

27 g. Bsd on stp, Ll th input. W lld th input s Lft Rd Input do th sm for th othr input dtst nming it Right Rd Input g h. Susqunt runs my rquir diffrnt dptr squns. Thr is n option to llow th dptr to st whn th workflow is run. Clik on Cutdpt ox i. Clik on th smll downwrd djnt to Entr ustom 3 dptr squn j. Clik th St t runtim option k. Rpt ths stps (h-j) for th othr Cutdpt ox in th workflow. l. Clik th gr ion t th top of th workflow nd slt Sv h j i k. Rpt (h-j) 27

28 8.3 Running th Workflow. Clik Anlyz Dt to rturn to your history. Bfor finishing with this history giv it nm so you n find it gin. W nmd our history Glxy 101 History. Nm th history y liking on th titl lotion. (You must prss ntr to sv th hng. Cliking outsid th ox will not work). Crt nw history y liking on th gr ion t th top of th history pn nd slting Crt Nw from th pop-up mnu d. Nm th nw history Workflow Tst d. Import th Tutoril_fil_workflow_R1.fstq nd Tutoril_fil_workflow_R2.fstq fil y liking on Shrd Dt -> Dt Lirris t th top of th srn nd slting th fils from th RISS-tutoril-glxy101 dt lirry f. Lod workflow y liking on Workflow t th top of th srn f 28

29 g. Clik on th workflow tht ws just rtd nd slt Run from th dropdown mnu h. Slt th 1: Tutoril_fil_workflow_R1.fstq fil in th Lft Rd Input mnu i. Slt th 2: Tutoril_fil_workflow_R2.fstq fil in th Right Rd Input mnu g h i j. Sroll down to Stp 8: Cutdpt nd t Choos 3 dptr slt th pproprit dptr, in this s TruSq Indx Adptr k. Sroll down to Stp 10: Cutdpt nd t Choos 3 dptr slt th pproprit dptr, in this s TruSq Univrsl Adptr Rvrs Complmnt l. Sroll down to th ottom of th min viw nd lik Run Workflow m. Clik Anlyz Dt to rturn to th history viw. j l k 29

30 9 Clning up Historis Running tools nd workflows in Glxy uss hrd driv storg sp, t tims lot of storg sp. W stimt tht vn rltivly simpl RNA-sq nlysis will us 4-5 tims th storg of th rw squning fils. Th good nws is tht most of ths fils r tmporry fil tht n sfly dltd whn th nlysis is finishd. If you did ltr tht th fils r ndd thy n quikly rgnrtd y r-running th workflow. You urrnt glxy-wid storg usg is shown in th top right ornr of th glxy window Additionlly, h individul history will show its storg usg t th top of th pnl. Not tht if you r plnning to xtrt workflow from your urrnt history you should do so for dlting th intrmdit fils. 9.1 Dlting Intrmdit Fils W will dmonstrt dlting intrmdit fils on th Workflow Tst history you rtd s prt of th tutoril.. Clik on Anlyz Dt to rturn to th history viw. Clik th Gr ion to opn th options mnu nd slt Svd Historis 30

31 . Clik on th rrow nxt to Workflow Tst history nd hoos Swith d. Clik th X to dlt fil. W only nd th finl rsyn fils nd n dlt ll othrs. d. Not tht th siz of th history hs not hngd f. Clik on th gr ion nd slt Inlud Dltd Dtsts g. Clik th irld link to prmnntly purg th dtsts. h. Not tht th storg usg hs now n rdud. f g h 31

32 9.2 Dlting Old Historis If you hv historis you no longr nd thy n dltd from th svd historis mnu. Lik dlting th intrmdit fils, you must purg th historis in ordr to rmov thm from th storg sp. Hr w will dlt th Glxy 101 History w usd to mk our workflow. Clik on Anlyz Dt to rturn to th history viw. Clik th Gr ion to opn th options mnu nd slt Svd Historis. Clik th downwrd rrow nxt to Glxy 101 History nd slt Dlt Prmnntly. Th workflow w rtd from this history will unfftd y this tion. d. Clik Ok to prmnntly rmov th history d 32

33 10 Shring Your Work Glxy provids tools for privtly shring your historis with othr glxy usrs. All you nd to know is th mil ddrss of th usr with whih you wnt to shr. In this stion w will rt link to shr our QC nd Clnup workflow s wll s th finl fils in th Workflow Tst history Shring Workflows. Clik on Workflow to swith to th workflow list. Clik th Downwrd Arrow nxt to QC nd Clnup nd slt Shr nd Pulish. Clik Mk Workflow Assil vi Link d. Shr this link with your ollortors, lik th link to s wht thy would s. d. Shrd workflows n svd or importd into your Glxy ount y liking th ions in th top right ornr 33

34 10.2 Shring Historis. Clik on Anlyz Dt to swith to your history. Clik th Gr ion to opn th options mnu nd slt Svd Historis. Clik th Downwrd Arrow nxt to Workflow Tst nd slt Shr or Pulish d. Clik Mk History Assil vi Link d. Shr this link with your ollortors, lik th link to s wht thy would s. f. Shrd historis n importd into your Glxy ount y liking th ion in th top right ornr f 34

35 11 Appndix I: Itrtiv til/dptr rmovl This is n dvnd workflow for trimming low qulity dptrs nd rd tils. Whil produing lrgly th sm rsult s th min tutoril this workflow provids littl xtr snsitivity for trimming ss whr rd hs oth n dptr nd vry low qulity til. To illustrt th prolm, onsidr th rd low. Th rd stion is th gnomi squn, th grn stion is th dptr squn nd th grdint dnots drsing qulity. If th dptr trimming is ttmptd first, th low qulity my prvnt th squn from ing rognizd. As suh, w ttmpt to trim dptrs, trim th low qulity tils nd thn trim dptrs gin. This lns mintining suffiint squn for dptr rognition with rmoving low qulity s pirs tht my rrors.. Opn th FASTA Mnipultion stion. Clik Cutdpt to lod th dptr trimmr tool. Undr Fstq fil to trim: Slt th Right rd fil Tutoril_fil_R.fstq d. Clik Add nw 3 Adptrs. Undr Sour slt Entr ustom squn f. In th ox lld Entr ustom 3 dptr squn ntr AATGATACGGCGACCACCGAGATCTACACGCCTCCCTCGCGCCATCAGCTGATGGCGCG f d 35

36 g. St Minimum ovrlp lngth to 5 h. St Output filtring options: to St Filtrs i. St Minimum Lngth to 15 j. Clik Exut g ` h i j 36

37 k. Opn th NGS: QC nd mnipultion stion of th toolr l. Clik FASTQ Qulity Trimmr m. St FASTQ Fil to Cutdpt on dt 2 n. St Trim nds to 3 only o. St Window siz to 3 p. St Qulity Sor to 20 q. Clik Exut k m n o f g 20 l 37

38 r. Opn th FASTA Mnipultion stion s. Clik Cutdpt to lod th dptr trimmr tool t. Undr Fstq fil to trim: Slt th rsult from th prvious utdpt run, 7: FASTQ Qulity Trimmr on dt 6 u. Clik Add nw 3 Adptrs v. Undr Sour slt Entr ustom squn w. In th ox lld Entr ustom 3 dptr squn ntr AATGATACGGCGACCACCGAGATCTACACGCCTCCCTCGCGCCATCAGCTGATGGCGCG r t v w u s 38

39 x. St Minimum ovrlp lngth to 5 y. St Output filtring options: to St Filtrs z. St Minimum Lngth to 25. Clik Exut x ` y z 39

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

WORKSHOP 6 BRIDGE TRUSS

WORKSHOP 6 BRIDGE TRUSS WORKSHOP 6 BRIDGE TRUSS WS6-2 Workshop Ojtivs Lrn to msh lin gomtry to gnrt CBAR lmnts Bom fmilir with stting up th CBAR orinttion vtor n stion proprtis Lrn to st up multipl lo ss Lrn to viw th iffrnt

More information

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii - Nming frtions Chptr Frtions Eh shp rprsnts ONE whol. i ii Wht frtion is shdd? Writ s frtion nd in words. Wht frtion is not shdd? Writ s frtion nd in words. i ii i ii Writ s mny diffrnt frtions s you

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

Formal Concept Analysis

Formal Concept Analysis Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

HIGHER ORDER DIFFERENTIAL EQUATIONS

HIGHER ORDER DIFFERENTIAL EQUATIONS Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S. ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Fundamental Algorithms for System Modeling, Analysis, and Optimization Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister Kurs INF5080 Ifi, UiO Norsk Rgnsntrl Vårsmstr 2005 Wolfgng Listr This prt of th ours...... is hl t Ifi, UiO... (Wolfgng Listr) n t ontins mtril from Univrsity Collg Krlsruh (Ptr Ol, Clmns Knorzr) Informtion

More information

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012 Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1 Img Procssing - Lsson 4 Gomtric Oprtions nd Morphing Gomtric Trnsformtion Oprtions dpnd on Pil s Coordints. Contt fr. Indpndnt of pil vlus. f f (, ) (, ) ( f (, ), f ( ) ) I(, ) I', (,) (, ) I(,) I (,

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

More information

Module 2 Motion Instructions

Module 2 Motion Instructions Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Computational Biology, Phylogenetic Trees. Consensus methods

Computational Biology, Phylogenetic Trees. Consensus methods Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt

More information

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm]

Basis of test: VDE 0660, part 500/IEC Rated peak withstand current I pk. Ip peak short-circuit current [ka] Busbar support spacing [mm] Powr istriution Short-iruit withstn strngth to EC Short-iruit withstn strngth to EC 439-1 Typ tsting to EC 439-1 During th ours of systm typ-tsting, th following tsts wr onut on th Rittl usr systms n on

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

MSC Studentenwettbewerb. Wintersemester 2012/13. Nastran - Patran

MSC Studentenwettbewerb. Wintersemester 2012/13. Nastran - Patran MSC Stuntnwttwr Wintrsmstr 2012/13 Nstrn - Ptrn Aufg Wi groß ist i mximl Vrshiung? Softwr Vrsion Ptrn 2011 MSC/MD Nstrn 2011 Fils Rquir strut.xmt 3 TUTORIAL Prolm Dsription A lning gr strut hs n sign for

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

CSCI Compiler Design

CSCI Compiler Design CSCI 565 - Compilr Dsign Spring 2013 Sond Tst - Solution My 1, 2013 t 3.30 PM in Room RTH 115 Durtion: 2h 30 min. Pls ll ll pgs you turn in with your nm nd studnt numr. Nm: Numr: Grd: Prolm 1 [20 points]:

More information

135-91G00N ONE-WAY CUSTOMER UNIT FOR VAT 30GX AND Easy-aire 10GX

135-91G00N ONE-WAY CUSTOMER UNIT FOR VAT 30GX AND Easy-aire 10GX ON-WY TV SYSTM OR VT GX UNITS L92 LL -8-999-6 -GN ON-WY USTOMR UNIT OR VT 2GX ND VT 2GX " (8. mm) OLOR D MR IN N NVIRONMNTLLY ONTROLLD HOUSING DIMNSIONS IN MILLIMTRS (DIMNSIONS IN T-INHS) -9GN ON-WY USTOMR

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

(a) v 1. v a. v i. v s. (b)

(a) v 1. v a. v i. v s. (b) Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous

More information

12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1.

12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1. ris - MP - Compt gui ylinr ø, ø, ø, ø, ø, ø, ø, ø ow to Orr Cln sris lif typ (with spilly trt sliing prts) Vuum sution typ (with spilly trt sliing prts) ir ylinr otry tutor - M P - - MW ll ushing ring

More information

Platform quick guide CFD

Platform quick guide CFD CFD Pltform quik gui This onis gui will hlp you to nvigt roun th Nxt Gnrtion pltform n lrn how to us som of th powrful fturs n tools vill. Fin out how to srh from thousns of instrumnts, ss mrkt nws n hrts,

More information

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

More information

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks

More information

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

Analysis for Balloon Modeling Structure based on Graph Theory

Analysis for Balloon Modeling Structure based on Graph Theory Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo

More information

The Procedure Abstraction Part II: Symbol Tables and Activation Records

The Procedure Abstraction Part II: Symbol Tables and Activation Records Th Produr Absrion Pr II: Symbol Tbls nd Aivion Rords Th Produr s Nm Sp Why inrodu lxil soping? Provids ompil-im mhnism for binding vribls Ls h progrmmr inrodu lol nms How n h ompilr kp rk of ll hos nms?

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Amphenol Canada Corp.

Amphenol Canada Corp. HT SINK OPTION = PIN STYL HT SINK (NIKL PLT) N LIP (H=.mm; SN HIGHT) = PIN STYL HT SINK (NIKL PLT) N LIP (H=.mm; PI HIGHT) = PIN STYL HT SINK (NIKL PLT) N LIP (H=.mm; TLL) = PIN-FIN HT SINK (NOIZ, LK)N

More information

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information