Abstract: We proposed a new methodhorizontaldivision method by which we can compute all the Maximal Repeats of string x using only suffix array SA_x and LCP array LCP_x. We analyzed the situatio ns and locations where the Maximal NERepeats and SNERepeats of xcan be. Then we designed three algorithms by which all Maximal Repeats, Maximal NERepeats, and Maximal SNERepeats in a string x［1…n］ can be computed onlyby means of SA_x and LCP_x. The given algorithms overcome the defects of the corresponding algorithms which require other assistant arrays in addition to suffix array and LCP array. So our algorithms reduce the space requirement greatly. Moreover, the time complexity of these algorithms is not increased. In addition, we can get all the Ma ximal Repeats, Maximal NE Repeats and Maximal SNE Repeats of a string by only scanningLCP array once.

Key words: repeats, suffix array, horizontadivision method