Trade Off Between Compression and Search Times in Compact Suffix Array

Veli Mäkinen

Trade Off Between Compression and Search Times in Compact Suffix Array

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001)
Publisher	Springer-Verlag
Publication date	2001
Pages	189-201
Publication status	Published - 2001
MoE publication type	A4 Article in conference proceedings

Publication series

Name	LNCS
Volume	2153

Fields of Science

113 Computer and information sciences

Cite this

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

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

}

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 proceeding › Conference contribution › Scientific › peer-review