Recognizing DNA graphs is difficult

Authors:
Rudi Pendavingh;Petra Schuurman;Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands;Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, Netherlands and Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, Austr ...
Venue:
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Year:
2003

Citing 5
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
On the recognition of de Bruijn graphs and their induced subgraphs

Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. 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. As a consequence, two open questions from a recent paper by Biazewicz et al. (Discrete Appl. Math. 98, (1999) 1) are answered in the negative.