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...
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...
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...
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...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...