Trade Off Between Compression and Search Times in Compact Suffix Array

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publicationProceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)
PublisherSpringer-Verlag
Publication date2001
Pages189-201
Publication statusPublished - 2001
MoE publication typeA4 Article in conference proceedings

Publication series

NameLNCS
Volume2153

Fields of Science

  • 113 Computer and information sciences

Cite this

Mäkinen, V. (2001). Trade Off Between Compression and Search Times in Compact Suffix Array. In Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001) (pp. 189-201). (LNCS; Vol. 2153). Springer-Verlag.
Mäkinen, Veli. / Trade Off Between Compression and Search Times in Compact Suffix Array. Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). Springer-Verlag, 2001. pp. 189-201 (LNCS).
@inproceedings{d7bcae61557b459e87afbaa76cdf956b,
title = "Trade Off Between Compression and Search Times in Compact Suffix Array",
keywords = "113 Computer and information sciences",
author = "Veli M{\"a}kinen",
note = "Volume: Proceeding volume:",
year = "2001",
language = "English",
series = "LNCS",
publisher = "Springer-Verlag",
pages = "189--201",
booktitle = "Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)",
address = "Germany",

}

Mäkinen, V 2001, Trade Off Between Compression and Search Times in Compact Suffix Array. in Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). LNCS, vol. 2153, Springer-Verlag, pp. 189-201.

Trade Off Between Compression and Search Times in Compact Suffix Array. / Mäkinen, Veli.

Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). Springer-Verlag, 2001. p. 189-201 (LNCS; Vol. 2153).

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

TY - GEN

T1 - Trade Off Between Compression and Search Times in Compact Suffix Array

AU - Mäkinen, Veli

N1 - Volume: Proceeding volume:

PY - 2001

Y1 - 2001

KW - 113 Computer and information sciences

M3 - Conference contribution

T3 - LNCS

SP - 189

EP - 201

BT - Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)

PB - Springer-Verlag

ER -

Mäkinen V. Trade Off Between Compression and Search Times in Compact Suffix Array. In Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). Springer-Verlag. 2001. p. 189-201. (LNCS).