Longest repeated suffix problem on the arrays with pipelined optical bus systems

We give a parallel solution to the problem of finding the longest repeated suffix ending at each position of a given word of length m. We first show the existence of a simple dynamic programming algorithm. Its running time is /spl Theta/(m/sup 2/) and its space requirement is O(m). Then, we show that it is possible to develop a parallel solution based on an optical bus system of m processors with a time complexity of /spl Theta/(m).