TY - JOUR
T1 - On the complexity of DNA physical mapping
AU - Golumbic, Martin Charles
AU - Kaplan, Haim
AU - Shamir, Ron
PY - 1994/9
Y1 - 1994/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0043050021&partnerID=8YFLogxK
U2 - 10.1006/aama.1994.1009
DO - 10.1006/aama.1994.1009
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0043050021
SN - 0196-8858
VL - 15
SP - 251
EP - 261
JO - Advances in Applied Mathematics
JF - Advances in Applied Mathematics
IS - 3
ER -