AI Article Synopsis
- The paper discusses how suffix trees are crucial for efficiently executing querying algorithms, particularly in identifying repeated sequences.
- It introduces the fast Rep(eats)Seeker algorithm that enhances suffix tree construction by differently numbering leaf and branch nodes and adding extra information to branch nodes.
- Experimental results demonstrate that these enhancements significantly decrease the running time of the RepSeeker algorithm while maintaining accuracy, aligning with theoretical predictions.
Article 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.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1504/IJCBDD.2009.030117 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!