On the complexity of DNA physical mapping

Martin Charles Golumbic, Haim Kaplan, Ron Shamir

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)251-261
Number of pages11
JournalAdvances in Applied Mathematics
Issue number3
StatePublished - Sep 1994
Externally publishedYes

ASJC Scopus subject areas

  • Applied Mathematics


Dive into the research topics of 'On the complexity of DNA physical mapping'. Together they form a unique fingerprint.

Cite this