Trade Off Between Compression and Search Times in Compact Suffix Array

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Originalspråk	engelska
Titel på gästpublikation	Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)
Förlag	Springer-Verlag
Utgivningsdatum	2001
Sidor	189-201
Status	Publicerad - 2001
MoE-publikationstyp	A4 Artikel i en konferenspublikation

Namn	LNCS
Volym	2153

Vetenskapsgrenar

@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",

}

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 -