Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
Jouni Sirén|Niko Välimäki|Veli Mäkinen|Gonzalo Navarro
| Anthology ID: | DBLP:conf/spire/SirenVMN08 |
|---|---|
| Volume: | String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings |
| Year: | 2008 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 164-175 |
| URL: | https://doi.org/10.1007/978-3-540-89097-3_17 |
| DOI: | https://doi.org/10.1007/978-3-540-89097-3_17 |
| DBLP: | conf/spire/SirenVMN08 |
| BibTeX: |
@inproceedings{siren-2008-runlength,
author = {Jouni Sir\'{e}n and
Niko V\"{a}lim\"{a}ki and
Veli M\"{a}kinen and
Gonzalo Navarro},
editor = {Amihood Amir and
Andrew Turpin and
Alistair Moffat},
title = {{Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections}},
booktitle = {{String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {5280},
pages = {164--175},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89097-3_17},
doi = {https://doi.org/10.1007/978-3-540-89097-3_17}
}