資源描述:
《Dynamic Programming Sequence alignment:動(dòng)態(tài)規(guī)劃序列比對(duì)ppt課件.ppt》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在教育資源-天天文庫(kù)。
1、DNASequenceComparison:FirstSuccessStoryFindingsequencesimilaritieswithgenesofknownfunctionisacommonapproachtoinferanewlysequencedgene’sfunctionIn1984RussellDoolittleandcolleaguesfoundsimilaritiesbetweencancer-causinggeneandnormalgrowthfactor(PDGF)geneAnormalgrowthgeneswitchedonatthewrongtimeca
2、usescancer!CysticFibrosisCysticfibrosis(CF)isachronicandfrequentlyfatalgeneticdiseaseofthebody'smucusglands.CFprimarilyaffectstherespiratorysystemsinchildren.SearchfortheCFgenewasnarrowedto~1Mbp,andtheregionwassequenced.Scannedadatabaseformatchestoknowngenes.Asegmentinthisregionmatchedthegenef
3、orsomeATPbindingprotein(s).Theseproteinsarepartoftheiontransportchannel,andCFinvolvessweatsecretionswithabnormalsodiumcontent!RoleforBioinformaticsGenesimilaritiesbetweentwogeneswithknownandunknownfunctionalertbiologiststosomepossibilitiesComputingasimilarityscorebetweentwogenestellshowlikelyi
4、tisthattheyhavesimilarfunctionsDynamicprogrammingisatechniqueforrevealingsimilaritiesbetweengenesMotivatingDynamicProgrammingDynamicprogrammingexample:ManhattanTouristProblemImagineseekingapath(fromsourcetosink)totravel(onlyeastwardandsouthward)withthemostnumberofattractions(*)intheManhattang
5、ridSink***********Source*Imagineseekingapath(fromsourcetosink)totravel(onlyeastwardandsouthward)withthemostnumberofattractions(*)intheManhattangridSink***********Source*Dynamicprogrammingexample:ManhattanTouristProblemManhattanTouristProblem:FormulationGoal:Findthelongestpathinaweightedgrid.I
6、nput:AweightedgridGwithtwodistinctvertices,onelabeled“source”andtheotherlabeled“sink”O(jiān)utput:AlongestpathinGfrom“source”to“sink”MTP:AnExample32407333013244564655822501230123jcoordinateicoordinate13sourcesink432401024331122241995152302034MTP:GreedyAlgorithmIsNotOptimal1252152340005303501035512pr
7、omisingstart,butleadstobadchoices!sourcesink1822MTP:SimpleRecursiveProgramMT(n,m)ifn=0orm=0returnMT(n,m)x?MT(n-1,m)+lengthoftheedgefrom(n-1,m)to(n,m)y?MT(n,m-1)+lengthoftheedgefrom(n,m-1)to(n,m)returnmax{x,y}What’swrongwiththisapproach?