Recognizing DNA graphs is difficult

Share/Save/Bookmark

Pendavingh, Rudi and Schuurman, Petra and Woeginger, Gerhard J. (2003) Recognizing DNA graphs is difficult. Discrete Applied Mathematics, 127 (1). pp. 85-94. ISSN 0166-218X

[img] PDF
Restricted to UT campus only
: Request a copy
119kB
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 B a ewicz et al. (Discrete Appl. Math. 98, (1999) 1) are answered in the negative.
Item Type:Article
Copyright:© 2003 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74951
Official URL:http://dx.doi.org/10.1016/S0166-218X(02)00287-1
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 213202