Construction of minimal DFAs from biological motifs
Formal Languages and Automata Theory
2010-12-10 v2 Quantitative Methods
Abstract
Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple non-deterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs can be constructed from two types of patterns popular in bioinformatics, namely (sets of) generalized strings and (generalized) strings with a Hamming neighborhood.
Keywords
Cite
@article{arxiv.1004.1298,
title = {Construction of minimal DFAs from biological motifs},
author = {Tobias Marschall},
journal= {arXiv preprint arXiv:1004.1298},
year = {2010}
}