14- https://doi.org/10.1002/spe.960
A survey of practical algorithms for suffix tree construction in external memory
- Feb 22, 2010
- Software: Practice and Experience
- M Barsky +2 more
Abstract
Abstract The construction of suffix trees in secondary storage was considered impractical due to its excessive I/O cost. Algorithms developed in the last decade show that a suffix tree can efficiently be built in secondary storage for inputs which fit the main memory. In this paper, we analyze the details of algorithmic approaches to the external memory suffix tree construction and compare the performance and scalability of existing state‐of‐the‐art software based on these algorithms. Copyright © 2010 John Wiley & Sons, Ltd.
- # Suffix Tree Construction
- # Suffix Tree
- # Secondary Storage
- # External Memory
- # Algorithms For Tree Construction
- # External Construction
- # Tree Construction
- # Algorithms For Construction
- # Main Memory
- # Practical Algorithms
