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
AbstractA goal of research on DNA computing is to solve problems that are beyond the capabilities of...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
By applying a topological approach due to Kahn, Saks and Sturtevant, we prove all decreasing graph p...
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....
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
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...
<p>A) Shotgun sequences are produced from two different genomes (shown in blue and red at the top). ...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
The de Bruijn graph has become a standard method in the analysis of sequencing reads in computationa...
AbstractWe study parallel complexity of signed graphs motivated by the highly complex genetic recomb...
DNA-based computing provides an alternative to solving optimization problems in graph theory. In thi...
Sekvenciranje DNK, odnosno određivanje poretka nukleotida u genomu, ima važne primjene, kao što su p...
AbstractA goal of research on DNA computing is to solve problems that are beyond the capabilities of...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
By applying a topological approach due to Kahn, Saks and Sturtevant, we prove all decreasing graph p...
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....
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
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...
<p>A) Shotgun sequences are produced from two different genomes (shown in blue and red at the top). ...
AbstractWe prove that recognizing string graphs (i.e., intersection graphs of curves in the plane) a...
The de Bruijn graph has become a standard method in the analysis of sequencing reads in computationa...
AbstractWe study parallel complexity of signed graphs motivated by the highly complex genetic recomb...
DNA-based computing provides an alternative to solving optimization problems in graph theory. In thi...
Sekvenciranje DNK, odnosno određivanje poretka nukleotida u genomu, ima važne primjene, kao što su p...
AbstractA goal of research on DNA computing is to solve problems that are beyond the capabilities of...
AbstractA string graph is the intersection graph of a set of curves in the plane. Each curve is repr...
By applying a topological approach due to Kahn, Saks and Sturtevant, we prove all decreasing graph p...
DOI
Add to ORKG