The Community for Technology Leaders
Green Image
<p>The authors give an efficient parallel algorithm for the string edit problem. The model of computation is a one-way linear array of identical finite-state machines (nodes). The data movement in the array is one-way, from left to right. For inputs of length n, the array uses n nodes. The algorithm can produce the actual minimum-cost edit sequence in linear time. The previous parallel algorithm for this problem runs in O(n) time on a one-way two-dimensional array of finite-state machines using n/sup 2/ nodes. The best serial (RAM) algorithm for the problem takes O(n/sup 2//log n) time and space. Applications to other problems such as the longest common subsequence and approximate pattern matching are discussed.</p>
string editing; one-way linear array; finite-state machines; parallel algorithm; model of computation; minimum-cost edit sequence; linear time; one-way two-dimensional array; RAM; longest common subsequence; approximate pattern matching; finite automata; parallel algorithms.

O. Ibarra, H. Wang and T. Jiang, "String Editing on a One-Way Linear Array of Finite-State Machines," in IEEE Transactions on Computers, vol. 41, no. , pp. 112-118, 1992.
93 ms
(Ver 3.3 (11022016))