A branch-and-cut approach to physical mapping with end-probes

Christof, Thomas and Jünger, Michael and Kececioglu, John and Mutzel, Petra and Reinelt, Gerhard (1997) A branch-and-cut approach to physical mapping with end-probes.
Published In: Proceedings of the First Annual International Conference on Computational Molecular Biology : January 19 - 22, 1997, Eldorado Hotel, Santa Fe, New Mexico ACM 1997, pp. 84-92.


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 (Algorithmica 13:1/2, 52-76, 1995) 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.

Download: [img] Postscript - Preprinted Version
Download (243kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Deposit Information:
ZAIK Number: zpr96-250
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 08 May 2003 00:00
Last Modified: 19 Jan 2012 09:17
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/250