Advantages of shared data structures for sequences of balanced parentheses

Data Compression Conference Proceedings

Volumn , Issue , 2010, Pages 406-415

  Gog, Simon ^a   Fischer, Johannes ^b  

^a UNIVERSITY OF ULM   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

RANGE MINIMUM QUERIES; SHARED DATA STRUCTURE; STANDARD TOOLS; SUCCINCT DATA STRUCTURE; SUFFIX-TREES;

DATA STRUCTURES; NAVIGATION; TREES (MATHEMATICS);

DATA COMPRESSION;

EID: 77952689582     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2010.43     Document Type: Conference Paper

References (20)

1. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan, "Structuring labeled trees for optimal succinctness, and beyond," in Proc. FOCS. IEEE Computer Society, 2005, pp. 184-196.
2. K. Sadakane, "Compressed suffix trees with full functionality," Theory of Computing Systems, vol. 41, no. 4, pp. 589-607, 2007.
3. J. Jansson, K. Sadakane, and W.-K. Sung, "Ultra-succinct representation of ordered trees," in Proc. SODA. ACM/SIAM, 2007, pp. 575-584.
4. J. Fischer, V. Mäkinen, and G. Navarro, "Faster entropy-bounded compressed suffix trees," Theor. Comput. Sci., vol. 410, no. 51, pp. 5354-5364, 2009.
5. G. Jacobson, "Space-efficient static trees and graphs," in Proc. FOCS. IEEE Computer Society, 1989, pp. 549-554.
6. J. I. Munro and V. Raman, "Succinct representation of balanced parentheses and static trees," SIAM J. Comput., vol. 31, no. 3, pp. 762-776, 2001.
7. R. F. Geary, N. Rahman, R. Raman, and V. Raman, "A simple optimal representation for balanced parentheses," Theor. Comput. Sci., vol. 368, no. 3, pp. 231-246, 2006.
8. M. A. Bender and M. Farach-Colton, "The LCA problem revisited," in Proc. LATIN, ser. LNCS, vol. 1776. Springer, 2000, pp. 88-94.
9. K. Sadakane and G. Navarro, "Fully-functional succinct trees," 2009, CoRR, abs/0905.0768. To be presented at SODA'10.
10. A. Golynski, "Optimal lower bounds for rank and select indexes," Theor. Comput. Sci., vol. 387, no. 3, pp. 348-359, 2007.
11. R. Raman, V. Raman, and S. S. Rao, "Succinct indexable dictionaries with applications to encoding k-ary trees and multisets," ACM Transactions on Algorithms, vol. 3, no. 4, p. Article No. 43, 2007.
12. J. I. Munro and V. Raman, "Succinct representation of balanced parentheses, static trees and planar graphs," in Proc. FOCS. IEEE Computer Society, 1997, pp. 118-126.
13. J. Fischer, "Optimal succinctness for range minimum queries," 2008, CoRR, abs/0812.2775. To be presented at LATIN'10.
14. G. Chen, S. J. Puglisi, and W. F. Smyth, "LZ factorization using less time and space," Mathematics in Computer Science, vol. 1, no. 4, pp. 605-623, 2007.
15. J. Fischer and V. Heun, "A new succinct representation of RMQ-information and improvements in the enhanced suffix array," in Proc. ESCAPE, ser. LNCS, vol. 4614. Springer, 2007, pp. 459-1170
16. J. Fischer, V. Heun, and H. M. Stühler, "Practical entropy bounded schemes for O(1)-range minimum queries," in Proc. DCC. IEEE Press, 2008, pp. 272-281.
17. K. Sadakane, "Succinct data structures for flexible text retrieval systems," J. Discrete Algorithms, vol. 5, no. 1, pp. 12-22, 2007.
18. E. Ohlebusch and S. Gog, "A compressed enhanced suffix array supporting fast string matching," in Proc. SPIRE, ser. LNCS, vol. 5721. Springer, 2009, pp. 51-62.
19. J. Fischer and V. Heun, "Finding range minima in the middle: Approximations and applications," Mathematics in Computer Science, preprint, 27 Nov. 2009, doi:10.1007/s11786-009-0007-8.
20. L. M. S. Russo, G. Navarro, and A. L. Oliveira, "Fully-compressed suffix trees," in Proc. LATIN, ser. LNCS, vol. 4957. Springer, 2008, pp. 362-373.