论文信息 - Consecutive Ones and a Betweenness Problem in Computational Biology

Consecutive Ones and a Betweenness Problem in Computational Biology

In this paper we consider a variant of the betweenness prob- lem occurring in computational biology. We present a new polyhedral approach which incorporates the solution of consecutive ones problems and show that it supersedes an earlier one. A particular feature of this new branch-and-cut algorithm is that it is not based on an explicit integer programming formulation of the problem and makes use of automatically generated facet-defining inequalities.

[1] Kellogg S. Booth. PQ-tree algorithms. , 1975 .

[2] Eugene W. Myers,et al. Algorithms for computing and integrating physical maps using unique probes , 1997, RECOMB '97.

[3] Stefan Thienel,et al. ABACUS - a branch-and-CUt system , 1995 .

[4] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[5] Panos M. Pardalos,et al. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[6] Michael Jünger,et al. A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes , 1997, J. Comput. Biol..

[7] Michael Jünger,et al. Introduction to ABACUS - a branch-and-cut system , 1998, Oper. Res. Lett..

[8] A. Tucker,et al. A structure theorem for the consecutive 1's property☆ , 1972 .

[9] Harold Fredricksen. Generation of the Ford Sequence of Length 2n, n Large , 1972, J. Comb. Theory, Ser. A.