Sciweavers

FOCS
2003
IEEE
14 years 5 months ago
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung