首页    期刊浏览 2025年07月10日 星期四
登录注册

文章基本信息

  • 标题:Finding Local Genome Rearrangements
  • 本地全文:下载
  • 作者:Pijus Simonaitis ; Krister M. Swenson
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:88
  • 页码:24:1-24:13
  • DOI:10.4230/LIPIcs.WABI.2017.24
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:The Double Cut and Join (DCJ) model of genome rearrangement is well studied due to its mathematical simplicity and power to account for the many events that transform genome architecture. These studies have mostly been devoted to the understanding of minimum length scenarios transforming one genome into another. In this paper we search instead for DCJ rearrangement scenarios that minimize the number of rearrangements whose breakpoints are unlikely due to some biological criteria. We establish a link between this Minimum Local Scenario (MLS) problem and the problem of finding a Maximum Edge-disjoint Cycle Packing (MECP) on an undirected graph. This link leads us to a 3/2-approximation for MLS, as well as an exact integer linear program. From a practical perspective, we briefly report on the applicability of our methods and the potential for computation of distances using a more general DCJ cost function.
  • 关键词:genome rearrangement; double cut and join; maximum edge-disjoint cycle packing; Hi-C; NP-complete; approximation algorithm
国家哲学社会科学文献中心版权所有