Optimal dynamic sequence representations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 865-875

  Navarro, Gonzalo ^a   Nekrich, Yakov ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC SEQUENCES; DYNAMIC STRUCTURE; OPTIMAL DYNAMICS; OPTIMAL TIME; SYMBOL INSERTION; ZERO-ORDER ENTROPY;

ALGORITHMS;

EID: 84876021532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.62     Document Type: Conference Paper

References (37)

1. R. Baeza-Yates and B. Ribeiro. Modern Information Retrieval. Addison-Wesley, 2nd edition, 2011.
2. J. Barbay, F. Claude, and G. Navarro. Compact rich-functional binary relation representations. In Proc. 9th LATIN, LNCS 6034, pages 170-183, 2010.
3. J. Barbay, T. Gagie, G. Navarro, and Y. Nekrich. Alphabet partitioning for compressed rank/select and applications. In Proc. 21st ISAAC, pages 315-326 (part II), 2010.
4. J. Barbay, A. Golynski, I. Munro, and S. S. Rao. Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comp. Sci., 387(3):284-297, 2007.
5. J. Barbay, M. He, I. Munro, and S. S. Rao. Succinct indexes for strings, binary relations and multi-labeled trees. ACM Trans. Alg., 7(4):article 52, 2011.
6. J. Barbay and G. Navarro. Compressed representations of permutations, and applications. In Proc. 26th STACS, pages 111-122, 2009.
7. D. Belazzougui and G. Navarro. New lower and upper bounds for representing sequences. In Proc. 20th ESA, LNCS 7501, pages 181-192, 2012.
8. G. E. Blelloch. Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. In Proc. 19th SODA, pages 894-903, 2008.
9. P. Bose, M. He, A. Maheshwari, and P. Morin. Succinct orthogonal range search structures on a grid with applications to text indexing. In Proc. 11th WADS, pages 98-109, 2009.
10. N. Brisaboa, A. Fariña, S. Ladra, and G. Navarro. Reorganizing compressed text. In Proc. 31st SIGIR, pages 139-146, 2008.
11. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
12. H. Chan, W. Hon, T. Lam, and K. Sadakane. Compressed indexes for dynamic text collections. ACM Trans. Alg., 3(2):21, 2007.
13. F. Claude and G. Navarro. Extended compact Web graph representations. In Algorithms and Applications (Ukkonen Festschrift), pages 77-91. Springer, 2010.
14. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Compressing and indexing labeled trees, with applications. J. ACM, 57(1), 2009.
15. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed representations of sequences and full-text indexes. ACM Trans. Alg., 3(2):article 20, 2007.
16. G. Franceschini and R. Grossi. A general technique for managing strings in comparison-driven data structures. In Proc. 31st ICALP, LNCS 3142, pages 606-617, 2004.
17. M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st STOC, pages 345-354, 1989.
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. González and G. Navarro. Rank/select on dynamic compressed sequences and applications. Theor. Comp. Sci., 410:4414-4422, 2009.
20. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th SODA, pages 841-850, 2003.
21. A. Gupta, W.-K. Hon, R. Shah, and J. Vitter. Dynamic rank/select dictionaries with applications to XML indexing. Tech.Rep. CSD TR #06-014, Purdue Univ., 2006.
22. M. He and I. Munro. Succinct representations of dynamic strings. In Proc. 17th SPIRE, pages 334-346, 2010.
23. W.-K. Hon, K. Sadakane, and W.-K. Sung. Succinct data structures for searchable partial sums. In Proc. 14th ISAAC, pages 505-516, 2003.
24. W. K. Hon, K. Sadakane, and W. K. Sung. Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. SIAM J. Comp., 38(6):2162-2178, 2009.
25. H. Imai and T. Asano. Dynamic segment intersection search with applications. In Proc. 25th FOCS, pages 393-402, 1984.
26. J. Kärkkäinen and S. J. Puglisi. Fixed block compression boosting in FM-indexes. In Proc. 18th SPIRE, LNCS 7024, pages 174-184, 2011.
27. V. Mäkinen and G. Navarro. Dynamic entropy-compressed sequences and full-text indexes. ACM Tran. Alg., 4(3):article 32, 2008.
28. G. Manzini. An analysis of the Burrows-Wheeler transform. J. ACM, 48(3):407-430, 2001.
29. J. I. Munro. An implicit data structure supporting insertion, deletion, and search in O(log n) time. J. Comp. Sys. Sci., 33(1):66-74, 1986.
30. G. Navarro and K. Sadakane. Fully-functional static and dynamic succinct trees. CoRR, abs/0905.0768v5, 2010.
31. To appear in ACM Trans. Alg.
32. Y. Nekrich. A dynamic stabbing-max data structure with sub-logarithmic query time. In Proc. 22nd ISAAC, pages 170-179, 2011.
33. D. Okanohara and K. Sadakane. A linear-time Burrows-Wheeler transform using induced sorting. In Proc. 16th SPIRE, LNCS 5721, pages 90-101, 2009.
34. M. Patrascu. Lower bounds for 2-dimensional range counting. In Proc. 39th STOC, pages 40-46, 2007.
35. R. Raman and S. S. Rao. Succinct dynamic dictionaries and trees. In Proc. 30th ICALP, pages 357-368, 2003.
36. N. Välimäki and V. Mäkinen. Space-efficient algorithms for document retrieval. In Proc. 18th CPM, pages 205-215, 2007.
37. D. Willard. Log-logarithmic worst-case range queries are possible in space θ(n). Inf. Proc. Lett., 17(2):81-84, 1983.