Related Experiment Video
Updated: Jun 16, 2026

The ITS2 Database
Published on: March 12, 2012
Repeats identification using improved suffix trees
Hongwei Huo1, Xiaowu Wang, Vojislav Stojkovic
1School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, China. hwhuo@mail.xidian.edu.cn
Abstract:
The suffix tree data structure plays an important role in the efficient implementations of some querying algorithms. This paper presents the fast Rep(eats)Seeker algorithm for repeats identification based on the improvements of suffix tree construction. The leaf nodes and the branch nodes are numbered in different ways during the construction of a suffix tree and extra information is added to the branch nodes. The experimental results show that improvements reduce the running time of the RepSeeker algorithm without losing the accuracy. The experimental results coincide with the theoretical expectations.
Related Concept Videos
Methods of Classification and Identification
Phylogenetic Trees
Phylogenetic Trees
Evolutionary Relationships through Genome Comparisons
Modern Molecular Taxonomy
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
