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序列中所有的最大串联重复。
Enlighened by the superposed algorithm of two element polynomial interpolation, we present a simple method of finding rational interpolation functions.
受二元多项式插值的迭加算法的启发，给出一种简便的求有理插值函数的方法，同时通过实例进行验证。
Aiming at a familiar and simple constraint that some items must or must not present in rules, a fast clipped-transaction-based constraint association-rule mining algorithm was put forward.
针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。
应用推荐