论文信息 - Succinct Encoding of Permutations: Applications to Text Indexing - 字舞流文

Succinct Encoding of Permutations: Applications to Text Indexing

Jérémy Barbay | J. Ian Munro

[1] S. Srinivasa Rao,et al. Adaptive searching in succinctly encoded binary relations and tree-structured documents , 2007, Theor. Comput. Sci..

[2] Paolo Ferragina,et al. A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.

[3] Rajeev Raman,et al. Succinct Representations of Permutations , 2003, ICALP.

[4] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5] S. Srinivasa Rao,et al. Succinct Representations of Functions , 2004, ICALP.

[6] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[7] Kunihiko Sadakane,et al. Ultra-succinct representation of ordered trees , 2007, SODA '07.

[8] S. Srinivasa Rao,et al. Succinct indexes for strings, binary relations and multi-labeled trees , 2007, SODA '07.

[9] S. Srinivasa Rao,et al. Rank/select operations on large alphabets: a tool for text indexing , 2006, SODA '06.