Abstract
We study the computational complexity of the combinatorial problem Intervalizing Colored Graphs (or ICG) that has some applications in DNA physical mapping. The three distinct conceptual frameworks of N P-completeness, algorithmic techniques for bounded treewidth, and parameterized complexity theory are shown to fit together neatly in an integrated complexity analysis of ICG. It is shown that ICG is intractable in three different ways: (1) it is N P-complete, (2) it is hard for the parameterized complexity class W[1] and (3) it is not finite-state for bounded treewidth or pathwidth, and is therefore resistant to the usual algorithm design methodologies. The proofs of these three results are related in interesting ways which suggest useful heuristic connections between the three complexity frameworks for intractable problems of bounded treewidth and pathwidth.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson and M. Fellows. Finite automata, bounded treewidth and well-quasiordering. Proceedings of the AMS Summer Workshop on Graph Minors (Seattle, 1991), A.M.S. Contemporary Mathematics Series, to appear.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12 (1991), 308–340.
H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993), 226–234.
H. L. Bodlaender, M. R. Fellows and T. Warnow. Two Strikes Against Perfect Phylogeny. In: W. Kuich (editor), Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92). Springer-Verlag, Berlin, Lecture Notes in Computer Science, volume 623, pp. 273–283.
L. Cai, J. Chen, R. Downey and M. Fellows. The Parameterized Complexity of Short Computation and Factorization. Technical Report, Department of Computer Science, University of Victoria, June 1993.
B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990), 12–75.
R. G. Downey and M. R. Fellows. Fixed parameter intractability. Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory (1992), 36–49.
R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness II: on completeness for W[1]. To appear.
G. A. Evans. Combinatoric strategies for genome mapping. Bioassays 13 (1991), 39–44.
M. R. Fellows, M. T. Hallett and H. T. Wareham. The parameterized complexity of DNA physical mapping. Technical Report, Computer Science Department, University of Victoria, 1993.
M. R. Fellows and M. T. Hallett. Bandwidth is hard for W[1]. Manuscript, July, 1993.
M. Golumbic, H. Kaplan and R. Shamir. On the complexity of DNA physical mapping. Technical Report 271/93, Tel Aviv University, January 1993.
S. Kannan and T. Warnow. Triangulating three-colored graphs. Proceedings Second Annual ACM-SIAM Symposium on Discrete Algorithms (1991), 337–343. To appear, SIAM J. Discr. Math.
F. R. McMorris, T. Warnow, and T. Wimer. Triangulating vertex colored graphs. To appear, SIAM J. Discr. Math.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M.R., Hallett, M.T., Wareham, H.T. (1993). DNA physical mapping: Three ways difficult. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_52
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive