基于生物基序的最小DFAs的构建
Construction of minimal DFAs from biological motifs
摘要：
确定性有限自动机（DFA）在计算生物学中有着广泛的应用。然而，很少有人注意到最小DFA的有效构建。在这篇文章中，我们定义了简单的非确定性有限自动机（NFA），并证明了标准的子集构造将这种类型的NFA转换为最小的DFA。此外，我们展示了如何简单的NFA可以构建从两种类型的模式流行的生物信息学，即（套）广义字符串和（广义）字符串与汉明邻域。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
