Home | english  | Impressum | Sitemap | KIT

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Autor:

J. Barbay, J. Fischer, G. Navarro

Quelle:

Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11), Lecture Notes in Computer Science 6661, 285-298, Springer-Verlag, 2011.