On the recognition of de Bruijn graphs and their induced subgraphs

Authors:
Jacek Blazewicz;Piotr Formanowicz;Marta Kasprzak;Daniel Kobler
Affiliations:
Institute of Computing Science, Poznan University of Technology, Piotrowo 3a, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Po ...;Institute of Computing Science, Poznan University of Technology, Piotrowo 3a, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Po ...;Institute of Computing Science, Poznan University of Technology, Piotrowo 3a, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Po ...;Fields Institute, 222 College Street, Toronto, Ontario, Canada
Venue:
Discrete Mathematics
Year:
2002

Citing 4
Cited 3

The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs

Journal of Graph Theory
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
On some properties of DNA graphs

Discrete Applied Mathematics

Recognizing DNA graphs is difficult

Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Complexity of DNA sequencing by hybridization

Theoretical Computer Science
Complexity Issues in Computational Biology

Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue

Quantified Score

Hi-index	0.05

Visualization

Abstract

The directed de Bruijn graphs appear often as models in computer science, because of the useful properties these graphs have. Similarly, the induced subgraphs of these graphs have applications related to the sequencing of DNA chains. In this paper, we show that the directed de Bruijn graphs can be recognized in polynomial time. We also show that it is possible to recognize in polynomial time whether a given directed graph is an induced subgraph of some directed de Bruijn graph with given size of the labels. This result answers a question raised in a previous paper studying the properties of these induced subgraphs.