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序列中所有的最大串联重复。
This is the data structure of a simple traversal algorithm, and they hope to be helpful to beginners.
这是数据结构的一个遍历的简单算法，希望对初学者有所帮助。
Compared with the scan line algorithm, it has a simple data structure, no need to maintain and sort lots of tables, simple implementation, and fitting for being implemented by hardware.
该算法和扫描线算法相比，具有数据结构简单，不需要对众多的表格进行维护和排序，实现思想简洁和适合硬化等优点。
应用推荐