Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A new approach to text searching
Communications of the ACM
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of formal languages, vol. 1
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
| Hi-index | 0.00 |
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.