Sciweavers

Share
SPIRE
2009
Springer

A Linear-Time Burrows-Wheeler Transform Using Induced Sorting

10 years 7 months ago
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
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 studies to compute BWT directly [6, 13], one constructs BWT incrementally, which requires O(n log n) time where n is the length of the input text. We present an algorithm for computing BWT directly in linear time by modifying the suffix array construction algorithm based on induced sorting [16]. We show that the working space is O(n log σ log logσ n) for any σ where σ is the alphabet size, which is the smallest among the known linear time algorithms.
Daisuke Okanohara, Kunihiko Sadakane
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where SPIRE
Authors Daisuke Okanohara, Kunihiko Sadakane
Comments (0)
books