DMCA
Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
BibTeX
@MISC{Giraud_path-equivalentremovals,
author = {Mathieu Giraud and Dominique Lavenier},
title = {Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of ε-transitions while accepting short chains of ε-transitions. 1
Keyphrases
genomic weighted finite automaton path-equivalent removal efficient transitions-removal technique surface area new problem several transitions-removal problem short chain new transition large genomic bank clock frequency constraint new bound partial removal weighted finite automaton acyclic wfa
