The Complexity of Physical Mapping with Strict Chimerism

We analyze the algorithmic complexity of physical mapping by hybridization in situations of restricted forms of chimeric errors, which is motivated by typical experimental conditions. The constituents of a chimeric probe always occur in pure form in the data base, too. This problem can be modelled by a variant of the k-consecutive ones problem. We show that even under this restriction the corresponding decision problem is NP -complete. Considering the most important situation of strict 2-chimerism, for the related optimization problem a complete separation between effciently solvable and NP -hard cases is given based on the sparseness parameters of the clone library. For the favourable case we present a fast algorithm and a data structure that provides an effective description of all optimal solutions to the problem.

[1]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[2]  Haim Kaplan,et al.  Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Martin Middendorf,et al.  On Physical Mapping and the Consecutive Ones Property for Sparse Matrices , 1996, Discret. Appl. Math..

[4]  Wen-Lian Hsu,et al.  A Simple Test for the Consecutive Ones Property , 1992, J. Algorithms.

[5]  Lee Aaron Newberg,et al.  Physical mapping of chromosomes: A combinatorial problem in molecular biology , 1995, SODA '93.

[6]  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..

[7]  Haim Kaplan,et al.  Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..

[8]  Rolf H. Möhring,et al.  An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..

[9]  David S. Greenberg,et al.  Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation , 1995, J. Comput. Biol..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Geoffrey Zweig,et al.  Physical mapping of chromosomes using unique probes , 1994, SODA '94.

[12]  Wen-Lian Hsu.  On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property , 1997, COCOON.

[13]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[14]  David S. Greenberg,et al.  The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data , 1994, Comput. Chem..