39 search results - page 8 / 8 » Tree Compression Using String Grammars |
EDBT
2010
ACM
13 years 8 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
CNIS
2006
13 years 6 months ago
2006
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...