Author:
Louza Felipe A.,Gog Simon,Telles Guilherme P.
Publisher
Springer International Publishing
Reference59 articles.
1. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53–86 (2004)
2. D. Adjeroh, T. Bell, A. Mukherjee, The Burrows-Wheeler Transform: Data Compression, Suffix Arrays and Pattern Matching (Springer Publishing Company, Boston, MA, 2008)
3. M. Arnold, E. Ohlebusch, Linear time algorithms for generalizations of the longest common substring problem. Algorithmica 60(4), 806–818 (2011)
4. U. Baier, Linear-time suffix sorting - a new approach for suffix array construction, in Proc. Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 23:1–23:12 (2016)
5. H. Bannai, I. Tomohiro, S. Inenaga, Y. Nakashima, M. Takeda, K. Tsuruta, The “runs” theorem. SIAM J. Comput. 46(5), 1501–1514 (2017)