Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform

Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger. Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. In Roberto Grossi, Fabrizio Sebastiani 0001, Fabrizio Silvestri, editors, String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Volume 7024 of Lecture Notes in Computer Science, pages 197-208, Springer, 2011. [doi]

Bibliographies