Abstract
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs. In particular, the recognition of DNA graphs is shown to be NP-hard; DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. As a consequence, two open questions from a recent paper by Błażewicz, Hertz, Kobler & de Werra [Discrete Applied Mathematics 98, 1999] are answered in the negative.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Bains and G.C. Smith [1988]. A novel method for nucleic acid sequence determination. Journal of Theoretical Biology 135, 303–307.
J. Błażwicz, P. Formanowicz, M. Kasprzak, and D. Kobler [1999]. On the recognition of De Bruijn graphs and their induced subgraphs. Manuscript, September 1999.
J. Błażwicz, A. Hertz, D. Kobler, and D. de Werra [1999]. On some properties of DNA graphs. Discrete Applied Mathematics 98, 1–19.
N.G. de Bruijn [1946]. A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam. Proceedings 49, 758–764.
M.R. Garey and D.S. Johnson [1979]. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
J. Håstad [1997]. Some optimal inapproximability results. Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC’97), 1–10.
S. Khanna, N. Linial, and S. Safra [1993]. On the hardness of approximating the chromatic number. Proceedings of the 2nd Israeli Symposium on Theory and Computing Systems (ISTCS’93), 250–260.
M.R. Samathan and D.K. Pradhan [1989]. The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI. IEEE Transactions on Computers 38, 567–581.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pendavingh, R., Schuurman, P., Woeginger, G.J. (2001). De Bruijn Graphs and DNA Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive