In the application of bioinformatics, the existing algorithms cannot be directly and efficiently implement sequence pattern mining. Two fast and efficient biological sequence pattern mining algorithms for biological single sequence and multiple sequences are proposed in this paper. The concept of the basic pattern is proposed, and on the basis of mining frequent basic patterns, the frequent pattern is excavated by constructing prefix trees for frequent basic patterns. The proposed algorithms implement rapid mining of frequent patterns of biological sequences based on pattern prefix trees. In experiment the family sequence data in the pfam protein database is used to verify the performance of the proposed algorithm. The prediction results confirm that the proposed algorithms can’t only obtain the mining results with effective biological significance, but also improve the running time efficiency of the biological sequence pattern mining.

中文翻译：

---

基于模式前缀树的生物序列频繁模式算法

在生物信息学的应用中，现有算法无法直接有效地实现序列模式挖掘。提出了两种快速有效的生物单序列和多序列生物序列模式挖掘算法。提出了基本模式的概念，并在挖掘频繁基本模式的基础上，通过构造频繁基本模式的前缀树来挖掘频繁模式。所提出的算法基于模式前缀树实现生物序列频繁模式的快速挖掘。在实验中，pfam蛋白数据库中的家族序列数据用于验证所提出算法的性能。