- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
A sequence is a list of objects in some order. For example, (7, 21, 57) A sequence with k elements is a k-tuple. A sequence is different from a set in that repetition is allowed in the former but not in the later. DNAs and proteins are perfect examples of sequences with different alphabets. {G, A, T, C} for DNA {20 amino acids} for proteins. Sequence alignment is to check how well two or more sequences match with each other. Similarity means homology, ie, coming from a common source. “Nature is a tinkerer and not an inventor.” ---Jacob 1977 Global vs local alignment Global alignment - aaagcggaagtcacag ||.||.||||| |.|| aaggctgaagt-atag Local alignment - : aaagcggaagtcacag ......||||| .... aaggctgaagt-atag How many ways of intercalating two sequences of lengths n and m? Any pair-wise alignment can be transformed into an intercalated sequence. A completed alignment matrix Dynamic Programming Pros and Cons Advantages: Guaranteed in a mathematical sense to provide the optimal (very best or highest-scoring) alignment for a given set of scoringfunctions. Disadvantages: a) Slow due to the very large number of computational steps: O(n 2).b) Computer memory requirement also increases as the square of the sequence lengths. Therefore, it is difficult to use the method for very long sequences. FASTA and BLAST FASTA - Idea - Problem of Dynamic Programming D.P. compute the score in a lot of useless area for optimal sequence FASTA focuses on diagonal area FASTA - Heuristic - Heuristic Good local alignment should have some exact match subsequence. FASTA - Hi Level Algorithm - Hi level algorithm Let q be a query max ? 0 For each sequence, s in DB compare q with s and compute a score, y if max y max ? y; bestSequence ? s ; Return bestSequence FASTA - Algorithm - Step 1 Find all hot-spots (matching words) // Hot spots are pairs of words of length k (k-tuple) that exa
文档评论(0)