Results 131 to 140 of about 2,351 (162)
Lancet2: Improved and accelerated somatic variant calling with joint multi-sample local assembly graphs. [PDF]
NAR Genom BioinformMusunuri RL +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Embedding Cartesian Products of Graphs into de Bruijn Graphs
Journal of Parallel and Distributed Computing, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreae, Thomas +2 more
exaly +3 more sources
On Hypercubes in de Bruijn Graphs
Parallel Processing Letters, 1998We prove that the hypercube of odd dimension 2k + 1 is a subgraph of the de Bruijn graph of alphabet size d and diameter 2 if and only if d ≥ 3 · 2k-1. This complements previous results of Heydemann, Opatrny, and Sotteau (1994) and Andreae et al. (1995), thus yielding a complete solution of the problem of determining, for all integers m, n ≥ 2, the ...
Thomas Andreae, Martin Hintz
openaire +1 more source
De Bruijn Graphs and DNA Graphs.
2001In 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.
Pendavingh, Rudi +2 more
openaire +2 more sources
On the connectivity of the De Bruijn graph
Information Processing Letters, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2014
Genome assembly is usually abstracted as the problem of reconstructing a string from a set of its k-mers. This abstraction naturally leads to the classical de Bruijn graph approach—the key algorithmic technique in genome assembly. While each vertex in this approach is labeled by a string of the fixed length k, the recent genome assembly studies suggest
Yu Lin 0001, Pavel A. Pevzner
openaire +1 more source
Genome assembly is usually abstracted as the problem of reconstructing a string from a set of its k-mers. This abstraction naturally leads to the classical de Bruijn graph approach—the key algorithmic technique in genome assembly. While each vertex in this approach is labeled by a string of the fixed length k, the recent genome assembly studies suggest
Yu Lin 0001, Pavel A. Pevzner
openaire +1 more source
Wide diameters of de Bruijn graphs
Journal of Combinatorial Optimization, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jyhmin Kuo, Hung-Lin Fu
openaire +2 more sources
2-diameter of de Bruijn graphs
Networks, 1996Summary: This paper shows that in the undirected binary de Bruijn graph of dimension \(n\), \(UB(n)\), which has diameter \(n\), there exist at least two internally vertex disjoint paths of length at most \(n\) between any two vertices. In other words, the 2-diameter of \(UB(n)\) is equal to its diameter \(n\).
Qiao Li +2 more
openaire +2 more sources
Spanners of de Bruijn and Kautz graphs
Information Processing Letters, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rabah Harbane, Carles Padró
openaire +1 more source
2015
We are studying a generalization of the de Bruijn graphs, with applications to storage. We use spectral methods to enumerate the Euler circuits in this graph, which correspond to (very long) strings accessing every string of fixed length exactly once, with the reader reset at regular intervals.
openaire +3 more sources
We are studying a generalization of the de Bruijn graphs, with applications to storage. We use spectral methods to enumerate the Euler circuits in this graph, which correspond to (very long) strings accessing every string of fixed length exactly once, with the reader reset at regular intervals.
openaire +3 more sources