Ultra-succinct representation of ordered trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 575-584

  Jansson, Jesper ^a   Sadakane, Kunihiko ^a   Sung, Wing Kin ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMPRESSED SUFFIX TREES; DEGREE SEQUENCE; FUNDAMENTAL OPERATIONS; INFORMATION-THEORETIC LOWER BOUNDS; LOWEST COMMON ANCESTORS; SUCCINCT DATA STRUCTURE; SUCCINCT REPRESENTATION; TREE REPRESENTATION;

INFORMATION THEORY;

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

References (31)

1. M. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Computer Science, 321(1):5-12, 2004.
2. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing Trees of Higher Degree. Algorithmica, 43(4):275-292, 2005.
3. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly Spanning Trees with Applications. SIAM Journal on Computing, 34(4):924-945, 2005.
4. P. Elias. Universal codeword sets and representation of the integers. IEEE Trans. Inform. Theory, IT- 21(2):194-203, March 1975.
5. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In Proc. IEEE FOCS, pages 184-196, 2005.
6. P. Ferragina and G. Manzini. Indexing compressed texts. Journal of the ACM, 52(4):552-581, 2005.
7. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Succinct Representation of Sequences. Technical Report TR/DCC-2004-5, Dept. of Computer Science, Univ. of Chile, August 2004. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/sequences.ps.gz.
8. R. F. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. In CPM, pages 159-172, 2004.
9. R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proc. ACM-SIAM SODA, pages 1-10, 2004.
10. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In Proc. ACMSIAM SODA, pages 841-850, 2003.
11. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing, 35(2):378-407, 2005.
12. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
13. W. K. Hon, K. Sadakane, and W. K. Sung. Succinct Data Structures for Searchable Partial Sums. In Proc. of ISAAC, pages 505-516. LNCS 2906, 2003.
14. G. Jacobson. Space-efficient Static Trees and Graphs. In Proc. IEEE FOCS, pages 549-554, 1989.
15. R. Kosaraju and G. Manzini. Compression of low entropy strings with lempel-ziv algorithms. SIAM Journal on Computing, 29(3):893-911, 1999.
16. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(12):262-272, 1976.
17. D. R. Morrison. Patricia - practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15(4):514-534, 1968.
18. J. I. Munro. Tables. In Proceedings of the 16th Conference on Foundations of Software Technology and Computer Science (FSTTCS '96), LNCS 1180, pages 37-42, 1996.
19. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001.
20. J. I. Munro, V. Raman, and S. S. Rao. Space Efficient Suffix Trees. Journal of Algorithms, 39(2):205-222, May 2001.
21. J. I. Munro and S. S. Rao. Succinct Representations of Functions. In Proceedings of ICALP, LNCS 3142, pages 1006-1015, 2004.
22. J. Ian Munro, Venkatesh Raman, and S. Srinivasa Rao. Space efficient suffix trees. Journal of Algorithms, 39:205-222, 2001.
23. R. Pagh. Low Redundancy in Static Dictionaries with Constant Query Time. SIAM Journal on Computing, 31(2):353-363, 2001.
24. C. K. Poon and W. K. Yiu. Opportunistic Data Structures for Range Queries. In Proceedings of COCOON, LNCS 3595, pages 560-569, 2005.
25. R. Raman, V. Raman, and S. S. Rao. Succinct Indexable Dictionaries with Applications to Encoding k-aray Trees and Multisets. In Proc. ACM-SIAM SODA, pages 233-242, 2002.
26. S. Srinivasa Rao. Time-space trade-offs for compressed suffix arrays. Information Processing Letters, 82(6):307-311, 2002.
27. G. Rote. Binary trees having a given number of nodes with 0, 1, and 2 children, 1996. Semin. Lothar. Comb. 38, B38b, 6 pp. http://www.emis.de/journals/SLC/wpapers/s38proding.html.
28. K. Sadakane. Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays. In Proc. ACM-SIAM SODA, pages 225-232, 2002.
29. K. Sadakane. New Text Indexing Functionalities of the Compressed Suffix Arrays. Journal of Algorithms, 48(2):294-313, 2003.
30. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, 2005. In press.
31. K. Sadakane and R. Grossi. Squeezing Succinct Data Structures into Entropy Bounds. In Proc. ACM-SIAM SODA, pages 1230-1239, 2006.