String Editing on an SIMD Hypercube Multicomputer

SIMD hypercube algorithms for determining a minimum cost edit sequence to transform one string into another are developed. If the two strings are of length n, our algorithms take O(√(n log n)p + log2n) time when n2p, 1 ≤ p ≤ n, processors are available. When p2, n log n ≤ p2 < n2, processors are available, the complexity of our algorithm is O((n1.5p) √log n).

[1]  Ellis Horowitz,et al.  Fundamentals of Data Structures in Pascal , 1984 .

[2]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Jerome Rothstein,et al.  Immediate Parallel Solution of the Longest Common Subsequence Problem , 1987, ICPP.

[4]  King-Sun Fu,et al.  VLSI Arrays for Minimum-Distance Classifications , 1984 .

[5]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[6]  Robert A. Wagner,et al.  Parallelization of the Dynamic Programming Algorithm for Comparison of Sequences , 1987, International Conference on Parallel Processing.

[7]  Thomas S. Huang,et al.  Image processing , 1971 .

[8]  H. D. Cheng,et al.  VLSI architectures for string matching and pattern matching , 1987, Pattern Recognit..

[9]  Sartaj Sahni,et al.  Image Template Matching on MIMD Hypercube Multicomputers , 1990, J. Parallel Distributed Comput..

[10]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[11]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[12]  Sartaj Sahni,et al.  Binary Trees and Parallel Scheduling Algorithms , 1983, IEEE Trans. Computers.

[13]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[14]  Frances L. Van Scoy.  The Parallel Recognition of Classes of Graphs , 1980, IEEE Trans. Computers.

[15]  Oscar H. Ibarra,et al.  Hypercube Algorithms for Some String Comparison Problems , 1988 .