Trade Off Between Compression and Search Times in Compact Suffix Array

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

Alkuperäiskielienglanti
OtsikkoProceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)
KustantajaSpringer-Verlag
Julkaisupäivä2001
Sivut189-201
TilaJulkaistu - 2001
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa

Julkaisusarja

NimiLNCS
Vuosikerta2153

Lisätietoja


Volume:
Proceeding volume:

Tieteenalat

  • 113 Tietojenkäsittely- ja informaatiotieteet

Lainaa tätä

Mäkinen, V. (2001). Trade Off Between Compression and Search Times in Compact Suffix Array. teoksessa Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001) (Sivut 189-201). (LNCS; Vuosikerta 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. Sivut 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. julkaisussa Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). LNCS, Vuosikerta 2153, Springer-Verlag, Sivut 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. s. 189-201 (LNCS; Vuosikerta 2153).

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

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. julkaisussa Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). Springer-Verlag. 2001. s. 189-201. (LNCS).