Results 141 to 150 of about 2,351 (162)

Generalized de Bruijn graphs

J. Inf. Process. Cybern., 1994
Summary: The class GBG of the generalized de Bruijn graphs introduced here covers over the class BG of the de Bruijn graphs. Every graph of BG is the union of factors describing an activity of technical arrangements which are called \(k\)-shift-registers.
Zdzislaw Grodzki, Aleksander Wronski
openaire   +1 more source

Recoloring the Colored de Bruijn Graph

2018
The colored de Bruijn graph, an extension of the de Bruijn graph, is routinely applied for variant calling, genotyping, genome assembly, and various other applications [11]. In this data structure, the edges are labeled with one or more colors from a set \(\{c_1, \dots , c_{\alpha } \}\), and are stored as a \(m \times \alpha \) matrix, where m is the ...
Bahar Alipanahi, Alan Kuhnle, Christina Boucher 0001   +2 more
openaire   +1 more source

Perfect factors in the de Bruijn graph

Designs, Codes and Cryptography, 1995
The \(c\)-ary \(u\)-th order de Bruijn graph, denoted \(G_{u,c}\), is defined to be the digraph whose vertices are the \(u\)-tuples of elements of an alphabet \(A\), \(| A|= c\), with an arc from vertex \((x_ 1,\dots, x_ u)\) to vertex \((y_ 1,\dots, y_ u)\) if \(x_{i+ 1}= y_ i\) for \(i= 1,\dots, u-1\).
openaire   +1 more source

Embeddings of Hypercubes and Grids into de Bruijn Graphs

Journal of Parallel and Distributed Computing, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau   +2 more
openaire   +2 more sources

Consensus on de Bruijn graphs

The European Physical Journal B, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan, G., Fu, Z.-Q., Chen, G.
openaire   +2 more sources

Random Walks on de Bruijn Graphs.

Theory of Probability & Its Applications, 1993
See the review in Zbl 0753.60062.
openaire   +1 more source

A De Bruijn-Erdős Theorem in Graphs?

2018
A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chvátal asked whether the same statement holds true in general metric spaces, where the line determined by points $x$ and $y$ is defined as the set consisting of $x$, $y$, and all points $z$ such that one of the ...
openaire   +1 more source

On the Hardness of Sequence Alignment on De Bruijn Graphs

Journal of Computational Biology, 2022
Sharma V Thankachan, Daniel Gibney, Srinivas Aluru   +2 more
exaly  

From de Bruijn Graphs to Variation Graphs – Relationships Between Pangenome Models

Lecture Notes in Computer Science, 2023
Norbert Dojer, Adam Cicherski
exaly  

Generalized de Bruijn graphs

Discrete Mathematics and Applications, 2022
exaly