Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Faster Average Case Low Memory Semi-External Construction of the
  Burrows-Wheeler Transform   The Burrows Wheeler transform has applications in data compression as well as
full text indexing. Despite its important applications and various existing
algorithmic approaches the construction of the transform for large data sets is
still challenging. In this paper we present a new semi external memory
algorithm for constructing the Burrows Wheeler transform. It is capable of
constructing the transform for an input text of length $n$ over a finite
alphabet in time $O(n\log^2\log n)$ on average, if sufficient internal memory
is available to hold a fixed fraction of the input text. In the worst case the
run-time is $O(n\log n \log\log n)$. The amount of space used by the algorithm
in external memory is $O(n)$ bits. Based on the serial version we also present
a shared memory parallel algorithm running in time
$O(\frac{n}{p}\max\{\log^2\log n+\log p\})$ on average when $p$ processors are
available.

24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph