Preprint
Lyndon Array Construction during Burrows-Wheeler Inversion
Abstract
In this paper we present an algorithm to compute the Lyndon array of a string
$T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler
Authors
Louza FA; Smyth WF; Manzini G; Telles GP
Publication date
October 27, 2017
DOI
10.48550/arxiv.1710.10105
Preprint server
arXiv