The following publications are possibly variants of this publication:
- Faster Compressed Suffix Trees for Repetitive Text CollectionsGonzalo Navarro, Alberto Ordóñez Pereira. wea 2014: 424-435 [doi]
- Faster repetition-aware compressed suffix trees based on Block TreesManuel Cáceres, Gonzalo Navarro. iandc, 285(Part):104749, 2022. [doi]
- Faster Repetition-Aware Compressed Suffix Trees Based on Block TreesManuel Cáceres, Gonzalo Navarro. spire 2019: 434-451 [doi]
- Compressed Suffix Trees for Repetitive TextsAndrés Abeliuk, Gonzalo Navarro. spire 2012: 30-41 [doi]
- Fast Fully-Compressed Suffix TreesGonzalo Navarro, Luís M. S. Russo. dcc 2014: 283-291 [doi]
- Faster entropy-bounded compressed suffix treesJohannes Fischer, Veli Mäkinen, Gonzalo Navarro. TCS, 410(51):5354-5364, 2009. [doi]
- Practical Compressed Suffix TreesRodrigo Cánovas, Gonzalo Navarro. wea 2010: 94-105 [doi]
- Practical Compressed Suffix TreesAndrés Abeliuk, Rodrigo Cánovas, Gonzalo Navarro. algorithms, 6(2):319-351, 2013. [doi]
- PFP Compressed Suffix TreesChristina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub 0001, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi 0001. alenex 2021: 60-72 [doi]
- Fully-Compressed Suffix TreesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. latin 2008: 362-373 [doi]
- Fully compressed suffix treesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. TALG, 7(4):53, 2011. [doi]