Author:
Gagie Travis,Navarro Gonzalo
Publisher
Springer International Publishing
Reference59 articles.
1. Abeliuk A, Cánovas R, Navarro G (2013) Practical compressed suffix trees. Algorithms 6(2):319–351
2. Alanko J, D’Agostino G, Policriti A, Prezza N (2020) Regular languages meet prefix sorting. In: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 911–930
3. Belazzougui D, Cunial F (2017a) Fast label extraction in the CDAWG. In: Proc. 24th international symposium on string processing and information retrieval (SPIRE), pp 161–175
4. Belazzougui D, Cunial F (2017b) Representing the suffix tree with the CDAWG. In: Proceedings of the 28th symposium on combinatorial pattern matching (CPM), pp 7:1–7:13
5. Belazzougui D, Cunial F, Gagie T, Prezza N, Raffinot M (2015a) Composite repetition-aware data structures. In: Proceedings of the 26th symposium on combinatorial pattern matching (CPM), pp 26–39