Author:
Cáceres Manuel,Navarro Gonzalo
Publisher
Springer International Publishing
Reference38 articles.
1. Abeliuk, A., Cánovas, R., Navarro, G.: Practical compressed suffix trees. Algorithms 6(2), 319–351 (2013)
2. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53–86 (2004)
3. Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words, pp. 85–96. Springer, Heidelberg (1985).
https://doi.org/10.1007/978-3-642-82456-2_6
4. Arroyuelo, D., et al.: Fast in-memory XPath search using compressed indexes. Softw. Pract. Exp. 45(3), 399–434 (2015)
5. Belazzougui, D., Cunial, F.: Representing the suffix tree with the CDAWG. In: Proceedings of 28th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 7:1–7:13 (2017)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Block trees;Journal of Computer and System Sciences;2021-05
2. Smaller RLZ-Compressed Suffix Arrays;2021 Data Compression Conference (DCC);2021-03
3. Inducing the LCP Array;Construction of Fundamental Data Structures for Strings;2020
4. Compressed Indexes for Repetitive Textual Datasets;Encyclopedia of Big Data Technologies;2012-02-24