On Clone Assembly Problems An Error-Tolerant Test for Interval 克隆装配问题的区间容错性测试.pptVIP

下载本文档

1
0
约8.15千字
约 29页
2018-06-24 发布于四川
举报
版权申诉

On Clone Assembly Problems An Error-Tolerant Test for Interval 克隆装配问题的区间容错性测试.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

On Clone Assembly Problems An Error-Tolerant Test for Interval 克隆装配问题的区间容错性测试

* * We only assume u1 is the smallest, but then the remaining ones are not ordered according to CLO * For Case 2. k I, it is an exercise. */28 Interval Graph Test */28 Chordal Graphs A chord of a cycle C is an edge not in C whose endpoints lie in C An chordless cycle in G is a cycle of length at least 4 in G that has no chord A graph G is chordal if it is simple and has no chordless cycle (also called triangulated graph) An induced subgraph on V’ is a subgraph with node set V’ and all possible edges between nodes in V’. */28 Perfect Elimination Ordering A vertex of G is simplicial if its neighborhood in G is a clique A perfect elimination ordering (PEO) is an ordering v1 , …, vn–1, vn for deletion of vertices so that each vi is a simplicial vertex of the remaining graph induced by {vi, …, vn-1, vn} */28 Perfect Elimination Ordering v1, v2, v3, v4, v5, v6 is a perfect elimination ordering v1 v2 v4 v3 v5 v6 */28 Characterization of Chordal Graphs A graph is chordal ? it has a perfect elimination ordering We prove this theorem through an algorithm that construct a PEO (much like the planarity test) */28 Lexicographic BFS (LBFS) LBFS is used to obtain a perfect elimination ordering for chordal graphs vn vn-1 vn */28 LBFS and PEO Theorem 1. If G is a chordal graph, then LBFS will produce a PEO. Let the ordering produced by LBFS be O The neighbors of u ordered after u form a clique (i.e. u is simplicial in the remaining graph) How do you prove this? */28 Lemma 1 In the LBFS, if there are vertices u, x, y s.t. L(u) L(x) L(y) and (u,y) ? G but (x,y) ? G, then there must exist a vertex z with L(y) L(z) s.t. (x,z) ? G but (u,z) ? G Suppose not. Then every neighbor of x after y is also a neighbor of u. But then, u should be ranked higher than x after we process y in the LBFS ordering. y u x y u x z */28 Proof of Theorem 1 (I) Prove by contradiction. Suppose there exist vertices u, x, y s.t. L(u) L(x) L(y) and (u,x), (u,y) ? G but (x,y) ? G. WLOG, let