Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree.

@inproceedings{i-2021-extracting, author = {Tomohiro I and Robert W. Irving and Dominik K\"{o}ppl and Lorna Love}, editor = {Thierry Lecroq and H\'{e}l\`{e}ne Touzet}, title = {{Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree}}, booktitle = {{String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {143--150}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1_12}, doi = {https://doi.org/10.1007/978-3-030-86692-1_12} }