Succinct Suffix Arrays based on Run-Length Encoding

Mäkinen V, Navarro G (2005)
In: Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). 3537. 45-56.

Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

Mäkinen V, Navarro G. Succinct Suffix Arrays based on Run-Length Encoding. In: Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Vol 3537. 2005: 45-56.
Mäkinen, V., & Navarro, G. (2005). Succinct Suffix Arrays based on Run-Length Encoding. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005), 3537, 45-56.
Mäkinen, V., and Navarro, G. (2005). “Succinct Suffix Arrays based on Run-Length Encoding” in Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005), vol. 3537, 45-56.
Mäkinen, V., & Navarro, G., 2005. Succinct Suffix Arrays based on Run-Length Encoding. In Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). no.3537 pp. 45-56.
V. Mäkinen and G. Navarro, “Succinct Suffix Arrays based on Run-Length Encoding”, Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005), vol. 3537, 2005, pp.45-56.
Mäkinen, V., Navarro, G.: Succinct Suffix Arrays based on Run-Length Encoding. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). 3537, p. 45-56. (2005).
Mäkinen, V., and Navarro, G. “Succinct Suffix Arrays based on Run-Length Encoding”. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). 2005.Vol. 3537. 45-56.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar