Results 1 - 10 of 750

using de Bruijn graphs

by Daniel R. Zerbino, Ewan Birney, David Hern, Patrice François, Laurent Farinelli, Et Al, Jonathan Butler, Iain Maccallum, Michael Kleber, Et Al, Juliane C. Dohm, Claudio Lottaz, Tatiana Borodina, Et Al, Daniel R. Zerbino, Ewan Birney , 2007
"... graphs Velvet: Algorithms for de novo short read assembly using de Bruijn ..."
Abstract - Add to MetaCart
graphs Velvet: Algorithms for de novo short read assembly using de Bruijn

De Bruijn Sequences Revisited

by Lila Kari, Zhi Xu
"... A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of or ..."
Abstract - Add to MetaCart
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence

Enumerating De Bruijn sequences

by Vladimir Raphael Rosenfeld - MATCH Communications in Mathematical and in Computer Chemistry
"... A cycle is a sequence taken in a circular order—that is, follows, and are all the same cycle as. Given natural numbers and, a cycle of letters is called a complete cycle [1, 2], or De Bruijn sequence, if subsequences consist of all possible ordered sequences over the alphabet. In 1946, De Bruijn pro ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
A cycle is a sequence taken in a circular order—that is, follows, and are all the same cycle as. Given natural numbers and, a cycle of letters is called a complete cycle [1, 2], or De Bruijn sequence, if subsequences consist of all possible ordered sequences over the alphabet. In 1946, De Bruijn

De Bruijn Networks

by Darcy L. Quesnel , 1995
"... Here we consider the de Bruijn network, a fixed-degree hypercubic network topology. De Bruijn graphs have enjoyed a recent popularity as a proposed basis of multicomputer interconnection networks. We'll explore various characteristics that make de Bruijn graphs attractive. 1 Introduction ..."
Abstract - Add to MetaCart
Here we consider the de Bruijn network, a fixed-degree hypercubic network topology. De Bruijn graphs have enjoyed a recent popularity as a proposed basis of multicomputer interconnection networks. We'll explore various characteristics that make de Bruijn graphs attractive. 1 Introduction

DE BRUIJN GRAPH HOMOMORPHISMS AND RECURSIVE DE BRUIJN SEQUENCES

by Abbas Alhakim, Mufutau Akinwande , 812
"... Abstract. This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between ..."
Abstract - Add to MetaCart
Abstract. This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms

On The De Bruijn Torus Problem

by Glenn Hurlbert, Garth Isaak - J. Combin. Theory Ser. A , 1995
"... A (k n ; n) k -de Bruijn Cycle is a cyclic k-ary sequence with the property that every k-ary n-tuple appears exactly once contiguously on the cycle. A (k r ; k s ; m; n) k -de Bruijn Torus is a k-ary k r k s toroidal array with the property that every k-ary m n matrix appears exactly once contiguous ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
A (k n ; n) k -de Bruijn Cycle is a cyclic k-ary sequence with the property that every k-ary n-tuple appears exactly once contiguously on the cycle. A (k r ; k s ; m; n) k -de Bruijn Torus is a k-ary k r k s toroidal array with the property that every k-ary m n matrix appears exactly once

On the representation of de Bruijn graphs

by Rayan Chikhi, Antoine Limasset, Shaun Jackman, Jared T. Simpson, Paul Medvedev
"... Abstract. The de Bruijn graph plays an important role in bioinformatics, especially in the context of de novo assembly. However, the representation of the de Bruijn graph in memory is a computational bottleneck for many assemblers. Recent papers proposed a navigational data structure approach in ord ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. The de Bruijn graph plays an important role in bioinformatics, especially in the context of de novo assembly. However, the representation of the de Bruijn graph in memory is a computational bottleneck for many assemblers. Recent papers proposed a navigational data structure approach

COLOURING OF CYCLES IN THE DE BRUIJN GRAPHS

by Ewa Lazuka
"... We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k − 1, where each vertex belongs to exactly two cycles of diff ..."
Abstract - Add to MetaCart
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k − 1, where each vertex belongs to exactly two cycles

Generalized de Bruijn Cycles

by Joshua N. Cooper, Ronald L. Graham - ANNALS OF COMBINATORICS , 2004
"... For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo q n so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence of su ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo q n so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence

Dominating sets in de Bruijn graphs

by Zoltán Blázsik, Zoltán Kása , 2002
"... In this paper we deal with different type of dominating sets in de Bruijn graphs and we prove a conjecture on perfect dominating sets. ..."
Abstract - Add to MetaCart
In this paper we deal with different type of dominating sets in de Bruijn graphs and we prove a conjecture on perfect dominating sets.
Results 1 - 10 of 750