@inproceedings{623f2864bf044bb18c78917ae21d82af,

title = "De Bruijn graphs and DNA graphs",

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 Blazewicz, Hertz, Kobler & de Werra [Discrete Applied Mathematics 98, 1999] are answered in the negative.",

keywords = "Computational complexity, De bruijn graph, DNA computing, DNA graphs, Graph theory, NP-hardness, Recognition algorithm",

author = "Rudi Pendavingh and Petra Schuurman and Woeginger, {Gerhard J.}",

year = "2001",

month = jan,

day = "1",

doi = "10.1007/3-540-45477-2_27",

language = "English",

isbn = "3540427074",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "296--305",

editor = "A. Brandst{\"a}dt and V.B. Le",

booktitle = "Graph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001, Proceedings",

address = "Germany",

note = "27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 ; Conference date: 14-06-2001 Through 16-06-2001",

}