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.
| Original language | English |
|---|---|
| Title of host publication | Graph-Theoretic Concepts in Computer Science |
| Subtitle of host publication | 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings |
| Editors | Andreas Brandstädt, Van Bang Le |
| Publisher | Springer |
| Pages | 296-305 |
| ISBN (Electronic) | 978-3-540-45477-9 |
| ISBN (Print) | 978-3-540-42707-0 |
| DOIs | |
| Publication status | Published - 2001 |
| Event | 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 - Boltenhagen, Germany Duration: 14 Jun 2001 → 16 Jun 2001 Conference number: 27 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 2204 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 |
|---|---|
| Abbreviated title | WG |
| Country | Germany |
| City | Boltenhagen |
| Period | 14/06/01 → 16/06/01 |
Keywords
- METIS-203193
Fingerprint Dive into the research topics of 'De Bruijn graphs and DNA graphs'. Together they form a unique fingerprint.
Cite this
Pendavingh, R., Schuurman, P., & Woeginger, G. (2001). De Bruijn graphs and DNA graphs. In A. Brandstädt, & V. B. Le (Eds.), Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings (pp. 296-305). (Lecture Notes in Computer Science; Vol. 2204). Springer. https://doi.org/10.1007/3-540-45477-2_27