Structuring labeled trees for optimal succinctness, and beyond
Authors:
- P. FerraginaPFP. Ferragina
- F. LuccioFLF. Luccio
- G. ManziniGMG. Manzini
- S. MuthukrishnanSMS. Muthukrishnan
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 184-196
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Succinct ordinal trees with level-ancestor queriesACM Transactions on Algorithms, 2006
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String MatchingSIAM Journal on Computing, 2005
- Succinct representation of balanced parentheses, static trees and planar graphs2002
- Space Efficient Suffix TreesJournal of Algorithms, 2001
- An analysis of the Burrows—Wheeler transformJournal of the ACM, 2001
- XMill2000
- The design and implementation of a certifying compiler1998
- Space-efficient static trees and graphs1989
- Efficient tree pattern matching1989
- Syntax‐directed compression of program filesSoftware: Practice and Experience, 1986