De Bruijn graphs and DNA graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 27th International Workshop, WG 2001, Proceedings
EditorsA. Brandstädt, V.B. Le
Place of PublicationBerlin
PublisherSpringer
Pages296-305
Number of pages10
ISBN (Print)3540427074, 9783540427070
DOIs
Publication statusPublished - 1 Jan 2001
Event27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 - Boltenhagen, Germany
Duration: 14 Jun 200116 Jun 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2204
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001
CountryGermany
CityBoltenhagen
Period14/06/0116/06/01

Keywords

  • Computational complexity
  • De bruijn graph
  • DNA computing
  • DNA graphs
  • Graph theory
  • NP-hardness
  • Recognition algorithm

Fingerprint Dive into the research topics of 'De Bruijn graphs and DNA graphs'. Together they form a unique fingerprint.

Cite this