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.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Konferenzbeitrag | Veröffentlicht | Englisch
Autor
;
Erscheinungsjahr
Titel des Konferenzbandes
Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005)
Band
3537
Seite
45-56
PUB-ID

Zitieren

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. doi:10.1007/11496656_5
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.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar