Algorithms for computing and integrating physical maps using unique probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Temporal representation and reasoning in artificial intelligence: Issues and approaches
Annals of Mathematics and Artificial Intelligence
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Hardness of edge-modification problems
Theoretical Computer Science
Near-optimal solutions for the generalized max-controlled set problem
Computers and Operations Research
A clustering algorithm for interval graph test on noisy data
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Complexity issues for the sandwich homogeneous set problem
Discrete Applied Mathematics
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Planar disjoint-paths completion
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
Recognition of probe proper interval graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
The physical mapping problem is to reconstruct the relative position of fragments (clones) of DNA along the genome from information on their pairwise overlaps. We show that two simplified versions of the problem belong to the class of NP-complete problems, which are conjectured to be computationally intractable. In one version all clones have equal length, and in another clone lengths may be arbitrary. The proof uses tools from graph theory and complexity.