On compressing permutations and adaptive sorting

Theoretical Computer Science

Volumn 513, Issue , 2013, Pages 109-123

  Barbay, Jérémy ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Adaptive sorting; Compression; Permutations; Succinct data structures

Indexed keywords

ADAPTIVE SORTING; ADAPTIVE SORTING ALGORITHMS; COMPRESSED DATA STRUCTURES; ELSEVIER; PERMUTATIONS; PREORDERS; SUCCINCT DATA STRUCTURE;

COMPACTION; COMPUTER SCIENCE;

DATA STRUCTURES;

EID: 84888130029     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.10.019     Document Type: Article

References (49)

1. D. Arroyuelo, F. Claude, R. Dorrigiv, S. Durocher, M. He, A. López-Ortiz, I. Munro, P. Nicholson, A. Salinger, and M. Skala Untangled monotonic chains and adaptive range search Theor. Comput. Sci. 412 32 2011 4200 4211
2. D. Arroyuelo, G. Navarro, and K. Sadakane Stronger Lempel - Ziv based compressed text indexing Algorithmica 62 1 2012 54 101
3. B.T. Ávila, and E.S. Laber Merge source coding Proc. IEEE International Symposium on Information Theory (ISIT) 2009 214 218
4. M. Baer D-ary bounded-length Huffman coding CoRR arXiv:cs/0701012v2 2007
5. R. Baeza-Yates, and B. Ribeiro-Neto Modern Information Retrieval 2nd edition 2011 Addison-Wesley
6. J. Barbay From time to space: Fast algorithms that yield small and fast data structures A. Brodnik, A. López-Ortiz, V. Raman, A. Viola, Space-Efficient Data Structures, Streams, and Algorithms (IanFest) LNCS vol. 8066 2013 Springer 97 111
7. J. Barbay, J. Fischer, and G. Navarro LRM-trees: Compressed indices, adaptive sorting, and compressed permutations Theor. Comput. Sci. 459 2012 26 41
8. J. Barbay, T. Gagie, G. Navarro, and Y. Nekrich Alphabet partitioning for compressed rank/select and applications Proc. 21st International Symposium on Algorithms and Computation (ISAAC) LNCS vol. 6507 2010 315 326
9. J. Barbay, M. He, J.I. Munro, and S.S. Rao Succinct indexes for strings, binary relations and multilabeled trees ACM Trans. Algorithms 7 4 2011 52
10. J. Barbay, and G. Navarro Compressed representations of permutations, and applications Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS) 2009 111 122
11. T. Bell, J. Cleary, and I. Witten Text Compression 1990 Prentice-Hall
12. J.L. Bentley, and A.C.-C. Yao An almost optimal algorithm for unbounded searching Inf. Process. Lett. 5 3 1976 82 87
13. N. Brisaboa, M. Luaces, G. Navarro, and D. Seco Space-efficient representations of rectangle datasets supporting orthogonal range querying Inf. Syst. 35 5 2013 635 655
14. Y.-F. Chien, W.-K. Hon, R. Shah, and J. Vitter Geometric Burrows-Wheeler transform: Linking range searching and text indexing Proc. 18th Data Compression Conference (DCC) 2008 252 261
15. T. Cover, and J. Thomas Elements of Information Theory 1991 Wiley
16. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro Compressed representations of sequences and full-text indexes ACM Trans. Algorithms 3 2 2007 20
17. J. Fischer Optimal succinctness for range minimum queries Proc. 9th Symposium on Latin American Theoretical Informatics (LATIN) LNCS vol. 6034 2010 158 169
18. F. Fomin, D. Kratsch, and J. Novelli Approximating minimum cocolorings Inf. Process. Lett. 84 2002 285 290
19. M. Fredman, and D. Willard Trans-dichotomous algorithms for minimum spanning trees and shortest paths J. Comput. Syst. Sci. 48 3 1994 533 551
20. M.L. Fredman On computing the length of longest increasing subsequences Discrete Math. 11 1975 29 35
21. A. Golynski Optimal lower bounds for rank and select indexes Theor. Comput. Sci. 387 3 2007 348 359
22. A. Golynski, J.I. Munro, and S.S. Rao Rank/select operations on large alphabets: a tool for text indexing Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2006 368 373
23. A. Golynski, R. Raman, and S. Rao On the redundancy of succinct data structures Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT) LNCS vol. 5124 2008 148 159
24. R. Grossi, A. Gupta, and J. Vitter High-order entropy-compressed text indexes Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003 841 850
25. R. Grossi, and J. Vitter Compressed suffix arrays and suffix trees with applications to text indexing and string matching SIAM J. Comput. 35 2 2006 378 407
26. A. Gupta Succinct data structures Ph.D. thesis 2007 Dept. of Computer Science, Duke University
27. A. Gupta, W.-K. Hon, R. Shah, and J. Vitter Compressed data structures: Dictionaries and data-aware measures Proc. 16th Data Compression Conference (DCC) 2006 213 222
28. D. Huffman A method for the construction of minimum-redundancy codes Proc. IRE 40 9 1952 1090 1101
29. H. Kamal, S. Mirtaheri, and A. Wagner Scalability of communicators and groups in MPI Proc. 19th ACM International Symposium on High Performance Distributed Computing (HPDC) 2010 264 275
30. J. Kärkkäinen Repetition-based text indexes Ph.D. thesis 1999 Dept. of Computer Science, University of Helsinki Finland report A-1999-4
31. A.E. Kézdy, H.S. Snevily, and C. Wang Partitioning permutations into increasing and decreasing subsequences J. Comb. Theory, Ser. A 73 2 1996 353 359
32. D.E. Knuth The Art of Computer Programming, vol. 3: Sorting and Searching 2nd edition 1998 Addison-Wesley Professional
33. C. Levcopoulos, and O. Petersson Sorting shuffled monotone sequences Inf. Comput. 112 1 1994 37 50
34. V. Mäkinen, and G. Navarro Rank and select revisited and extended Theor. Comput. Sci. 387 3 2007 332 347
35. H. Mannila Measures of presortedness and optimal sorting algorithms IEEE Trans. Comput. 34 1985 318 325
36. R.L. Milidiú, and E.S. Laber Bounding the inefficiency of length-restricted prefix codes Algorithmica 31 4 2001 513 529
37. A. Moffat, and O. Petersson An overview of adaptive sorting Aust. Comput. J. 24 2 1992 70 77
38. I. Munro Tables Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) LNCS vol. 1180 1996 37 42
39. J.I. Munro, R. Raman, V. Raman, and S.S. Rao Succinct representations of permutations and functions Theor. Comput. Sci. 438 2012 74 88
40. J.I. Munro, and P.M. Spira Sorting and searching in multisets SIAM J. Comput. 5 1 1976 1 8
41. G. Navarro, and V. Mäkinen Compressed full-text indexes ACM Comput. Surv. 39 1 2007 2
42. M. Pǎtraşcu Succincter Proc. 49th IEEE Annual Symposium on Foundations of Computer Science (FOCS) 2008 305 313
43. R. Raman, V. Raman, and S.S. Rao Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets ACM Trans. Algorithms 3 4 2007 43
44. L. Russo, G. Navarro, A. Oliveira, and P. Morales Approximate string matching with compressed indexes Algorithms 2 3 2009 1105 1136
45. K. Sadakane New text indexing functionalities of the compressed suffix arrays J. Algorithms 48 2 2003 294 313
46. K. Sadakane, and G. Navarro Fully-functional succinct trees Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2010 134 149
47. D. Sleator, and R. Tarjan Self-adjusting binary search trees J. ACM 32 3 1985 652 686
48. D. Willard Log-logarithmic worst case range queries are possible in space Θ (n) Inf. Process. Lett. 17 1983 81 84
49. I. Witten, A. Moffat, and T. Bell Managing Gigabytes 2nd edition 1999 Morgan Kaufmann Publishers