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.

• Type: Conference
• Year: 2000
• Where: WIA
• Authors: Anne Bergeron, Sylvie Hamel
• Keywords: Artificial Intelligence, Bit-vector Algorithm, Edit Distances, Weighted Edit Distances, WIA 2000