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.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Välimäki, Niko;
Mäkinen, Veli;
Gerlach, WolfgangUniBi;
Dixit, Kashyap
Einrichtung
Stichworte
lcp values;
biological sequence analysis;
balanced parentheses;
Algorithm engineering;
Burrows-Wheeler transform;
lowest common ancestor;
text compression;
wavelet tree;
text indexing
Erscheinungsjahr
2009
Zeitschriftentitel
Journal of Experimental Algorithmics (JEA)
Band
14
Seite(n)
4.2-2:4.23
ISSN
1084-6654
Page URI
https://pub.uni-bielefeld.de/record/2406118
Zitieren
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. https://doi.org/10.1145/1498698.1594228
Välimäki, Niko, Mäkinen, Veli, Gerlach, Wolfgang, and Dixit, Kashyap. 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.
Google Scholar