FOCS
2003
IEEE
14 years 5 months ago
2003
IEEE
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...
SPIRE
2009
Springer
14 years 6 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...