Sequences and the De Bruijn graph : properties, constructions, and applications /
The de Bruijn graph was defined in 1949 to enumerate the number of closed sequences where each n-tuple appears exactly once as a window in a sequence. Through the years, the graph and its sequences have found numerous applications - in space technology, wireless communication, cryptography, parallel...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Elektronički e-knjiga |
| Jezik: | engleski |
| Izdano: |
London :
Academic Press,
2024.
|
| Teme: | |
| Online pristup: | ScienceDirect |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | on1424923059 | ||
| 003 | OCoLC | ||
| 005 | 20260915095236.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 240306s2024 enka ob 001 0 eng d | ||
| 040 | |a YDX |b eng |e rda |c YDX |d OCLCO |d OPELS |d OCLCO |d UKAHL |d N$T |d EBLCP |d GZM |d OCLCL |d SFB |d OCLCF |d OCLCO |d OCLCQ | ||
| 019 | |a 1425791608 |a 1427585234 | ||
| 020 | |a 9780443135187 |q (electronic bk.) | ||
| 020 | |a 0443135185 |q (electronic bk.) | ||
| 020 | |z 9780443135170 | ||
| 020 | |z 0443135177 | ||
| 035 | |a (OCoLC)1424923059 |z (OCoLC)1425791608 |z (OCoLC)1427585234 | ||
| 050 | 4 | |a QA292 | |
| 082 | 0 | 4 | |a 515/.24 |2 23/eng/20240405 |1 https://id.oclc.org/worldcat/ddc/E3wvjkBt4h3CFJrMdPvv4qdCFP |
| 100 | 1 | |a Etzion, Tuvi, |d 1956- | |
| 245 | 1 | 0 | |a Sequences and the De Bruijn graph : |b properties, constructions, and applications / |c Tuvi Etzion. |
| 264 | 1 | |a London : |b Academic Press, |c 2024. | |
| 300 | |a 1 online resource |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 340 | |p illustration |0 http://rdaregistry.info/termList/IllusContent/1014 |2 rdaill | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Front Cover -- Sequences and the de Bruijn Graph -- Copyright -- Contents -- Preface -- 1 Introduction -- 1.1 Some concepts in finite fields and number theory -- 1.2 Codes, graphs, and sequences -- 1.3 The de Bruijn graph and feedback shift registers -- 1.4 Overview of the chapters -- 1.5 Notes -- References -- 2 LFSR sequences -- 2.1 Sequence length and polynomial representation -- 2.2 Maximum length linear shift-register sequences -- 2.3 Powers of irreducible polynomials -- 2.4 Patterns with distinct differences -- 2.5 Notes -- References -- 3 Cycles and the nonlinear theory | |
| 505 | 8 | |a 3.1 Cycles from feedback shift registers -- 3.2 Enumeration methods for polynomials and cycles -- 3.3 Maximum number of cycles in a state diagram -- 3.4 Notes -- References -- 4 Constructions of full cycles -- 4.1 Enumeration of all Eulerian cycles -- 4.2 The D-morphism and recursive constructions -- 4.3 Merging cycles of large factors -- 4.4 Notes -- References -- 5 Linear complexity of sequences -- 5.1 Binary sequences whose length is 2n -- 5.2 Complexity of binary de Bruijn sequences -- 5.3 Sequences over pm whose length is pn, p prime -- 5.4 Complexity of non-binary de Bruijn sequences | |
| 505 | 8 | |a 5.5 Notes -- References -- 6 Classification of sequences -- 6.1 Classification of sequences with length 2n<U+0012>1 -- 6.2 Classification of de Bruijn sequences -- 6.3 Classification of balanced sequences -- 6.4 The depth of a word -- 6.5 Notes -- References -- 7 One-dimensional applications -- 7.1 Stream ciphers -- 7.2 VLSI testing -- 7.3 Single-track Gray codes -- 7.4 Rotating-table games -- 7.5 Notes -- References -- 8 DNA sequences and DNA codes -- 8.1 The genome assembly -- 8.2 DNA storage codes -- 8.3 Constant-weight de Bruijn sequences -- 8.4 Reconstruction of a sequence from subsequences | |
| 505 | 8 | |a 8.5 Synchronization codes -- 8.6 Notes -- References -- 9 Two-dimensional arrays -- 9.1 Graph representations of perfect maps -- 9.2 Constructions by merging cycles -- 9.3 Pseudo-random arrays -- 9.4 Recursive constructions for perfect maps -- 9.5 Two-dimensional arrays with distinct differences -- 9.6 Notes -- References -- 10 Two-dimensional applications -- 10.1 Robust self-location two-dimensional patterns -- 10.2 Key predistribution for sensor networks -- 10.3 Folding of one-dimensional sequences -- 10.4 Notes -- References -- 11 Unique path property graphs | |
| 505 | 8 | |a 11.1 Basic properties of UPP graphs -- 11.2 Constructions for UPP graphs -- 11.3 Cycles and factors in UPP graphs -- 11.4 Notes -- References -- 12 Interconnection networks -- 12.1 The shuffle-exchange network -- 12.2 Multistage interconnection networks -- 12.3 Multistage permutation networks -- 12.4 Layouts -- 12.5 Notes -- References -- Index -- Back Cover | |
| 520 | |a The de Bruijn graph was defined in 1949 to enumerate the number of closed sequences where each n-tuple appears exactly once as a window in a sequence. Through the years, the graph and its sequences have found numerous applications - in space technology, wireless communication, cryptography, parallel computation, genome assembly, DNA storage, and microbiome research, among others. Sequences and the de Bruijn Graph: Properties, Constructions, and Applications explores the foundations of theoretical mathematical concepts and the important applications to computer science, electrical engineering, and bioinformatics. The book introduces the various concepts, ideas, and techniques associated with the use of the de Bruijn Graph, providing comprehensive coverage of sequence classification, one-dimensional and two-dimensional applications, graphs, interconnected networks, layouts, and embedded systems. Researchers, graduate students, professors, and professionals working in the fields of applied mathematics, electrical engineering, computer science and bioinformatics will find this book useful. Investigates computational and engineering applications associated with the de Bruijn graph, its sequences, and their generalizationExplores one-dimensional and two-dimensional sequences with special properties and their various properties and applicationsIntroduces the rich structure of the de Bruijn graph and its sequences, in both mathematical theory and its applications to computing and engineering problems. | ||
| 532 | 8 | |a Trusted Intermediary contact: t.narup@elsevier.com | |
| 532 | 8 | |a Publisher contact for further accessibility information: t.narup@elsevier.com | |
| 650 | 0 | |a Sequences (Mathematics) | |
| 650 | 6 | |a Suites (Mathématiques) |0 (CaQQLa)201-0061998 | |
| 650 | 7 | |a Sequences (Mathematics) |2 fast |0 (OCoLC)fst01112884 | |
| 776 | 0 | 8 | |c Original |z 0443135177 |z 9780443135170 |w (OCoLC)1405364454 |
| 856 | 4 | 0 | |3 ScienceDirect |u https://www.sciencedirect.com/science/book/9780443135170 |