De Bruijn Graphs and Lamplighter Groups
De Bruijn graphs were originally introduced for finding a superstring representation for all fixed length words of a given finite alphabet. Later they found numerous applications, for instance, in DNA sequencing. Here we study a relationship between de Bruijn graphs and the family of lamplighter gro...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/38832 http://dx.doi.org/10.20381/ruor-23084 |