期刊
THEORETICAL COMPUTER SCIENCE
卷 395, 期 2-3, 页码 193-202出版社
ELSEVIER
DOI: 10.1016/j.tcs.2008.01.013
关键词
multi-break; reversal; translocation; transposition; genome rearrangement; breakpoint graph; genomic distance
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While multi-break rearrangements were studied in depth for k = 2 breaks, the k-break distance problem for arbitrary k remains unsolved. We prove a duality theorem for multi-break distance problem and give a polynomial algorithm for computing this distance. (c) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据