ON THE COMPLEXITY OF DNA PHYSICAL MAPPING

被引：57

作者：

GOLUMBIC, MC ^{[1
]}

KAPLAN, H ^{[1
]}

SHAMIR, R ^{[1
]}

机构：

[1] TEL AVIV UNIV, SACKLER FAC EXACT SCI, DEPT COMP SCI, IL-69978 TEL AVIV, ISRAEL

来源：

ADVANCES IN APPLIED MATHEMATICS | 1994年 / 15卷 / 03期

关键词：

D O I：

10.1006/aama.1994.1009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The physical mapping problem is to reconstruct the relative position of fragments (clones) of DNA along the genome from information on their pairwise overlaps. We show that two simplified versions of the problem belong to the class of NP-complete problems, which are conjectured to be computationally intractable. In one version all clones have equal length, and in another clone lengths may be arbitrary. The proof uses tools from graph theory and complexity. (C) 1994 Academic Press, Inc.

引用

页码：251 / 261

页数：11