  In this article we extend the elegant in-place Burrows-Wheeler transform
(BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our
extension is twofold: we first show how to compute simultaneously the longest
common prefix (LCP) array as well as the BWT, using constant additional space;
we then show how to build the LCP array directly in compressed representation
using Elias coding, still using constant additional space and with no
asymptotic slowdown. Furthermore, we provide a time/space tradeoff for our
algorithm when additional memory is allowed. Our algorithm runs in quadratic
time, as does Crochemore et al.'s, and is supported by interesting properties
of the BWT and of the LCP array, contributing to our understanding of the
time/space tradeoff curve for building indexing structures.
