The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees and Suffix Arrays

Abstract

We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. The VST provides the same functionality as the suffix tree, including suffix links, but at a much smaller space requirement. It has the same… (More)

9 Figures and Tables

Topics

  • Presentations referencing similar topics