Compressed data structure

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Grossi, Roberto; Vitter, Jeffrey Scott (January 2005). "Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching" (PDF). SIAM Journal on Computing. 35 (2): 378–407. doi:10.1137/S0097539702402354. hdl:1808/18962. <a href="http://www.ittc.ku.edu/~jsv/Papers/GrV05.text_indexing.pdf" target="_blank">http://www.ittc.ku.edu/~jsv/Papers/GrV05.text_indexing.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>R. Grossi, A. Gupta, and J. S. Vitter, High-Order Entropy-Compressed Text Indexes, Proceedings of the 14th Annual SIAM/ACM Symposium on Discrete Algorithms, January 2003, 841-850. <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Ferragina, P.; Manzini, G. (2000). "Opportunistic data structures with applications". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 390–398. doi:10.1109/SFCS.2000.892127. ISBN 0-7695-0850-2. S2CID 12530704. <a href="0-7695-0850-2" target="_blank">0-7695-0850-2</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
</ol>

Compressed data structure open-in-new

Compressed data structure