Compressed representations of permutations, and applications

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 111-122

  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; COMPRESSION SCHEME; INTEGER FUNCTIONS; INVERTED LIST; ITS APPLICATIONS; PERMUTATIONS; SUCCINCT DATA STRUCTURE; SUFFIX ARRAYS;

COMPACTION; COMPUTER SCIENCE;

BYPRODUCTS;

EID: 84880226495     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. D. Arroyuelo, G. Navarro, and K. Sadakane. Reducing the space requirement of LZ-index. In Proc. 17th CPM, LNCS 4009, pages 319-330, 2006.
2. R. Baeza-Yates. A fast set intersection algorithm for sorted sequences. In Proc. 15th CPM, LNCS 3109, pages 400-408, 2004.
3. R. Baeza-Yates and B. Ribeiro. Modern Information Retrieval. Addison-Wesley, 1999.
4. J. Barbay, A. Golynski, J. I. Munro, and S. S. Rao. Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comp. Sci., 2007.
5. J. Barbay, M. He, J. I. Munro, and S. S. Rao. Succinct indexes for strings, binary relations and multi-labeled trees. In Proc. 18th SODA, pages 680-689, 2007.
6. J. Barbay, A. Lopez-Ortiz, and T. Lu. Faster adaptive set intersections for text searching. In Proc. 5th WEA, LNCS 4007, pages 146-157, 2006.
7. J. Barbay and G. Navarro. Compressed representations of permutations, and applications. Technical Report TR/DCC-2008-18, Department of Computer Science (DCC), University of Chile, December 2008. http://www.dcc.uchile.cl/TR/2008/TR- DCC-2008-018.pdf.
8. J. L. Bentley and A. C.-C. Yao. An almost optimal algorithm for unbounded searching. Inf. Proc. Lett, 5(3):82-87, 1976.
9. N. Brisaboa, A. Farina, S. Ladra, and G. Navarro. Reorganizing compressed text. In Proc. 31st SIGIR, pages 139-146, 2008.
10. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, Canada, 1996.
11. F. Claude and G. Navarro. Practical rank/select queries over arbitrary sequences. In Proc. 15th SPIRE, LNCS 5280, pages 176-187, 2008.
12. C. Cool and D. Kim. Best sorting algorithm for nearly sorted lists. Comm. ACM, 23:620-624, 1980.
13. J. Culpepper and A. Moffat. Compact set representation for information retrieval. In Proc. 14th SPIRE, pages 137-148, 2007.
14. V. Estivill-Castro and D. Wood. A survey of adaptive sorting algorithms. ACM Comp. Surv., 24(4):441-476, 1992.
15. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed representations of sequences and full-text indexes. ACM Trans. on Algorithms (TALG), 3(2):article 20, 2007.
16. M. L. Fredman. On computing the length of longest increasing subsequences. Discrete Math., 11:29-35, 1975.
17. A. Golynski. Optimal lower bounds for rank and select indexes. In Proc. 33th ICALP, LNCS 4051, pages 370-381, 2006.
18. A. Golynski, J. I. Munro, and S. S. Rao. Rank/select operations on large alphabets: a tool for text indexing. In Proc. 17th SODA, pages 368-373, 2006.
19. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th SODA, pages 841-850, 2003.
20. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. on Computing, 35(2):378-407, 2006.
21. L. Guibas, E. McCreight, M. Plass, and J. Roberts. A new representation of linear lists. In Proc. 9th STOC, pages 49-60, 1977.
22. H. Heaps. Information Retrieval - Computational and Theoretical Aspects. Academic Press, NY, 1978.
23. T. Hu and A. Tucker. Optimal computer-search trees and variable-length alphabetic codes. SIAM J. of Applied Mathematics, 21:514-532, 1971.
24. D. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E., 40(9):1090-1101, 1952.
25. J. Jansson, K. Sadakane, and W.-K. Sung. Ultra-succinct representation of ordered trees. In Proc. 18th SODA, pages 575-584, 2007.
26. A. E. Kézdy, H. S. Snevily, and C. Wang. Partitioning permutations into increasing and decreasing subsequences. J. Comb. Theory Ser. A, 73(2):353-359, 1996.
27. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 2nd edition, 1998.
28. C. Levcopoulos and O. Petersson. Sorting shuffled monotone sequences. Inf. Comp., 112(1):37-50, 1994.
29. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding. Nordic J. of Computing, 12(1):40-66, 2005.
30. V. Mäkinen and G. Navarro. Implicit compression boosting with applications to self-indexing. In Proc. 14th SPIRE, LNCS 4726, pages 214-226, 2007.
31. V. Mäkinen and G. Navarro. Rank and select revisited and extended. Theor. Comp. Sci., 387(3):332-347, 2007.
32. H. Mannila. Measures of presortedness and optimal sorting algorithms. In IEEE Trans. Comput., volume 34, pages 318-325, 1985.
33. G. Manzini. An analysis of the Burrows-Wheeler transform. J. of the ACM, 48(3):407-430, 2001.
34. K. Mehlhorn. Sorting presorted files. In Proc. 4th GI-Conference on Theoretical Computer Science, LNCS 67, pages 199-212, 1979.
35. E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Trans. on Information Systems (TOIS), 18(2):113-139, 2000.
36. I. Munro. Tables. In Proc. 16th FSTTCS, LNCS 1180, pages 37-42, 1996.
37. J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Succinct representations of permutations. In Proc. 30th ICALP, LNCS 2719, pages 345-356, 2003.
38. J. I. Munro and S. S. Rao. Succinct representations of functions. In Proc. 31st ICALP, LNCS 3142, pages 1006-1015, 2004.
39. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Comp. Surv., 39(1):article 2, 2007.
40. R. Raman, V. Raman, and S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th SODA, pages 233-242, 2002.
41. K. Sadakane. New text indexing functionalities of the compressed suffix arrays. J. of Algorithms, 48(2):294-313, 2003.
42. P. Sanders and F. Transier. Intersection in integer inverted indices. In Proc. 9th ALENEX, 2007.
43. J. Sirén, N. Välimäki, V. Mäkinen, and G. Navarro. Run-length compressed indexes are superior for highly repetitive sequence collections. In Proc. 15th SPIRE, LNCS 5280, pages 164-175, 2008.
44. S. S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28(4):775-784, 1988.
45. D. Sleator and R. Tarjan. Self-adjusting binary search trees. J. of the ACM, 32(3):652-686, 1985.
46. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Morgan Kaufmann, 2nd edition, 1999.