81
Voted
ACSC
2002
IEEE
15 years 1 months ago
2002
IEEE
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 spac...