Many sequence analysis tasks can be accomplished with a suffix array, and several of them additionally need the longest common prefix array. In large scale applications, suffix arrays are being replaced with full-text indexes that are based on the Burrows-Wheeler transform. In this paper, we present the first algorithm that computes the longest common prefix array directly on the wavelet tree of the Burrows-Wheeler transformed string. It runs in linear time and a practical implementation requires approximately 2.2 bytes per character. © 2011 Springer-Verlag.
CITATION STYLE
Beller, T., Gog, S., Ohlebusch, E., & Schnattinger, T. (2011). Computing the longest common prefix array based on the burrows-wheeler transform. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7024 LNCS, pp. 197–208). https://doi.org/10.1007/978-3-642-24583-1_20
Mendeley helps you to discover research relevant for your work.