一些規則在字串的問題, 這樣如重複, 週期, 種子, 二次冪, 等, 在最近
已經被廣泛的學習。許多演算法已經被提出去解決這些問題在常數時間的
複雜度在一個 n 乘 n 的可調匯流排模式下, 這裡的 n 即給定字串的長度

在這篇論文, 我們集中去解決規則的另一個形式的問題, 字串超原型測試
問題和最長共同子序列問題在可調匯流排模式下。並且, 我們提出一個
O(log n) 時間平行演算法去解決這個測試問題。我們同時也回顧一些演算
法對於最長共同子序列問題。未來研究也給在此論文中。

Problems of some regularities in strings, such as repetition,
period, seed, square, etc., have been studied extensively
recently. Many algorithms have been proposed to solve these
problems in O(1) time complexity on an n imes n
reconfigurable bus model, where $n$ is the length of the given
string.

In this paper, we concentrate to solve problems of another form of
regularity, the string superprimitivity test problem and the
LCS (longest common subsequence) problem in strings on the
reconfigurable bus model. And we propose a O(log n) time
parallel algorithm to solve the string superprimitivity test
problem. We also review some algorithms for the LCS problem.
Further research is also given in this paper.

ABSTRACT
Chapter 1. Introduction
Chapter 2. The Computation Model
Chapter 3. The String Superprimitivity
Chapter 4. Some Algorithms for the LCS Problem
Chapter 5. Conclusion
BIBLIOGRAPHY

AUTHOR="A. Apostolico and F.P. Preparata",
TITLE="Optimal off-line detection of repetitions in a string",
JOURNAL="Theoretical Computer Science",
YEAR="1983",
VOLUME="22",
PAGES="297-315"

AUTHOR="A. Apostolico and M. Farach and C. S. Iliopoulos",
TITLE="Optimal Superprimitivity Testing for Strings",
JOURNAL="Information Processing Letters",
YEAR="1991",
VOLUME="39",
NUMBER="1",
PAGES="17-20"

AUTHOR="A. Apostolico",
TITLE="Optimal parallel detection of squares in strings",
JOURNAL="Algorithmica",
YEAR="1992",
VOLUME="8",
PAGES="285-319"

AUTHOR="A. Apostolico and A. Ehrenfeucht",
TITLE="Efficient Detection of Quasiperiodicities in Strings",
JOURNAL="Theoretical Computer Science",
YEAR="1993",
VOLUME="119",
PAGES="247-265"

AUTHOR="L. Bergroth and H. Hakonen and T. Rata",
TITLE="New Approximation Algorithms for Longest Common Subsequences (Extended Abstract)" ,
JOURNAL="Proc. String Processing and Information Retrieval",
YEAR="1998",
PAGES="32-40"

AUTHOR="D. Breslauer and Z. Galil",
TITLE="An Optimal O(loglog n) Time Parallel String Matching Algorithm",
JOURNAL="SIAM Journal on Computing",
YEAR="1990",
VOLUME="19",
NUMBER="6",
PAGES="1051-1058"

AUTHOR="D. Breslauer",
TITLE="An On-line String Superprimitivity Test",
JOURNAL="Information Processing Letters",
YEAR="1992",
VOLUME="44",
NUMBER="6",
PAGES="345-347"

AUTHOR="D. Breslauer",
TITLE="Testing String Superprimitivity in Parallel",
JOURNAL="Information Processing Letters",
YEAR="1994",
VOLUME="49",
PAGES="235-241"

AUTHOR="D. Breslauer",
TITLE="Fast Parallel String Prefix-matching" ,
JOURNAL="Theoretical Computer Science",
YEAR="1995",
VOLUME="137",
NUMBER="2",
PAGES="269-278"

AUTHOR="M. Crochemore",
TITLE="An optimal algorithm for computing the repetitions in a word",
JOURNAL="Information Processing Letters",
YEAR="1981",
VOLUME="12",
PAGES="244-250"

AUTHOR="M. Crochemore and W. Rytter",
TITLE="Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on String",
JOURNAL="Theoretical Computer Science",
YEAR="1991",
VOLUME="88",
PAGES="59-82"

AUTHOR="M. Crochemore and C. S. Iliopoulos and M. Korda",
TITLE="Two-Dimensional Prefix String Matching and Covering on Square Matrices",
JOURNAL="Algorithmica",
YEAR="1998",
VOLUME="20",
PAGES="353-373"

AUTHOR="H. Elgindy and L. Wetherall",
TITLE="A Simple Voroni Diagram Algorithm for a Reconfigurable Mesh",
JOURNAL="IEEE Transactions on Parallel and Distributed Systems",
YEAR="1997",
VOLUME="8",
NUMBER="11",
PAGES="1133-1142"

AUTHOR="C. S. Iliopoulos and M. Korda",
TITLE="Optimal Parallel Superprimitivity Testing for Square Arrays",
JOURNAL="Parallel Processing Letters",
YEAR="1996",
VOLUME="6",
NUMBER="3",
PAGES="299-308"

AUTHOR="C. S. Iliopoulos and D. W. G. Moore and K. Park",
TITLE="Covering a Sring",
JOURNAL="Algorithmica",
YEAR="1996",
VOLUME="16",
PAGES="288-297"

AUTHOR="J. Jang and V. K. Prasanna",
TITLE="An optimal sorting algorithm on reconfiguable mesh",
JOURNAL="Journal of Parallel and Distributed Computing",
YEAR="1995",
VOLUME="25",
PAGES="31-41"

AUTHOR="T. W. Kao and S. J. Horng and Y. L. Wang and H. R. Tsai",
TITLE="Design Efficient Parallel Algorithms on CRAP",
JOURNAL="IEEE Transactions on Parallel and Distributed Systems",
YEAR="1995",
VOLUME="6",
NUMBER="5",
PAGES="554-560"

AUTHOR="S. K. Kumar and C. P. Rangan",
TITLE="A Linear Space Algorithm for the LCS Problem",
JOURNAL="SIAM Journal on Computing",
YEAR="1987",
VOLUME="24",
PAGES="353-362"

AUTHOR="D. E. Kunth and J. H. Morris Jr and V. R. Pratt",
TITLE="Fast Pattern Matching in Strings",
JOURNAL="SIAM Journal on Computing",
YEAR="1977",
VOLUME="6",
NUMBER="2",
PAGES="323-350"

AUTHOR="Y. C. Lin",
TITLE="New systolic arrays for the longest subsequence problem",
JOURNAL="Parallel Computing",
YEAR="1994",
VOLUME="20",
PAGES="1323-1334"

AUTHOR="M. Lu and H. Lin",
TITLE="Parallel Algorithm for the Longest Common Subsequence Problem",
JOURNAL=ieeetpds,
YEAR="1994",
VOLUME="5",
NUMBER="8",
PAGES="835-848"

AUTHOR="G. Luce and J. F. Myoupo",
TITLE="Systolic-based parallel architecture for the longest common subsequences problem",
JOURNAL="INTEGRATION, the VLSI journal",
YEAR="1998",
VOLUME="25",
PAGES="53-70"

AUTHOR="M. G. Main and R. J. Lorentz",
TITLE="An O(nlogn) Algorithm for Finding All Repetitions in a String",
JOURNAL="Journal of Algorithms",
YEAR="1984",
VOLUME="5",
PAGES="422-432"

AUTHOR="D.W.G. Moore and W.F. Smyth",
TITLE="Computing the covers of a string in linear time",
JOURNAL="Proc. 5th ACM-SIAM Symposium on Discrete Algorithms",
YEAR="1994",
PAGES="511-515"

AUTHOR="A. Mukherjee",
TITLE="Determining Longest Common Subsueqences of Two Sequences on a Linear array of Processors",
JOURNAL=="Proc. 5th ACM-SIAM Symposium on Discrete Algorithms",
YEAR="1992",
PAGES="526-537"

AUTHOR="S. Pavel and S. Akl",
TITLE="Matrix Operation using Arrays with Reconfigurable Optical Buses",
JOURNAL="Parallel Algorithms and Applications",
YEAR="1996",
VOLUME="8",
PAGES="223-242"

AUTHOR="S. Rajasekaran and S. Sahni",
TITLE="Sorting, selection, and routing on the array with reconfigurable optical buses",
JOURNAL="IEEE Transactions on Parallel and Distributed Systems",
YEAR="1997",
VOLUME="8",
NUMBER="11",
PAGES="1123-1132"

AUTHOR="Y. Robert and M. Tchuente",
TITLE="A systolic array for the longest common subsequence problem",
JOURNAL="Information Processing Letters",
YEAR="1985",
NUMBER="4",
VOLUME="21",
PAGES="191-198"

AUTHOR="R. K. Thiruchelvan and J. Trahan and R. Vaidyanathan",
TITLE="On the Power of Segmenting and Fushing Buses",
JOURNAL="Proc. 7th Int. Parallel Proc. Symp.",
YEAR="1993",
PAGES="79-83"

AUTHOR="B. F. Wang and G. H. Chen and F. C. Lin",
TITLE="Constant Time Soring on a processing array with a reconfigurable bus system",
JOURNAL="Information Processing Letters",
YEAR="1990",
VOLUME="34",
NUMBER="4",
PAGES="187-192"