Javascript must be enabled to continue!
Multi de Bruijn Sequences and the Cross-Join Method
View through CrossRef
We show a method to construct binary multi de Bruijn sequences using the cross-join method. We extend the proof given by Alhakim for ordinary de Bruijn sequences to the case of multi de Bruijn sequences. In particular, we establish that all multi de Bruijn sequences can be obtained by cross-joining an ordinary de Bruijn sequence concatenated with itself an appropriate number of times. We implemented the generation of all multi de Bruijn sequences of type C(2,2,2) and C(3,2,2). We experimentally confirm that some multi de Bruijn sequences can be generated by Galois Nonlinear Feedback Shift Registers (NLFSRs). It is supposed that all multi de Bruijn sequences can be generated using Galois NLFSRs.
Title: Multi de Bruijn Sequences and the Cross-Join Method
Description:
We show a method to construct binary multi de Bruijn sequences using the cross-join method.
We extend the proof given by Alhakim for ordinary de Bruijn sequences to the case of multi de Bruijn sequences.
In particular, we establish that all multi de Bruijn sequences can be obtained by cross-joining an ordinary de Bruijn sequence concatenated with itself an appropriate number of times.
We implemented the generation of all multi de Bruijn sequences of type C(2,2,2) and C(3,2,2).
We experimentally confirm that some multi de Bruijn sequences can be generated by Galois Nonlinear Feedback Shift Registers (NLFSRs).
It is supposed that all multi de Bruijn sequences can be generated using Galois NLFSRs.
Related Results
Phased Multi de Bruijn Sequences
Phased Multi de Bruijn Sequences
We introduce phased multi de Bruijn sequences, a generalization of de Bruijn sequences. A phased string is a string whose positions sequentially rotate through several alphabets; e...
Using join.me to help library patrons
Using join.me to help library patrons
PurposeAs the Informatics Librarian at Olivet Nazarene University, my staff and I are often responsible for troubleshooting our patrons' technology issues. My experience with join....
Building Large Updatable Colored de Bruijn Graphs via Merging
Building Large Updatable Colored de Bruijn Graphs via Merging
MOTIVATION: There exists several massive genomic and metagenomic data collection efforts, including GenomeTrakr and MetaSub, which are routinely updated with new data. To analyze s...
TriJoin: A Time-Efficient and Scalable Three-Way Distributed Stream Join System
TriJoin: A Time-Efficient and Scalable Three-Way Distributed Stream Join System
<p>Stream join is one of the most fundamental operations in data stream processing applications. Existing distributed stream join systems can support efficient two-way join, ...
Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels
Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels
We consider two special subclasses of lambda-terms that are restricted by a bound on the number of abstractions between a variable and its binding lambda, the so-called De-Bruijn i...
Buffering Updates Enables Efficient Dynamic de Bruijn Graphs
Buffering Updates Enables Efficient Dynamic de Bruijn Graphs
Abstract
Motivation
The de Bruijn graph has become a ubiquitous graph model for biological data ever since its initial introduc...
MBG: Minimizer-based Sparse de Bruijn Graph Construction
MBG: Minimizer-based Sparse de Bruijn Graph Construction
Motivation
De Bruijn graphs can be constructed from short reads efficiently and have been used for many purposes. Traditionally long read sequencing technologies ...
Disentangled Long-Read De Bruijn Graphs via Optical Maps
Disentangled Long-Read De Bruijn Graphs via Optical Maps
Abstract
Pacific Biosciences (PacBio), the main third generation sequencing technology can produce scalable, high-throughput, unprecedented sequencing results throu...

