Structural properties and tractability results for linear synteny

详细信息    查看全文

• 作者：David Liben-Nowell ; Jon Kleinberg
• 关键词：Genome rearrangements ; Comparative genomics ; Synthetic distance ; Scheduling problems
• 刊名：Journal of Discrete Algorithms
• 出版年：2004
• 出版时间：June 2004
• 年：2004
• 卷：2
• 期：2
• 页码：207-228
• 全文大小：310 K

文摘

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.