scientific article; zbMATH DE number 3095523
From MaRDI portal
Publication:5834367
zbMath0060.02701MaRDI QIDQ5834367
Publication date: 1946
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Iterated line digraphs are asymptotically dense ⋮ Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers ⋮ Scattered Factor-Universality of Words ⋮ On the maximum number of distinct factors of a binary string ⋮ Uniform words ⋮ D2B: A de Bruijn based content-addressable network ⋮ Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits ⋮ On the nonlinearity of maximum-length NFSR feedbacks ⋮ Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ An index data structure for matrices, with applications to fast two-dimensional pattern matching ⋮ An approach to emulating separable graphs ⋮ Nonstandard Analysis of the Behavior of Ergodic Means of Dynamical Systems on Very Big Finite Probability Spaces ⋮ Characterizations for some types of DNA graphs ⋮ Circulant Boolean relation matrices ⋮ New classes of perfect maps. I ⋮ On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators ⋮ Construction for de Bruijn sequences with large stage ⋮ Flux through a Markov chain ⋮ An unoriented variation on de Bruijn sequences ⋮ The shuffle exchange network has a Hamiltonian path ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Progress, gaps and obstacles in the classification of cellular automata ⋮ Edge minimization in de Bruijn graphs ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Broadcasting in butterfly and debruijn networks ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ Tropical representations and identities of the stylic monoid ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ Approximations of the Lagrange and Markov spectra ⋮ Completely uniformly distributed sequences based on de Bruijn sequences ⋮ On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ rDAN: toward robust demand-aware network designs ⋮ Probabilistic quorums for dynamic systems ⋮ Normal Numbers and Computer Science ⋮ Avoidance of split overlaps ⋮ Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ An interleaved method for constructing de Bruijn sequences ⋮ The diameter of cyclic Kautz digraphs ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Formal Zeta function expansions and the frequency of Ramanujan graphs ⋮ A method for constructing artificial DNA libraries based on generalized de Bruijn sequences ⋮ Universal arrays ⋮ On encodings of spanning trees ⋮ A polynomial time equivalence between DNA sequencing and the exact perfect matching problem ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Generic Algorithms for Factoring Strings ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Random walks on semaphore codes and delay de Bruijn semigroups ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ Large butterfly Cayley graphs and digraphs ⋮ Embedding on alphabet overlap digraphs ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ Normal numbers and nested perfect necklaces ⋮ Unnamed Item ⋮ Projective de Bruijn Sequences ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Deterministic Pushdown Automata and Unary Languages ⋮ Some negative results related to Poissonian pair correlation problems ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Liouville, computable, Borel normal and Martin-Löf random numbers ⋮ Approximate Moore graphs are good expanders ⋮ Binary factorizations of the matrix of all ones ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata ⋮ Generalized de Bruijn words for primitive words and powers ⋮ Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis ⋮ Characterizations of generators for modified de Bruijn sequences ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density ⋮ Vertex-symmetric digraphs with small diameter ⋮ Spectral continuity for aperiodic quantum systems: Applications of a folklore theorem ⋮ On a Construction of Easily Decodable Sub-de Bruijn Arrays ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Constructing de Bruijn Sequences Based on a New Necessary Condition ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ The parallelism motifs of genomic data analysis ⋮ On the complexities of de-Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ De Bruijn digraphs and affine transformations ⋮ Storage efficient decoding for a class of binary de Bruijn sequences ⋮ Miscellaneous Digraph Classes ⋮ On finite presentations of inverse semigroups with zero having polynomial growth ⋮ On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints ⋮ Simulating finite automata with context-free grammars. ⋮ A graph theoretical approach to input design for identification of nonlinear dynamical models ⋮ HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs ⋮ Spatial Differentiation and Positive Circuits in a Discrete Framework ⋮ Minimal Polynomials of the Modified de Bruijn Sequences ⋮ Three generators for minimal writing-space computations ⋮ Maximal state complexity and generalized de Bruijn words ⋮ Recognizing DNA graphs is difficult. ⋮ Space-efficient representation of truncated suffix trees, with applications to Markov order estimation ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers ⋮ On the complexity of recognizing Wheeler graphs ⋮ A construction of a 𝜆-Poisson generic sequence ⋮ Absent Subsequences in Words ⋮ A greedy chip‐firing game ⋮ On the existence of balanced generalized de Bruijn sequences ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ The folded Petersen network: A new versatile multiprocessor interconnection topology ⋮ Discrepancy bounds for normal numbers generated by necklaces in arbitrary base ⋮ Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing ⋮ On the prevalence of the periodicity of maximizing measures ⋮ Two-way machines and de Bruijn words ⋮ EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS ⋮ Almost-Fisher families ⋮ Almost-Fisher families ⋮ An alternative construction of normal numbers ⋮ Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays ⋮ Generalized de Bruijn graphs ⋮ The underlying line digraph structure of some (0, 1)-matrix equations ⋮ Algorithms for the fixed linear crossing number problem ⋮ The complexity of interacting automata ⋮ Further results on the nonlinearity of maximum-length NFSR feedbacks ⋮ On the maximum order of graphs embedded in surfaces ⋮ Normality and finite-state dimension of Liouville numbers ⋮ Spanners of de Bruijn and Kautz graphs ⋮ A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Sufficient conditions for maximally connected dense graphs ⋮ Multicover Ucycles ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ Large alphabets and incompressibility ⋮ Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences ⋮ Path-sequential labellings of cycles ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ The origins of combinatorics on words ⋮ Large fault-tolerant interconnection networks ⋮ Restricting SBH ambiguity via restriction enzymes ⋮ Extensions of networks with given diameter ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ Mapping prefer-opposite to prefer-one de Bruijn sequences ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Computing generalized de Bruijn sequences ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Cellular automata between sofic tree shifts ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ Bisecting de Bruijn and Kautz graphs ⋮ The longest common extension problem revisited and applications to approximate string searching ⋮ Generation of full cycles by a composition of NLFSRs ⋮ Classification of de Bruijn-based labeled digraphs ⋮ A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ On universal partial words ⋮ Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words ⋮ Linear-time superbubble identification algorithm for genome assembly ⋮ Super link-connectivity of iterated line digraphs. ⋮ Towards a theory of patches ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ Spans of preference functions for de Bruijn sequences ⋮ Radial Moore graphs of radius three ⋮ High density graphs for processor interconnection ⋮ A linearly computable measure of string complexity ⋮ Tables of large graphs with given degree and diameter ⋮ Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter ⋮ Bounded budget betweenness centrality game for strategic network formations ⋮ A particular Hamiltonian cycle on middle levels in the De Bruijn digraph ⋮ The strategic value of recall ⋮ On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs ⋮ The coolest way to generate binary strings ⋮ Growing perfect cubes ⋮ Playing off-line games with bounded rationality ⋮ Optimal parallel execution of complete binary trees and grids into most popular interconnection networks ⋮ A note on recursive properties of the de Bruijn, Kautz and FFT digraphs ⋮ A surprisingly simple de Bruijn sequence construction ⋮ Minimal polynomials of the modified de Bruijn sequences ⋮ The adjacency graphs of some feedback shift registers ⋮ Exact numerical studies of Hamiltonian maps: Iterating without roundoff error ⋮ A new look at the de Bruijn graph ⋮ Graphs on alphabets as models for large interconnection networks ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ Product-shuffle networks: Toward reconciling shuffles and butterflies ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ The underlying graph of a line digraph ⋮ Translation invariant extensions of finite volume measures ⋮ On the de Bruijn torus problem ⋮ Universal cycles for combinatorial structures ⋮ Selected combinatorial problems of computational biology ⋮ A class of nonlinear de Bruijn cycles ⋮ Line-digraphs, arborescences and theorems of Tutte and Knuth ⋮ Finite state complexity ⋮ The Collatz conjecture and de Bruijn graphs ⋮ Error correcting sequence and projective de Bruijn graph ⋮ Investigating the existence and the regularity of logarithmic Harary graphs ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ On large vertex-symmetric digraphs ⋮ Large generalized cycles ⋮ Clues to the hidden nature of de Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ Complexity for finite factors of infinite sequences ⋮ de Bruijn sequences and de Bruijn graphs for a general language ⋮ Universal cycles for permutations ⋮ Minimum Eulerian circuits and minimum de Bruijn sequences ⋮ Universal cycles of \((n - 1)\)-partitions of an \(n\)-set ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Irregularity strength of digraphs ⋮ Graph-theoretical characterization of invertible cellular automata ⋮ Repeated games with \(M\)-period bounded memory (pure strategies) ⋮ The enumeration of shift register sequences ⋮ Long-term memory modules ⋮ Counting closed walks in generalized de Bruijn graphs ⋮ Weight class distributions of de Bruijn sequences ⋮ Words and forbidden factors ⋮ Graph theoretical issues in computer networks ⋮ Decoding perfect maps ⋮ Computation theory of cellular automata ⋮ Finite state incompressible infinite sequences
