2020/07/25 by Danny Dyer, Dyer, Danny, Jared Howell +3
Computer Science · Mathematics · Biochemistry, Genetics and Molecular Biology · #Coding theory and cryptography #Advanced Combinatorial Mathematics #DNA and Biological Computing
paper · pdf · doi:10.48550/arxiv.2007.12825
The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order k is described by a de Bruijn sequence of order k-1. This idea is extended to certain subdigraphs of de Bruijn graphs.