Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/bibm/KiilekciVX10
%A Külekci, M. Oguzhan
%A Vitter, Jeffrey Scott
%A Xu, Bojian
%B BIBM
%D 2010
%E Park, Taesung
%E Tsui, Stephen Kwok-Wing
%E Chen, Luonan
%E Ng, Michael K.
%E Wong, Limsoon
%E Hu, Xiaohua
%I IEEE Computer Society
%K dblp
%P 622-625
%T Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees.
%U http://dblp.uni-trier.de/db/conf/bibm/bibm2010.html#KiilekciVX10
%@ 978-1-4244-8306-8
@inproceedings{conf/bibm/KiilekciVX10,
added-at = {2023-03-24T00:00:00.000+0100},
author = {Külekci, M. Oguzhan and Vitter, Jeffrey Scott and Xu, Bojian},
biburl = {https://www.bibsonomy.org/bibtex/282acef347a8dd7a7dc777a175f0fc8c9/dblp},
booktitle = {BIBM},
crossref = {conf/bibm/2010},
editor = {Park, Taesung and Tsui, Stephen Kwok-Wing and Chen, Luonan and Ng, Michael K. and Wong, Limsoon and Hu, Xiaohua},
ee = {https://doi.ieeecomputersociety.org/10.1109/BIBM.2010.5706641},
interhash = {8524290a3143e7734c0063a4bee02ab3},
intrahash = {82acef347a8dd7a7dc777a175f0fc8c9},
isbn = {978-1-4244-8306-8},
keywords = {dblp},
pages = {622-625},
publisher = {IEEE Computer Society},
timestamp = {2024-04-09T21:36:17.000+0200},
title = {Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees.},
url = {http://dblp.uni-trier.de/db/conf/bibm/bibm2010.html#KiilekciVX10},
year = 2010
}