There are many tools and S/W systems to generate finite state automata, FSA, due to its importance in modeling and simulation and its wide variety of applications. However, no appropriate tool that can generate finite state automata, FSA, for DNA motif template due to the huge size of the motif template. In addition to the optional paths in the motif structure which are represented by the gap. These reasons lead to the unavailability of the specifications of the automata to be generated. This absence of specifications makes the generating process very difficult. This paper presents a novel algorithm to construct FSAs for DNA motif templates. This research is the first research presents the problem of generating FSAs for DNA motif templates and offers novel algorithm to accomplish this. It is tested using many simple and compound motif templates of different sizes and various numbers of gaps that have unlimited ranges of intervals. The motifs sizes are up to 2M Bases. The motif templates include up to 2000 gaps and the interval of a gap is [1,100] up to [1, 1000000]. All of these cases were processed successfully.
Finite State Automata Generator for DNA
Motif Template as Preparation Step for
Motif Mining
Publication Date
Mon Nov 01 2010
Journal Name
Al-nahrain Journal Of Science
Publication Date
Wed Dec 01 2021
Journal Name
Structures
(2)
