Engineering a compressed suffix tree implementation

Välimäki N, Mäkinen V, Gerlach W, Dixit K (2009)
Journal of Experimental Algorithmics (JEA) 14: 4.2-2:4.23.

Journal Article | Published | English

No fulltext has been uploaded

Author
; ; ;
Publishing Year
ISSN
PUB-ID

Cite this

Välimäki N, Mäkinen V, Gerlach W, Dixit K. Engineering a compressed suffix tree implementation. Journal of Experimental Algorithmics (JEA). 2009;14:4.2-2:4.23.
Välimäki, N., Mäkinen, V., Gerlach, W., & Dixit, K. (2009). Engineering a compressed suffix tree implementation. Journal of Experimental Algorithmics (JEA), 14, 4.2-2:4.23.
Välimäki, N., Mäkinen, V., Gerlach, W., and Dixit, K. (2009). Engineering a compressed suffix tree implementation. Journal of Experimental Algorithmics (JEA) 14, 4.2-2:4.23.
Välimäki, N., et al., 2009. Engineering a compressed suffix tree implementation. Journal of Experimental Algorithmics (JEA), 14, p 4.2-2:4.23.
N. Välimäki, et al., “Engineering a compressed suffix tree implementation”, Journal of Experimental Algorithmics (JEA), vol. 14, 2009, pp. 4.2-2:4.23.
Välimäki, N., Mäkinen, V., Gerlach, W., Dixit, K.: Engineering a compressed suffix tree implementation. Journal of Experimental Algorithmics (JEA). 14, 4.2-2:4.23 (2009).
Välimäki, Niko, Mäkinen, Veli, Gerlach, Wolfgang, and Dixit, Kashyap. “Engineering a compressed suffix tree implementation”. Journal of Experimental Algorithmics (JEA) 14 (2009): 4.2-2:4.23.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar