AbstractDNA 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
Bioinformatics is a new and interesting field of research, and genuine discoveries are being made al...
Combinatorial problems arise in many areas of computer science and application domains. It involves ...
A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illu...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
AbstractThe directed de Bruijn graphs appear often as models in computer science, because of the use...
AbstractMolecular biology which aims to study DNA and protein structure and functions, has stimulate...
Molecular biology which aims to study DNA and protein structure and functions, has stimu-lated resea...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented ...
DNA-based computing provides an alternative to solving optimization problems in graph theory. In thi...
AbstractWe study parallel complexity of signed graphs motivated by the highly complex genetic recomb...
The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as...
Bioinformatics is a new and interesting field of research, and genuine discoveries are being made al...
Combinatorial problems arise in many areas of computer science and application domains. It involves ...
A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illu...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
AbstractThe directed de Bruijn graphs appear often as models in computer science, because of the use...
AbstractMolecular biology which aims to study DNA and protein structure and functions, has stimulate...
Molecular biology which aims to study DNA and protein structure and functions, has stimu-lated resea...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented ...
DNA-based computing provides an alternative to solving optimization problems in graph theory. In thi...
AbstractWe study parallel complexity of signed graphs motivated by the highly complex genetic recomb...
The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as...
Bioinformatics is a new and interesting field of research, and genuine discoveries are being made al...
Combinatorial problems arise in many areas of computer science and application domains. It involves ...
A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illu...
DOI
Add to ORKG