In this paper we present a new algorithm to locate all maximal tandem repeats in DNA sequence, which is based on a simple data structure called suffix array.
本文提出了一种新的算法，此算法基于一种简单的数据结构后缀数，用于查找给定的DNA序列中所有的最大串联重复。
Conclusion: This new method of DNA sequence deletion mutation is simple and accurate. It could avoid new mutation in PCR process of traditional DNA manipulation method.
结论：该方法操作简单、精确，能够避免引入新突变，为DNA序列的缺失突变提供了一种新方法。
Conclusion: This new method of DNA sequence deletion mutation is simple and accurate. It could avoid new mutation in PCR process of traditional DNA manipulation method.
结论：该方法操作简单、精确，能够避免引入新突变，为DNA序列的缺失突变提供了一种新方法。
应用推荐