De Bruijn Graphs and DNA Graphs

Authors:
Rudi Pendavingh;Petra Schuurman;Gerhard J. Woeginger
Affiliations:
-;-;-
Venue:
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2001

Citing 4
Cited 0

The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On some properties of DNA graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

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.