Author:
Louza Felipe A.,Gog Simon,Telles Guilherme P.
Publisher
Springer International Publishing
Reference31 articles.
1. A. Abeliuk, R. Cánovas, G. Navarro, Practical compressed suffix trees. Algorithms 6(2), 319–351 (2013)
2. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53–86 (2004)
3. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, Enhanced suffix arrays and applications, in Handbook on Computational Molecular Biology, pp. 7–27 (Chapman and Hall/CRC, 2005)
4. T. Beller, S. Gog, E. Ohlebusch, T. Schnattinger, Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18, 22–31 (2013)
5. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm. Technical report, Digital SRC Research Report, 1994