Exact and Approximation Algorithms for Sorting By Reversals, With Application to Genome Rearrangement:(精确和近似算法排序的逆转,应用基因组重排).pdfVIP
- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Exact and approximation algorithms
for sorting by reversals with application
to genome rearrangement
y z
John Kececioglu David Sanko
Octob er revised February
Abstract Motivated by the problem in computational biology of reconstructing
the series of chromosome inversions by which one organism evolved from another
we consider the problem of computing the shortest series of reversals that trans
form one p ermutation to another The p ermutations describ e the order of genes
on corresp onding chromosomes and a reversal takes an arbitrary substring of
elements and reverses their order
For this problem we develop two algorithms a greedy approximation algorithm
that nds a solution provably close to optimal in O n 2 time and O n space for
an n element p ermutation and a branch and b ound exact algorithm that nds
an optimal solution in O mL n n time and O n 2 space where m is the size
of the branch and b ound search tree and L n n is the time to solve a linear
program of n variables and n constraints The greedy algorithm is the rst to
come within a constant factor of the optimum it guarantees a solution that uses
no more than twice the minimum numb er of reversals The lower and upp er
b ounds of the branch and b ound algorithm are a novel application of maximum
weight matchings shortest paths and linear programming
In a series of exp eriments we study the p erformance of an implementation
on random p ermutations and p ermutations generated by random reversals For
p ermutations
您可能关注的文档
- Control of Systems Integrating Logic, Dynamics, and Constraints:(控制系统集成逻辑、动态和约束).pdf
- Convex polytopes:(凸多面体).pdf
- Cooperation and Punishment in Public Goods Experiments:(合作和惩罚在公共物品实验).pdf
- Costly search and mutual fund flows:(昂贵的搜索和共同基金流动).pdf
- Current approaches to change blindness:(当前的方法改变失明).pdf
- Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces:(数据结构和算法的最近邻搜索一般度量空间).pdf
- Database-friendly Random Projections:(Database-friendly随机预测).pdf
- Decision Combination in Multiple Classifier Systems:(决定在多个分类器组合系统).pdf
- Denial of Service in Sensor Networks:(在传感器网络拒绝服务).pdf
- Design and development of multidevice user interfaces through multiple logical descriptions:(正如用户界面的设计和开发多个逻辑描述).pdf
- Experiences with an Architecture for Intelligent, Reactive Agents:(经历一个智能架构,活性代理).pdf
- Explaining Collaborative Filtering Recommendations:(解释了协同过滤推荐).pdf
- Explicit Allocation of Best-Effort Packet Delivery Service:(显式分配的最优包送货服务).pdf
- Exposure In Wireless Ad-Hoc Sensor Networks:(暴露在无线特别的传感器网络).pdf
- Exploiting virtual synchrony in distributed systems:(利用虚拟同步分布式系统).pdf
- Extracting product features and opinions from reviews:(从评论中提取产品特性和意见).pdf
- FASB Issues FSP Affecting Companies Emerging From Bankruptcy FASB Issues Guidance on Intangible Assets Subject:(FASB问题影响公司走出破产FASB FSP问题无形资产方面的指导).pdf
- FASB Issues Guidance on Endowments FASB Issues Revised Exposure Draft on Earnings per Share:(FASB问题指导禀赋FASB修订意见稿对每股收益的问题).pdf
- Fast approximate energy minimization via graph cuts:(通过削减图快速近似能量最小化).pdf
- Fast Computation of Low Rank Matrix Approximations:(快速计算的低秩矩阵近似).pdf
文档评论(0)