Branch-and-cut approach to physical mapping with end-probes

Thomas Christof, Michael Juenger, John Kececioglu, Petra Mutzel, Gerhard Reinelt

Research output: Contribution to conferencePaperpeer-review

17 Scopus citations


A fundamental problem in computational biology is the construction of physical maps of chromosomes from hybridization experiments between unique probes and clones of chromosome fragments in the presence of error. Alizadeh, Karp, Weisser and Zweig [AKWZ94] first considered a maximum-likelihood model of the problem that is equivalent to finding an ordering of the probes that minimizes a weighted sum of errors, and developed several effective heuristics. We show that by exploiting information about the end-probes of clones, this model can be formulated as a weighted Betweenness Problem. This affords the significant advantage of allowing the well-developed tools of integer linear-programming and branch-and-cut algorithms to be brought to bear on physical mapping, enabling us for the first time to solve small mapping instances to optimality even in the presence of high error. We also show that by combining the optimal solution of many small overlapping Betweenness Problems, one can effectively screen errors from larger instances, and solve the edited instance to optimality as a Hamming-Distance Traveling Salesman Problem. This suggests a new combined approach to physical map construction.

Original languageEnglish (US)
Number of pages9
StatePublished - 1997
EventProceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB - Santa Fe, NM, USA
Duration: Jan 20 1997Jan 23 1997


OtherProceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB
CitySanta Fe, NM, USA

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Branch-and-cut approach to physical mapping with end-probes'. Together they form a unique fingerprint.

Cite this