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...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Elektrovnnalaš E-girji |
| Giella: | eaŋgalasgiella |
| Almmustuhtton: |
London :
Academic Press,
2024.
|
| Fáttát: | |
| Liŋkkat: | ScienceDirect |
| Fáddágilkorat: |
Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Vuogádat eret anus
Girjerádjovuogádat lea juste dál eret anus.
Oažžasuvvandieđut eai leat aiddo dál geavaheamis. Šállošit dás šaddan váivvi. Sáhttit váldit oktavuođa