Suffix vector: space- and time-efficient alternative to suffix trees

Authors:
Krisztián Monostori;Arkady Zaslavsky;Heinz Schmidt
Affiliations:
Monash University, Melbourne, Caulfield East, VIC 3145;Monash University, Melbourne, Caulfield East, VIC 3145;Monash University, Melbourne, Caulfield East, VIC 3145
Venue:
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Year:
2002

Citing 6
Cited 3

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Improved behaviour of tries by adaptive branching

Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Reducing the space requirement of suffix trees

Software—Practice & Experience
Document overlap detection system for distributed digital libraries

DL '00 Proceedings of the fifth ACM conference on Digital libraries

Constructing chromosome scale suffix trees

APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
On-line construction of compact suffix vectors and maximal repeats

Theoretical Computer Science
Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence

Proceedings of the 11th ACM symposium on Document engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its space requirement. This paper describes a new structure called suffix vector, which is not only better in terms of storage space but also simpler than the most efficient suffix tree representation known to date. Alternatives of storage representations are discussed and a linear-time construction algorithm is also proposed in this paper. Space requirement of the suffix vector structure is compared to the space requirement of alternative suffix tree representations. We also make a theoretical comparison on the number of operations required to run algorithms on the suffix vector.