The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x), (absolute value of y)) and n = max((absolute value of x), (absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn). Apostolico, Alberto and Atallah, Mikhail J. and Larmore, Lawrence and Mcfaddin, H. S. Unspecified Center N00014-84-K-0502; N00014-86-K-0689; NCC2-387.