In this paper, we present a fast biological datamining algorithm named IRTM based on embedded frequentsubtree. We also advance a string encoding method forrepresenting the trees, a scope-list for extending all substringsand some pruning rules which can further reduce thecomputational time and space cost. Experimental results showthat IRTM algorithm can achieve significantly performanceimprovement over previous works.
展开▼
