Fast Implementations of Automata Computations

11 years 5 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a parallel way, using bit operations readily available in processors. In this paper, we generalize the technique, and characterize a class of automata for which there exists equivalent parallel, or vector, algorithms. As an application, we extend Myers result to arbitrary weighted edit distances, which are currently used to explore the vast data-bases generated by genetic sequencing.
Anne Bergeron, Sylvie Hamel
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 2000
Where WIA
Authors Anne Bergeron, Sylvie Hamel
Comments (0)