An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.

@inproceedings{kim-2004-efficient, author = {Dong Kyue Kim and Jeong Eun Jeon and Heejin Park}, editor = {Alberto Apostolico and Massimo Melucci}, title = {{An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size}}, booktitle = {{String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {3246}, pages = {138--149}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30213-1_22}, doi = {https://doi.org/10.1007/978-3-540-30213-1_22} }