Graph Constructions of Error-Detecting Codes for Nanopore Sequencers

Nanopore sequencers are a strong contender for the practical retrieval and decoding of information stored in DNA. In this paper, we provide two graph constructions of codes that satisfy the restrictions on sequences desirable for nanopore sequencers including GC-content, run length limit, and secondary structure avoidance. Moreover, we show that our constructions have error detecting capability with respect to single deletions, insertions, and substitutions.