Name
Title | ||
|---|---|---|
Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton |
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 E-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several E-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of e-transitions while accepting short chains of E-transitions. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11812128_4 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 4094 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mathieu Giraud | 1 | 124 | 15.28 |
| Philippe Veber | 2 | 144 | 7.38 |
| Dominique Lavenier | 3 | 463 | 48.60 |