References
- Maniscalco, M., and Puglisi, S. aster lightweight suffix array construction. In Proceedings of 17th Australasion Workshop on Combinatorial Algorithms, pp. 16-29.2006.
- Manber, U., and Myer, G. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22, 5, pp. 935-948, 1993. https://doi.org/10.1137/0222058
- Karkkainen, J., Sanders, P., and Burkhardt, S. Linear work sufix aray construction. Journal of the ACM 53, 6, pp. 918-936, 2006. https://doi.org/10.1145/1217856.1217858
- Kim, D. K. Sim, J. S., Park, H., and Park, K. Constructing suffix arrays in linear time. Journal of Discrete Algorithms 3, 2-4, pp. 126-142. 2005. https://doi.org/10.1016/j.jda.2004.08.019
- Ko, P., and Aluru, S. Space efficient linear time construction of suffix array construction algorithms. ACM Computing Surveys 39, 2, 2007.
- Pglisi, S. J., Smyth, W. F., and Turpin, A. H. A taxonomy of suffix aray construction algorithms. ACM Computing Surveys 39, 2, 2007.
- Manzini, G., and Ferragina, P. Engineering a lightweight suffix array contruction algorithm. Algorithmica 40, 1, pp. 33-50. 2004. https://doi.org/10.1007/s00453-004-1094-1
- Itoh, H., and Tanska, H. An eficient method for in memory construction of suffix arrays. In Proceedings of the String Processing and Information Retrieval, p. 81. 1999. https://doi.org/10.1109/SPIRE.1999.796581
- Mori, y. Divsufsort (version 1.2.3). http://www.homepage3.nifty.com/wpage/software/livbdivsufsort.html, 2005.
- Bentley, J. L., and Mcllroy, M. D. Engineering a sort function. Sotware-Practice & Experience 23, 11, pp. 1249-1265, 1993. https://doi.org/10.1002/spe.4380231105
- Bentley, J. L., and Sedgewick, R. Fast algorithms for sorting and searching strings. In Proceedings of ACM-SLAM Symposium on Discrete Algorithms. pp. 360-369, 1997.