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

@inproceedings{beller-2011-computing, author = {Timo Beller and Simon Gog and Enno Ohlebusch and Thomas Schnattinger}, editor = {Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri}, title = {{Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform}}, booktitle = {{String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7024}, pages = {197--208}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24583-1_20}, doi = {https://doi.org/10.1007/978-3-642-24583-1_20} }