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). Apostolico A (Ed); Lecture notes in computer science, 3537. Berlin, Heidelberg: Springer Berlin Heidelberg: 45-56.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Mäkinen, V.;
Navarro, G.
Herausgeber*in
Apostolico, Alberto
Einrichtung
Erscheinungsjahr
2005
Titel des Konferenzbandes
Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005)
Serien- oder Zeitschriftentitel
Lecture notes in computer science
Band
3537
Seite(n)
45-56
ISBN
9783540262015
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/2500567
Zitieren
Mäkinen V, Navarro G. Succinct Suffix Arrays based on Run-Length Encoding. In: Apostolico A, ed. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Lecture notes in computer science. Vol 3537. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005: 45-56.
Mäkinen, V., & Navarro, G. (2005). Succinct Suffix Arrays based on Run-Length Encoding. In A. Apostolico (Ed.), Lecture notes in computer science: Vol. 3537. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005) (pp. 45-56). Berlin, Heidelberg: Springer Berlin Heidelberg. 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), ed. Alberto Apostolico, 3537:45-56. Lecture notes in computer science. Berlin, Heidelberg: Springer Berlin Heidelberg.
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), Apostolico, A. ed. Lecture notes in computer science, vol. 3537, (Berlin, Heidelberg: Springer Berlin Heidelberg), 45-56.
Mäkinen, V., & Navarro, G., 2005. Succinct Suffix Arrays based on Run-Length Encoding. In A. Apostolico, ed. Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Lecture notes in computer science. no.3537 Berlin, Heidelberg: Springer Berlin Heidelberg, 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), A. Apostolico, ed., Lecture notes in computer science, vol. 3537, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp.45-56.
Mäkinen, V., Navarro, G.: Succinct Suffix Arrays based on Run-Length Encoding. In: Apostolico, A. (ed.) Proc. 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Lecture notes in computer science. 3537, p. 45-56. Springer Berlin Heidelberg, Berlin, Heidelberg (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). Ed. Alberto Apostolico. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.Vol. 3537. Lecture notes in computer science. 45-56.
Google Scholar
ISBN Suche