An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
On physical mapping and the consecutive ones property for sparse matrices
Discrete Applied Mathematics - Special volume on computational molecular biology
Physical mapping of chromosomes using unique probes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Test for the Consecutive Ones Property
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.03 |
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.